A lower bound for the border rank of a bilinear map (Q1088760): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Relations between exact and approximate bilinear algorithms. Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tensor Rank and Border Rank of Band Toeplitz Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the optimal evaluation of a set of bilinear forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on border rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rank and optimal computation of generic tensors / rank | |||
Normal rank |
Revision as of 17:47, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for the border rank of a bilinear map |
scientific article |
Statements
A lower bound for the border rank of a bilinear map (English)
0 references
1986
0 references
Let A and M be finite-dimensional vector spaces over an algebraically closed field and \(f: A\times M\to M\) a bilinear map. Choosing bases in A and M, f can be described by its component bilinear forms \(f_ i\). In the analysis of the computational complexity of the \(f_ i\) the concepts of rank R(f) and border rank Ṟ(f) arise naturally: these are the number of nonscalar multiplications necessary and sufficient to compute or approximate, respectively, the \(f_ i\) in the (noncommuting) indeterminates. The author generalizes a theorem of Strassen to obtain lower bounds for the border rank of tensors and gives some applications.
0 references
bilinear forms
0 references
computational complexity
0 references
lower bounds
0 references
border rank of tensors
0 references