Efficient Solution of a Sparse Non-symmetric System of Linear Equations
DOI10.1080/00207160210940zbMATH Open0996.65029OpenAlexW2039715635MaRDI QIDQ4531360FDOQ4531360
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
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
performancepreconditioningconjugate gradient methodcomparison of methodsincomplete LU-decompositionDoolittle's methodirregular sparsity patternlarge sparse and non-symmetric matrices
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A class of first order factorization methods
- A robust incomplete Choleski-conjugate gradient algorithm
- Title not available (Why is that?)
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- A compact row storage scheme for Cholesky factors using elimination trees
- A node-addition model for symbolic factorization
- On the sensitivity of the LU factorization
- Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
- Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems
- Solution of a sparse linear system by using digraph
Cited In (6)
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
- Title not available (Why is that?)
- \(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
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
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)
