Computational complexity of operations involving perfect elimination sparse matrices

DOI10.1080/00207167708803127zbMath0349.65018OpenAlexW2034602573MaRDI QIDQ4120049

Fernando L. Alvarado

Publication date: 1977

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167708803127

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Constructing blockmodels: how and why

Cites Work

• Gaussian elimination is not optimal
• On computing certain elements of the inverse of a sparse matrix
• Sparse matrices

This page was built for publication: Computational complexity of operations involving perfect elimination sparse matrices