Towards a cost-effective ILU preconditioner with high level fill
type: Item
instance of: scholarly article
title: Towards a cost-effective ILU preconditioner with high level fill
zbMATH Open document ID: 0761.65017
DOI: 10.1007/BF02074880
author: Wei-Pai Tang
author: Eduardo F. D'Azevedo
author: P. A. Forsyth
published in: BIT
publication date: 1993-01-16T00:00:00Z
review text: The utilization of preconditioned conjugate gradient methods provides a robust and competitive solution to large sparse matrix problems. The main factors which have a significant impact on the performance of the preconditioner are (i) the ordering of the unknowns in the original matrix \(A\); (ii) the sparsity pattern of the preconditioner \(M\); and (iii) the closeness of the respective spectra of \(M\) and \(A\). In a previous work [SIAM J. Matrix Analysis Appl. 13, No. 3, 944-961 (1992; Zbl 0760.65028)] the authors had proposed a method referred to as minimum discarded fill ordering strategy for general sparse matrices which more especially considers the effect of ordering on the preconditioner. In the present paper, several variants of this method are investigated. Detailed description of these ordering techniques are given, with test problems and numerical results.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 93327
zbMATH Keywords: incomplete LU factorization
zbMATH Keywords: preconditioned conjugate gradient methods
zbMATH Keywords: large sparse matrix
zbMATH Keywords: performance
zbMATH Keywords: minimum discarded fill ordering strategy
zbMATH Keywords: test problems
zbMATH Keywords: numerical results
reviewed by: Guy Jumarie
describes a project that uses: symrcm
MaRDI profile type: Publication
cites work: Q4125656
cites work: Comparison of Fast Iterative Methods for Symmetric Systems
cites work: Analysis of Preconditioners for Domain Decomposition
cites work: Ordering Methods for Preconditioned Conjugate Gradient Methods Applied to Unstructured Grid Problems
cites work: SOME PARALLEL AND VECTOR IMPLEMENTATIONS OF PRECONDITIONED ITERATIVE METHODS ON CRAY-2
cites work: The effect of ordering on preconditioned conjugate gradients
cites work: Analysis of parallel incomplete point factorizations
cites work: A Control Volume Finite Element Approach to NAPL Groundwater Contamination
cites work: Q3279573
cites work: Q3664299
cites work: Optimal preconditioners of a given sparsity pattern
cites work: A class of first order factorization methods
cites work: Theory of Laminar Flames
cites work: The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
cites work: A Comparison of Domain Decomposition Techniques for Elliptic Partial Differential Equations and their Parallel Implementation
cites work: Q4836649
cites work: Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns
cites work: Three-Dimensional Delaunay Triangulations for Finite Element Approximations to a Second-Order Diffusion Operator
cites work: The elimination form of the inverse and its application to linear programming
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
cites work: Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
cites work: The Use of Linear Graphs in Gauss Elimination
cites work: Q3670748
cites work: Q3817902
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Use of Iterative Refinement in the Solution of Sparse Linear Systems
full work available at URL: https://doi.org/10.1007/bf02074880
OpenAlex ID: W2039704521
description: scientific article; zbMATH DE number 93327