Triangular Factorization and Inversion by Fast Matrix Multiplication
From MaRDI portal
Publication:4402461
DOI10.2307/2005828zbMath0276.15006OpenAlexW4253198034WikidataQ56600874 ScholiaQ56600874MaRDI QIDQ4402461
John E. Hopcrofts, James R. Bunch
Publication date: 1974
Full work available at URL: https://doi.org/10.2307/2005828
Analysis of algorithms and problem complexity (68Q25) Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06)
Related Items
Approximation of insurance liability contracts using radial basis functions, Low-rank traffic matrix completion with marginal information, Faster geometric algorithms via dynamic determinant computation, Maximum matchings in planar graphs via Gaussian elimination, Observability and reconstructibility of bounded cellular automata, Fast dynamic transitive closure with lookahead, Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, Alternating paths along axis-parallel segments, Maximum matchings in geometric intersection graphs, Skew-polynomial-sparse matrix multiplication, Reverse-Safe Text Indexing, Designing efficient dyadic operations for cryptographic applications, Fairness in temporal slot assignment, Structural control of single-input rank one bilinear systems, Reduced-order modeling of neutron transport eigenvalue problems separated in energy by proper generalized decomposition, Computational methods of linear algebra, A fast randomized geometric algorithm for computing Riemann-Roch spaces, Unnamed Item, On efficient calculations for Bayesian variable selection, Rank-profile revealing Gaussian elimination and the CUP matrix decomposition, Fast matrix multiplication and its algebraic neighbourhood, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Efficiently hex-meshing things with topology, Efficient decomposition of separable algebras., A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes, Deterministic computation of the characteristic polynomial in the time of matrix multiplication, On the complexity of matrix reduction over finite fields, Some computational problems in linear algebra as hard as matrix multiplication, A segregated approach for modeling the electrochemistry in the 3-D microstructure of li-ion batteries and its acceleration using block preconditioners, Unnamed Item, Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation, Essentially optimal computation of the inverse of generic polynomial matrices, A Gröbner free alternative for polynomial system solving, Fast Generalized Bruhat Decomposition, On the implementation of Strassen's fast multiplication algorithm, Unnamed Item, Unnamed Item, Representative families for matroid intersections, with applications to location, packing, and covering problems, Algebraic Algorithms for Linear Matroid Parity Problems, Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic, Adjoint Code Design Patterns, An algebraic attack on rank metric code-based cryptosystems, Generalized persistence algorithm for decomposing multiparameter persistence modules, An adaptive conservative moving mesh method, Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm, Parameterized Pre-Coloring Extension and List Coloring Problems, Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors, Upper bounds on the complexity of solving systems of linear equations, Fast algorithms for the characteristic polynomial, A fast algorithm to construct a representation for transversal matroids
Cites Work
