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

DOI10.1080/0020739840150307zbMATH Open0567.65014OpenAlexW1993873878MaRDI QIDQ3683417FDOQ3683417

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

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

Cites Work

• Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems 👍 👎
• A New Computational Method for the Sparsest Solutions to Systems of Linear Equations 👍 👎
• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization 👍 👎
• The computer generated symbolic solution of a system of linear first order differential equations 👍 👎
• Sparse algorithms for indefinite system of linear equations 👍 👎
• Systolic algorithms for solving a sparse system of linear equations in circuit simulation 👍 👎
• Efficient Solution of a Sparse Non-symmetric System of Linear Equations 👍 👎
• Application of the Cramer rule in the solution of sparse systems of linear algebraic equations 👍 👎

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

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