Solution of a sparse linear system by using digraph

DOI10.1080/00207160008804930MaRDI QIDQ4954027zbMATH OpenOpenAlexFDO

Authors Ahmad Al-Kurdi, R. C. Mittal

Publication date 4 March 2001

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

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

zbMATH Keywords

CPU timeCramer's ruledeterminantdigraphnumerical examplespermanentsparse linear systemstorage scheme

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Probabilistic models, generic numerical methods in probability and statistics (65C20) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Solving sparse linear systems of equations using the modified digraph approach
• scientific article; zbMATH DE number 4211357
• Application of the Cramer rule in the solution of sparse systems of linear algebraic equations
• scientific article; zbMATH DE number 3862321

Cites work

• Computer program for solution of large, sparse, unsymmetric systems of linear equations
• scientific article; zbMATH DE number 3663031 (Why is no real title available?)
• scientific article; zbMATH DE number 787736 (Why is no real title available?)

Cited in

(4)

• scientific article; zbMATH DE number 4211357 (Why is no real title available?)
• Efficient Solution of a Sparse Non-symmetric System of Linear Equations
• Solving sparse linear systems of equations using the modified digraph approach
• Application of the Cramer rule in the solution of sparse systems of linear algebraic equations

This page was built for publication: Solution of a sparse linear system by using digraph

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