Triangular Factorization and Inversion by Fast Matrix Multiplication

DOI10.2307/2005828zbMath0276.15006WikidataQ56600874 ScholiaQ56600874MaRDI QIDQ4402461

James R. Bunch, John E. Hopcrofts

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/2005828

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

15A09: Theory of matrix inversion and generalized inverses

65F05: Direct numerical methods for linear systems and matrix inversion

15A06: Linear equations (linear algebraic aspects)

Related Items

A Gröbner free alternative for polynomial system solving, A fast algorithm to construct a representation for transversal matroids, Faster geometric algorithms via dynamic determinant computation, On efficient calculations for Bayesian variable selection, Efficiently hex-meshing things with topology, Some computational problems in linear algebra as hard as matrix multiplication, Fast dynamic transitive closure with lookahead, Alternating paths along axis-parallel segments, Structural control of single-input rank one bilinear systems, Upper bounds on the complexity of solving systems of linear equations, Fast algorithms for the characteristic polynomial, Computational methods of linear algebra, On the implementation of Strassen's fast multiplication algorithm, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Efficient decomposition of separable algebras., Essentially optimal computation of the inverse of generic polynomial matrices, Maximum matchings in planar graphs via Gaussian elimination, Rank-profile revealing Gaussian elimination and the CUP matrix decomposition, On the complexity of matrix reduction over finite fields, Algebraic Algorithms for Linear Matroid Parity Problems, Fast Generalized Bruhat Decomposition

Cites Work

• Gaussian elimination is not optimal
• Unnamed Item
• Unnamed Item
• Unnamed Item