Nearly Optimal Algorithms for Canonical Matrix Forms.
Mark GiesbrechtPublished in: SIAM J. Comput. (1995)
Keyphrases
- worst case
- learning algorithm
- significant improvement
- benchmark datasets
- orders of magnitude
- linear algebra
- matrix multiplication
- theoretical analysis
- times faster
- recently developed
- perturbation theory
- data sets
- approximately optimal
- efficient algorithms for computing
- space complexity
- singular value decomposition
- computational efficiency
- optimization problems
- computational complexity
- data structure
- data mining