Solution of a sparse linear system by using digraph

DOI10.1080/00207160008804930zbMath0955.65015OpenAlexW2052625286MaRDI QIDQ4954027

Ahmad Al-Kurdi, Ramesh Chand 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

numerical examplesdigraphdeterminantpermanentCramer's rulesparse linear systemCPU timestorage scheme

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ Solving sparse linear systems of equations using the modified digraph approach

Cites Work

• Computer program for solution of large, sparse, unsymmetric systems of linear equations
• Unnamed Item
• Unnamed Item

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