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

DOI10.1016/S0898-1221(01)00279-6MaRDI QIDQ1609048zbMATH OpenWikidataFDO

Authors R. C. Mittal, Ahmad Al-Kurdi

Publication date 15 August 2002

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

Full work available at URL https://doi.org/10.1016/S0898-1221(01)00279-6

zbMATH Keywords

Cramer's ruledeterminantdirect methodsincomplete LU-decomposition methodlarge random sparse linear systemnonsymmetric sparse linear systemnumerical structurenumerical structure approach

Mathematics Subject Classification ID

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

Review text

The authors consider a large random sparse linear system and present two direct methods to compute the solution. The first method is an incomplete LU-decomposition method: its technique for reducing fill-ins based on powers of a Boolean matrix is cheap and effective and allows to exploit symmetry. The second method, called numerical structure approach, is based on Cramer's rule, which does not create fill-ins. As expected, it is not efficient, therefore it is not recommended. Moreover the paper presents eight examples which fill ten pages just with numbers. Actually they cannot be easily decoded.

Recommendations

• LU-decomposition with iterative refinement for solving sparse linear systems
• An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
• Efficient Solution of a Sparse Non-symmetric System of Linear Equations
• Publication:4733291
• Application of the Cramer rule in the solution of sparse systems of linear algebraic equations

Cites work

• 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
• Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3782281 (Why is no real title available?)
• scientific article; zbMATH DE number 41472 (Why is no real title available?)
• scientific article; zbMATH DE number 3493779 (Why is no real title available?)
• scientific article; zbMATH DE number 3508526 (Why is no real title available?)
• scientific article; zbMATH DE number 1068190 (Why is no real title available?)
• On the sensitivity of the LU factorization
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients

Cited in

(4)

• Solving sparse linear systems by an ABS-method that corresponds to LU- decomposition
• 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
• A time-spectral method for initial-value problems using a novel spatial subdomain scheme

Describes a project that uses

Uses Software

• symrcm
• NAPACK

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

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