A desirable form for sparse matrices when computing their inverse in factored forms
From MaRDI portal
Publication:2559903
DOI10.1007/BF02239469zbMATH Open0258.65035OpenAlexW351004208MaRDI QIDQ2559903FDOQ2559903
Authors: Yanyan Li
Publication date: 1973
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02239469
Cites Work
Cited In (18)
- The frontal method based on mechanics and dynamic programming
- On the numerical solution of a differential nonlinear eigenvalue problem on an infinite range
- 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
- Computational methods of linear algebra
- Cubic spline on quintic spline method for nonlinear boundary value problems
- Comparison of two pivotal strategies in sparse plane rotations
- Design of cellular manufacturing systems based on asymptotic forms of a Boolean matrix
- Estimation and control of large sparse systems
- On accurate solution of renal models
- Degree switching operations in networks and large scale systems assignment problems
- A note on solution of large sparse systems of nonlinear equations
- Recursive residue generation method for laser-molecule interaction: Utilization of structured sparsity
- Finite-difference methods for computing the steady flow about blunt bodies
- Constructing blockmodels: how and why
- 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
This page was built for publication: A desirable form for sparse matrices when computing their inverse in factored forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2559903)