Relations between exact and approximate bilinear algorithms. Applications

Cites work

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?)
Approximate Solutions for the Bilinear Form Computational Problem
Gaussian elimination is not optimal
Methods of matrix algebra
New Fast Algorithms for Matrix Operations
\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication

Cited in

(41)

Partial Degeneration of Tensors
A lower bound for the border rank of a bilinear map
scientific article; zbMATH DE number 7689792 (Why is no real title available?)
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
Complexity measures for matrix multiplication algorithms
On the closures of monotone algebraic classes and variants of the determinant
Rank and border rank of Kronecker powers of tensors and Strassen's laser method
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
Tensors in computations
Fast matrix multiplication and its algebraic neighbourhood
On the asymptotic complexity of rectangular matrix multiplication
A note on VNP-completeness and border complexity
The bilinear complexity and practical algorithms for matrix multiplication
Border Rank Nonadditivity for Higher Order Tensors
A new approach for computing the inverse of confluent Vandermonde matrices via Taylor's expansion
Fast inversion of triangular Toeplitz matrices
Matrix structures in parallel matrix computations
On the closures of monotone algebraic classes and variants of the determinant
An introduction to the computational complexity of matrix multiplication
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
Fast commutative matrix algorithms
Reply to the paper The numerical instability of Bini's algorithm
On the structure tensor of \(\mathfrak{sl}_n\)
Unifying known lower bounds via geometric complexity theory
The G-stable rank for tensors and the cap set problem
On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
Border rank is not multiplicative under the tensor product
Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science
The matrix capacity of a tensor
Fast parallel algorithms for polynomial division over an arbitrary field of constants
The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
Tensor rank is not multiplicative under the tensor product
New lower bounds for matrix multiplication and
scientific article; zbMATH DE number 7561749 (Why is no real title available?)
Rank and optimal computation of generic tensors
Fast matrix multiplication without APA-algorithms
Fast arithmetic for triangular sets: from theory to practice
Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues

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)