A desirable form for sparse matrices when computing their inverse in factored forms

DOI10.1007/BF02239469zbMath0258.65035OpenAlexW351004208MaRDI QIDQ2559903

Yanyan Li

Publication date: 1973

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02239469

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (18)

A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ A communications system for irregular local interaction problems on a concurrent computer ⋮ Degree switching operations in networks and large scale systems assignment problems ⋮ Computational methods of linear algebra ⋮ Finite-difference methods for computing the steady flow about blunt bodies ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ A sparse matrix method for renal models ⋮ Diagonalization, rank calculation and generalized inverses of rational matrices ⋮ Use of physiological connectivity in solving renal concentrating mechanism equations ⋮ The frontal method based on mechanics and dynamic programming ⋮ On the numerical solution of a differential nonlinear eigenvalue problem on an infinite range ⋮ Constructing blockmodels: how and why ⋮ A note on solution of large sparse systems of nonlinear equations ⋮ Cubic spline on quintic spline method for nonlinear boundary value problems ⋮ Design of cellular manufacturing systems based on asymptotic forms of a Boolean matrix ⋮ On accurate solution of renal models ⋮ Recursive residue generation method for laser-molecule interaction: Utilization of structured sparsity ⋮ Estimation and control of large sparse systems

Cites Work

• Unnamed Item
• The Elimination form of the Inverse and its Application to Linear Programming
• The Crout reduction for sparse matrices
• Solution of a system of simultaneous linear equations with a sparse coefficient matrix by elimination methods
• Sparse matrices

This page was built for publication: A desirable form for sparse matrices when computing their inverse in factored forms