Efficient Solution of a Sparse Non-symmetric System of Linear Equations

DOI10.1080/00207160210940zbMath0996.65029OpenAlexW2039715635MaRDI QIDQ4531360

Ahmad Al-Kurdi, Ramesh Chand Mittal

Publication date: 2 July 2002

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

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

zbMATH Keywords

performancecomparison of methodspreconditioningconjugate gradient methodincomplete LU-decompositionDoolittle's methodirregular sparsity patternlarge sparse and non-symmetric matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Uses Software

• symrcm
• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the sensitivity of the LU factorization
• Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems
• A robust incomplete Choleski-conjugate gradient algorithm
• A compact row storage scheme for Cholesky factors using elimination trees
• A node-addition model for symbolic factorization
• Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
• A class of first order factorization methods
• Solution of a sparse linear system by using digraph

This page was built for publication: Efficient Solution of a Sparse Non-symmetric System of Linear Equations