How to multiply matrices faster
zbMATH Open0548.65022MaRDI QIDQ799337FDOQ799337
Publication date: 1984
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
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)
Cited In (55)
- Fast rectangular matrix multiplication and applications
- Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs
- Parametrization of Newton's iteration for computations with structured matrices and applications
- On the complexity of skew arithmetic
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- On the complexity of linear quadratic control
- Parallel nested dissection for path algebra computations
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
- Fast matrix multiplication and its algebraic neighbourhood
- On the direct sum conjecture in the straight line model
- On practical algorithms for accelerated matrix multiplication
- Matrix multiplication via arithmetic progressions
- Rectangular matrix multiplication revisited
- Bilinear mincing rank
- Fast and efficient solution of path algebra problems
- Matrix multiplication for finite algebraic systems
- Algorithms for fast convolutions on motion groups
- Matrix structures in parallel matrix computations
- Algebraic and numerical techniques for the computation of matrix determinants
- Fast and efficient linear programming and linear least-squares computations
- FFT-like multiplication of linear differential operators
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Fast and efficient parallel solution of dense linear systems
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
- Newton's method and FFT trading
- Speedup for natural problems and noncomputability
- Information-based complexity: New questions for mathematicians
- Binary segmentation for matrix and vector operations
- On transformations of algorithms to multiply 2\(\times 2\) matrices
- A logarithmic Boolean time algorithm for parallel polynomial division
- On the arithmetic complexity of Strassen-like matrix multiplications
- Extended concept of significant digits and lower precision computations
- Statistical complexity of dominant eigenvector calculation
- Algebraic complexity of computing polynomial zeros
- Efficient parallel linear programming
- Oracle computations in parallel numerical linear algebra
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks
- On the complexity of a pivot step of the revised simplex algorithm
- Parallel evaluation of the determinant and of the inverse of a matrix
- Nonuniform ACC Circuit Lower Bounds
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix
- Optimization techniques for small matrix multiplication
- Bit complexity of matrix products
- Why does information-based complexity use the real number model?
- Polynomial division and its computational complexity
- Complexity of parallel matrix computations
- On multivariate polynomials in Bernstein-Bézier form and tensor algebra
- Using fast matrix multiplication to find basic solutions
- A non-recursive algorithm for classifying the states of a finite Markov chain
- Fast finite methods for a system of linear inequalities
- Guessing singular dependencies
- Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
- FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
Recommendations
- On practical algorithms for accelerated matrix multiplication 👍 👎
- Fast matrix multiplication and its algebraic neighbourhood 👍 👎
- Title not available (Why is that?) 👍 👎
- Fast rectangular matrix multiplication and applications 👍 👎
- The bilinear complexity and practical algorithms for matrix multiplication 👍 👎
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)
