How to multiply matrices faster
From MaRDI portal
monographbilinear algorithmsmatrix multiplicationcondition numbersmatrix inversionStrassen's algorithmcomplexity of algorithmsall pair shortest distance problemAPA- algorithmsasymptotically fast algorithmsbit-time and bit-space conceptsprecision approximation algorithmstrilinear aggregating
Direct numerical methods for linear systems and matrix inversion (65F05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of determinants (65F40)
Recommendations
Cited in
(58)- Guessing singular dependencies
- Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
- scientific article; zbMATH DE number 3854415 (Why is no real title available?)
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- scientific article; zbMATH DE number 4145232 (Why is no real title available?)
- FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES
- A non-recursive algorithm for classifying the states of a finite Markov chain
- Optimization techniques for small matrix multiplication
- On the direct sum conjecture in the straight line model
- Fast and efficient parallel solution of dense linear systems
- On the complexity of a pivot step of the revised simplex algorithm
- Oracle computations in parallel numerical linear algebra
- On practical algorithms for accelerated matrix multiplication
- Speedup for natural problems and noncomputability
- Parallel evaluation of the determinant and of the inverse of a matrix
- Information-based complexity: New questions for mathematicians
- Matrix multiplication for finite algebraic systems
- Efficient parallel linear programming
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
- Algorithms for fast convolutions on motion groups
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- On transformations of algorithms to multiply 2\(\times 2\) matrices
- On the arithmetic complexity of Strassen-like matrix multiplications
- Extended concept of significant digits and lower precision computations
- A logarithmic Boolean time algorithm for parallel polynomial division
- Statistical complexity of dominant eigenvector calculation
- Why does information-based complexity use the real number model?
- FFT-like multiplication of linear differential operators
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Binary segmentation for matrix and vector operations
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks
- Fast rectangular matrix multiplication and applications
- Matrix structures in parallel matrix computations
- Bit complexity of matrix products
- Algebraic and numerical techniques for the computation of matrix determinants
- Newton's method and FFT trading
- On the complexity of linear quadratic control
- Algebraic complexity of computing polynomial zeros
- scientific article; zbMATH DE number 4088834 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- Parallel nested dissection for path algebra computations
- Rectangular matrix multiplication revisited
- Bilinear mincing rank
- Complexity of parallel matrix computations
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Fast and efficient linear programming and linear least-squares computations
- Fast matrix multiplication and its algebraic neighbourhood
- On the complexity of skew arithmetic
- Polynomial division and its computational complexity
- Nonuniform ACC circuit lower bounds
- Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
- Fast and efficient solution of path algebra problems
- On multivariate polynomials in Bernstein-Bézier form and tensor algebra
- Fast finite methods for a system of linear inequalities
- Using fast matrix multiplication to find basic solutions
This page was built for publication: How to multiply matrices faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799337)
