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

DOI10.1080/00207160210940MaRDI QIDQ4531360zbMATH OpenOpenAlexFDO

Authors Ahmad Al-Kurdi, R. C. 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

performancepreconditioningconjugate gradient methodcomparison of methodsincomplete LU-decompositionDoolittle's methodirregular sparsity patternlarge sparse and non-symmetric matrices

Mathematics Subject Classification ID

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

Recommendations

• Efficient approximate solution of sparse linear systems
• An iterative solution method for solving sparse nonsymmetric linear systems
• scientific article; zbMATH DE number 3888795
• scientific article; zbMATH DE number 2065130
• scientific article; zbMATH DE number 3879988
• A new computational method for the sparsest solutions to systems of linear equations
• Sparse algorithms for indefinite system of linear equations
• Solving systems of sparse linear equations
• Sparse Approximate Solutions to Linear Systems
• Solution of Sparse Underdetermined Systems of Linear Equations

Cites work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 41472 (Why is no real title available?)
• scientific article; zbMATH DE number 1068190 (Why is no real title available?)
• A class of first order factorization methods
• A compact row storage scheme for Cholesky factors using elimination trees
• A node-addition model for symbolic factorization
• A robust incomplete Choleski-conjugate gradient algorithm
• Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems
• Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
• On the sensitivity of the LU factorization
• Solution of a sparse linear system by using digraph
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients

Cited in

(6)

• Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
• scientific article; zbMATH DE number 1762799 (Why is no real title available?)
• \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems
• Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations
• scientific article; zbMATH DE number 440648 (Why is no real title available?)
• scientific article; zbMATH DE number 4062464 (Why is no real title available?)

Describes a project that uses

Uses Software

• symrcm
• NAPACK

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

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