On Block Elimination for Sparse Linear Systems

DOI10.1137/0711050zbMATH Open0253.65014OpenAlexW2167322096MaRDI QIDQ5667409FDOQ5667409

Authors:

Publication date: 1974

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0711050

Mathematics Subject Classification ID

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

Cited In (7)

• A survey of direct methods for sparse linear systems
• Analysis of dissection algorithms for vector computers
• Computational methods of linear algebra
• Partitioning, tearing and modification of sparse linear systems
• Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
• Characteristics study of an electronic systems design strategy
• A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods

This page was built for publication: On Block Elimination for Sparse Linear Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5667409)