Relations between exact and approximate bilinear algorithms. Applications
- 1 January 1980
- journal article
- Published by Springer Nature in Calcolo
- Vol. 17 (1) , 87-97
- https://doi.org/10.1007/bf02575865
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- Approximate Solutions for the Bilinear Form Computational ProblemSIAM Journal on Computing, 1980
- New Fast Algorithms for Matrix OperationsSIAM Journal on Computing, 1980
- Border rank of a p×q×2 tensor and the optimal approximation of a pair of bilinear formsPublished by Springer Nature ,1980
- Gaussian elimination is not optimalNumerische Mathematik, 1969