On the Complexity of Sparse Gaussian Elimination via Bordering

DOI10.1137/0911009zbMATH Open0701.65018OpenAlexW2050704600MaRDI QIDQ3479439FDOQ3479439

Authors: Randolph E. Bank, Donald J. Rose 

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6e063d05f7774fe5879f56e750365debed998233

Recommendations

• Parallel sparse Gaussian elimination with partial pivoting
• A new bordering strategy for solving block-tridiagonal linear systems
• Distributed Sparse Gaussian Elimination and Orthogonal Factorization
• Fast and Efficient Parallel Solution of Sparse Linear Systems
• On the ordering of sparse linear systems

zbMATH Keywords

data structuresimplementationnumerical complexityGaussian elimination algorithmsparse Gaussian eliminationbordering algorithmm-tree

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Cited In (3)

• A survey of direct methods for sparse linear systems
• Sparse Gaussian Elimination Modulo p: An Update
• A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)

This page was built for publication: On the Complexity of Sparse Gaussian Elimination via Bordering

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