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

DOI10.1080/0020739840150307MaRDI QIDQ3683417zbMATH OpenOpenAlexFDO

Authors I. R. Ibbitson, D. Boardman

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

Crout algorithmLU decompositionsparsity exploitationsymbolic code generation

Mathematics Subject Classification ID

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

Recommendations

• A new computational method for the sparsest solutions to systems of linear equations
• Publication:3486755
• Systolic algorithms for solving a sparse system of linear equations in circuit simulation
• Sparse algorithms for indefinite system of linear equations
• 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
• The computer generated symbolic solution of a system of linear first order differential equations
• scientific article; zbMATH DE number 3862321
• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
• A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems

Cites work

• scientific article; zbMATH DE number 3559405 (Why is no real title available?)
• Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear 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)