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
(60)- Fast finite methods for a system of linear inequalities
- Fast rectangular matrix multiplication and applications
- Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs
- Guessing singular dependencies
- On the complexity of skew arithmetic
- Parametrization of Newton's iteration for computations with structured matrices and applications
- 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 algorithms
- Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
- Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
- On practical algorithms for accelerated matrix multiplication
- On the direct sum conjecture in the straight line model
- Fast matrix multiplication and its algebraic neighbourhood
- Matrix multiplication via arithmetic progressions
- Bilinear mincing rank
- Rectangular matrix multiplication revisited
- 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 MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES
- 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
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition
- 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
- scientific article; zbMATH DE number 4145232 (Why is no real title available?)
- Speedup for natural problems and noncomputability
- Information-based complexity: New questions for mathematicians
- Nonuniform ACC circuit lower bounds
- Binary segmentation for matrix and vector operations
- scientific article; zbMATH DE number 4088834 (Why is no real title available?)
- On transformations of algorithms to multiply 2 2 matrices
- Solving sparse linear systems faster than matrix multiplication
- Extended concept of significant digits and lower precision computations
- Statistical complexity of dominant eigenvector calculation
- On the arithmetic complexity of Strassen-like matrix multiplications
- A logarithmic Boolean time algorithm for parallel polynomial division
- scientific article; zbMATH DE number 3854415 (Why is no real title available?)
- Algebraic complexity of computing polynomial zeros
- Fine-grained analysis and faster algorithms for iteratively solving linear systems
- 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
- 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
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)
