Relations between exact and approximate bilinear algorithms. Applications
From MaRDI portal
Publication:1152203
DOI10.1007/BF02575865zbMath0459.65028OpenAlexW2002048434MaRDI QIDQ1152203
Publication date: 1980
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02575865
computational complexitymatrix multiplicationAPA-algorithmscalculation of bilinear formsEC-algorithms
Analysis of algorithms and problem complexity (68Q25) Quadratic and bilinear forms, inner products (15A63)
Related Items
A note on VNP-completeness and border complexity, Tensors in computations, Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues, A lower bound for the border rank of a bilinear map, Fast commutative matrix algorithms, The \(G\)-stable rank for tensors and the cap set problem, The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms, Matrix structures in parallel matrix computations, An introduction to the computational complexity of matrix multiplication, The bilinear complexity and practical algorithms for matrix multiplication, Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science, On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry, On the structure tensor of \(\mathfrak{sl}_n\), Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation, The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\), Partial Degeneration of Tensors, New lower bounds for matrix multiplication and, On the closures of monotone algebraic classes and variants of the determinant, Tensor rank is not multiplicative under the tensor product, Complexity measures for matrix multiplication algorithms, The matrix capacity of a tensor, Fast matrix multiplication and its algebraic neighbourhood, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, Unnamed Item, Reply to the paper The numerical instability of Bini's algorithm, Fast matrix multiplication without APA-algorithms, Border Rank Is Not Multiplicative under the Tensor Product, On the asymptotic complexity of rectangular matrix multiplication, Fast inversion of triangular Toeplitz matrices, On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices, Unnamed Item, Fast arithmetic for triangular sets: from theory to practice, Rank and border rank of Kronecker powers of tensors and Strassen's laser method, Fast parallel algorithms for polynomial division over an arbitrary field of constants, Border Rank Nonadditivity for Higher Order Tensors, Rank and optimal computation of generic tensors, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, A new approach for computing the inverse of confluent Vandermonde matrices via Taylor's expansion, Unifying known lower bounds via geometric complexity theory, A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
Cites Work
