On the Complexity of Sparse Gaussian Elimination via Bordering

DOI10.1137/0911009zbMath0701.65018OpenAlexW2050704600MaRDI QIDQ3479439

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

zbMATH Keywords

data structuresm-treeimplementationsparse Gaussian eliminationnumerical complexityGaussian elimination algorithmbordering algorithm

Mathematics Subject Classification ID

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

Related Items (1)

A survey of direct methods for sparse linear systems

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