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