Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations

DOI10.1080/0020739840150307zbMath0567.65014OpenAlexW1993873878MaRDI QIDQ3683417

D. Boardman, I. R. Ibbitson

Publication date: 1984

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

LU decompositionCrout algorithmsparsity exploitationsymbolic code generation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
• Unnamed Item

This page was built for publication: Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations