Application of the Cramer rule in the solution of sparse systems of linear algebraic equations

DOI10.1016/S0377-0427(00)00572-0zbMath0998.65050OpenAlexW2000275478MaRDI QIDQ5948563

Ahmad Al-Kurdi, Ramesh Chand Mittal

Publication date: 15 November 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00572-0

zbMATH Keywords

determinantCramer's rulerandom unstructured sparse matricessparse linear systemtree algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of determinants (65F40) Direct numerical methods for linear systems and matrix inversion (65F05)

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• An iterative solution method for solving sparse nonsymmetric linear systems
• A new approach to backward error analysis of LU factorization
• Analysis of some vector extrapolation methods for solving systems of linear equations
• Sparse matrix test problems
• Iterative Solution Methods
• Solution of a sparse linear system by using digraph
• The Solution of Large Sparse Unsymmetric Systems of Linear Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of the Cramer rule in the solution of sparse systems of linear algebraic equations