Approximate Solutions for the Bilinear Form Computational Problem
Abstract
A set of bilinear forms can be evaluated with a multiplicative complexity lower than the rank of the associated tensor by allowing an arbitrarily small error. A topological interpretation of this fact is presented together with the error analysis. A complexity measure is introduced which takes into account the numerical stability of algorithms. Relations are established between the complexities of exact and approximate algorithms.
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
D. Bini, Border tensorial rank of triangular Toeplitz matrices, Report, B-78-26, I.E.I., Pisa, 1978, December
2.
D. Bini, Relations between exact and approximate bilinear algorithms. Applications, Calcolo, 17 (1980), 87–97
3.
D. Bini, M. Capovani, G. Lotti, F. Romani, $O(n\sp{2.7799})$ complexity for $n\times n$ approximate matrix multiplication, Inform. Process. Lett., 8 (1979), 234–235
4.
D. Bini, G. Lotti, F. Romani, Stability and complexity in the evaluation of a set of bilinear forms, Report, B-78-25, I.E.I., Pisa, 1978, November
5.
Roger W. Brockett, David Dobkin, On the optimal evaluation of a set of bilinear forms, Linear Algebra and Appl., 19 (1978), 207–235
6.
V. Ya. Pan, Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplication, Proc. 20th Ann. Symp. on Foundation of Comp. Science, 1979, 28–30
7.
F. Romani, Complexity measures for matrix multiplication algorithms, Calcolo, 17 (1980), 77–86
8.
A. Schönhage, Partial and total matrix multiplication, Internal Report, University of Tübingen, 1980, January
9.
J. Van Leeuwen, P. Van Emde Boas, Some elementary proofs of lower bounds in complexity theory, Linear Algebra and Appl., 19 (1978), 63–80
Information & Authors
Information
Published In
Copyright
Copyright © 1980 Society for Industrial and Applied Mathematics.
History
Submitted: 24 January 1979
Published online: 13 July 2006
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Border Ranks of Positive and Invariant Tensor Decompositions: Applications to CorrelationsQuantum, Vol. 9 | 26 February 2025
- Arbitrary Precision Approximating AlgorithmsFast Matrix Multiplication with Applications | 27 February 2025
- The resource theory of tensor networksQuantum, Vol. 8 | 11 December 2024
- The tensor as an informational resourcePNAS Nexus, Vol. 3, No. 9 | 28 June 2024
- Rank of a tensor and quantum entanglementLinear and Multilinear Algebra, Vol. 72, No. 11 | 18 May 2023
- Quantifying subspace entanglement with geometric measuresPhysical Review A, Vol. 110, No. 1 | 22 July 2024
- Stability improvements for fast matrix multiplicationNumerical Algorithms, Vol. 13 | 20 April 2024
- Numerical stability and tensor nuclear normNumerische Mathematik, Vol. 155, No. 3-4 | 3 November 2023
- Bad and Good News for Strassen’s Laser Method: Border Rank of $$\mathrm{Perm}_3$$ and Strict SubmultiplicativityFoundations of Computational Mathematics, Vol. 23, No. 6 | 12 August 2022
- New lower bounds for matrix multiplication andForum of Mathematics, Pi, Vol. 11 | 29 May 2023
- Minimal divergence for border rank-2 tensor approximationLinear and Multilinear Algebra, Vol. 70, No. 20 | 16 March 2021
- Rank and border rank of Kronecker powers of tensors and Strassen's laser methodcomputational complexity, Vol. 31, No. 1 | 18 December 2021
- Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer scienceDifferential Geometry and its Applications, Vol. 82 | 1 Jun 2022
- A note on VNP-completeness and border complexityInformation Processing Letters, Vol. 176 | 1 Jun 2022
- Accelerating Neural Network Training using Arbitrary Precision Approximating Matrix Multiplication Algorithms50th International Conference on Parallel Processing Workshop | 23 September 2021
- Tensors in computationsActa Numerica, Vol. 30 | 4 August 2021
- Optimization at the boundary of the tensor network varietyPhysical Review B, Vol. 103, No. 19 | 18 May 2021
- Randomization of approximate bilinear computation for matrix multiplicationInternational Journal of Computer Mathematics: Computer Systems Theory, Vol. 6, No. 1 | 30 December 2020
- Tensor Linear Regression: Degeneracy and SolutionIEEE Access, Vol. 9 | 1 Jan 2021
- Tensor network representations from the geometry of entangled statesSciPost Physics, Vol. 9, No. 3 | 30 September 2020
- Minimum entangling power is close to its maximumJournal of Physics A: Mathematical and Theoretical, Vol. 52, No. 21 | 25 April 2019
- Tensor rank is not multiplicative under the tensor productLinear Algebra and its Applications, Vol. 543 | 1 Apr 2018
- Fast matrix multiplication and its algebraic neighbourhoodSbornik: Mathematics, Vol. 208, No. 11 | 29 January 2018
- On best rank-2 and rank-(2,2,2) approximations of order-3 tensorsLinear and Multilinear Algebra, Vol. 65, No. 7 | 27 September 2016
- Entanglement Distillation from Greenberger–Horne–Zeilinger SharesCommunications in Mathematical Physics, Vol. 352, No. 2 | 18 March 2017
- Быстрое умножение матриц и смежные вопросы алгебрыМатематический сборник, Vol. 208, No. 11 | 27 October 2017
- $$P\mathop{ =}\limits^{?}NP$$Open Problems in Mathematics | 6 July 2016
- A framework for practical parallel fast matrix multiplicationACM SIGPLAN Notices, Vol. 50, No. 8 | 24 January 2015
- Asymptotic entanglement transformation between W and GHZ statesJournal of Mathematical Physics, Vol. 56, No. 2 | 20 February 2015
- A framework for practical parallel fast matrix multiplicationProceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming | 24 January 2015
- Numerical tensor calculusActa Numerica, Vol. 23 | 12 May 2014
- Blind Multilinear IdentificationIEEE Transactions on Information Theory, Vol. 60, No. 2 | 1 Feb 2014
- On Generic Nonexistence of the Schmidt--Eckart--Young Decomposition for Complex TensorsSIAM Journal on Matrix Analysis and Applications, Vol. 35, No. 3 | 8 July 2014
- Stability of Finite AlgorithmsThe Concept of Stability in Numerical Mathematics | 25 December 2014
- Tensors and HypermatricesHandbook of Linear Algebra, Second Edition | 26 November 2013
- Fast Matrix MultiplicationHandbook of Linear Algebra, Second Edition | 26 November 2013
- A Three-Way Jordan Canonical Form as Limit of Low-Rank Tensor ApproximationsSIAM Journal on Matrix Analysis and Applications, Vol. 34, No. 2 | 30 May 2013
- Candecomp/Parafac: From Diverging Components to a Decomposition in Block TermsSIAM Journal on Matrix Analysis and Applications, Vol. 33, No. 2 | 17 April 2012
- A weak degeneracy revealing decomposition for the CANDECOMP/PARAFAC modelJournal of Chemometrics, Vol. 24, No. 2 | 18 January 2010
- Tensors versus matrices usefulness and unexpected properties2009 IEEE/SP 15th Workshop on Statistical Signal Processing | 1 Aug 2009
- Nonnegative approximations of nonnegative tensorsJournal of Chemometrics, Vol. 23, No. 7-8 | 23 June 2009
- Fast arithmetic for triangular sets: From theory to practiceJournal of Symbolic Computation, Vol. 44, No. 7 | 1 Jul 2009
- Low-Rank Approximation of Generic $p \timesq \times2$ Arrays and Diverging Components in the Candecomp/Parafac ModelSIAM Journal on Matrix Analysis and Applications, Vol. 30, No. 3 | 25 September 2008
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation ProblemSIAM Journal on Matrix Analysis and Applications, Vol. 30, No. 3 | 25 September 2008
- Fast arithmetic for triangular setsProceedings of the 2007 international symposium on Symbolic and algebraic computation | 29 July 2007
- Multivariate power series multiplicationProceedings of the 2005 international symposium on Symbolic and algebraic computation | 24 July 2005
- A note on checking matrix products (extended abstract)Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's | 1 March 1992
- Matrix structures in parallel matrix computationsCalcolo, Vol. 25, No. 1-2 | 1 Mar 1988
- Tensor Rank and Border Rank of Band Toeplitz MatricesSIAM Journal on Computing, Vol. 16, No. 2 | 13 July 2006
- On the Validity of the Direct Sum ConjectureSIAM Journal on Computing, Vol. 15, No. 4 | 31 July 2006
- Border rank of m×n×(mn−q) tensorsLinear Algebra and its Applications, Vol. 79 | 1 Jul 1986
- Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix MultiplicationSIAM Journal on Computing, Vol. 15, No. 2 | 13 July 2006
- Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systemsCalcolo, Vol. 23, No. 1 | 1 Jan 1986
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, Vol. 13, No. 2 | 13 July 2006
- On the asymptotic complexity of rectangular matrix multiplicationTheoretical Computer Science, Vol. 23, No. 2 | 1 Jan 1983
- On commutativity and approximationTheoretical Computer Science, Vol. 28, No. 1-2 | 1 Jan 1983
- Some Properties of Disjoint Sums of Tensors Related to Matrix MultiplicationSIAM Journal on Computing, Vol. 11, No. 2 | 31 July 2006
- Reply to the paper “the numerical instability of Bini's algorithm”Information Processing Letters, Vol. 14, No. 3 | 1 May 1982
- Complexity measures for matrix multiplication algorithmsCalcolo, Vol. 17, No. 1 | 1 Jan 1980
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, Vol. 17, No. 1 | 1 Jan 1980
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].