\(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems

DOI10.1016/S0898-1221(01)00279-6zbMath1004.65037WikidataQ126438114 ScholiaQ126438114MaRDI QIDQ1609048

Ramesh Chand Mittal, Ahmad Al-Kurdi

Publication date: 15 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

determinantdirect methodsCramer's rulenumerical structureincomplete LU-decomposition methodlarge random sparse linear systemnonsymmetric sparse linear systemnumerical structure approach

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

A time-spectral method for initial-value problems using a novel spatial subdomain scheme ⋮ An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method ⋮ LU-decomposition with iterative refinement for solving sparse linear systems

Uses Software

• symrcm
• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the sensitivity of the LU factorization
• 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

This page was built for publication: \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems