Relations between exact and approximate bilinear algorithms. Applications

Cites work

\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
Approximate Solutions for the Bilinear Form Computational Problem
Gaussian elimination is not optimal
scientific article; zbMATH DE number 3696495 (Why is no real title available?)
scientific article; zbMATH DE number 3269388 (Why is no real title available?)
scientific article; zbMATH DE number 3090171 (Why is no real title available?)
Methods of matrix algebra
New Fast Algorithms for Matrix Operations

Cited in

(50)

Fast arithmetic for triangular sets: from theory to practice
Rank and optimal computation of generic tensors
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
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
Matrix structures in parallel matrix computations
Complexity measures for matrix multiplication algorithms
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
Reply to the paper The numerical instability of Bini's algorithm
Fast matrix multiplication without APA-algorithms
On the asymptotic complexity of rectangular matrix multiplication
Tensor rank is not multiplicative under the tensor product
The matrix capacity of a tensor
Rank and border rank of Kronecker powers of tensors and Strassen's laser method
A note on VNP-completeness and border complexity
Fast commutative matrix algorithms
The G-stable rank for tensors and the cap set problem
An introduction to the computational complexity of matrix multiplication
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
Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
On the structure tensor of \(\mathfrak{sl}_n\)
The bilinear complexity and practical algorithms for matrix multiplication
Fast matrix multiplication and its algebraic neighbourhood
Fast parallel algorithms for polynomial division over an arbitrary field of constants
On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
Border Rank Nonadditivity for Higher Order Tensors
scientific article; zbMATH DE number 7561749 (Why is no real title available?)
On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
Border rank is not multiplicative under the tensor product
A new approach for computing the inverse of confluent Vandermonde matrices via Taylor's expansion
Tensors in computations
Fast inversion of triangular Toeplitz matrices
scientific article; zbMATH DE number 7689792 (Why is no real title available?)
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
On the closures of monotone algebraic classes and variants of the determinant
Tensor rank and complexity
Fixed-parameter debordering of Waring rank
Homogeneous algebraic complexity theory and algebraic formulas
On matrix multiplication and polynomial identity testing
Ranks of tensors: geometry and applications
Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’
Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)
Border apolarity and varieties of sums of powers
Symmetrization maps and minimal border rank Comon's conjecture
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations

This page was built for publication: Relations between exact and approximate bilinear algorithms. Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152203)