Computational complexity of operations involving perfect elimination sparse matrices

DOI10.1080/00207167708803127MaRDI QIDQ4120049zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(1)

• Constructing blockmodels: how and why

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

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