Abstract:
For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained. 1 Introduction and Main Results
Citations
|
145
|
CGS: a fast Lanczos-type solver for nonsymmetric linear systems
– Sonneveld
- 1989
|
|
81
|
The multigrid method for diffusion equations with strongly discontinuous coefficients
– Alcouffe, Brandt, et al.
- 1981
|
|
56
|
Efficient implementation of a class of preconditioned conjugate gradient methods
– Eisenstat
- 1981
|
|
56
|
An incomplete factorization technique for positive definite linear systems
– Manteuffel
- 1980
|
|
42
|
Accelerated multigrid convergence and high-Reynolds recirculating flows
– Brandt, Yavneh
- 1993
|
|
40
|
Optimal parallel solution of sparse triangular systems
– Alvarado, Schreiber
- 1993
|
|
36
|
Analysis and comparison of relaxation schemes in robust multigrid and preconditioned conjugate gradient methods
– Kettler
- 1981
|
|
21
|
On vectorizing incomplete factorizations and SSOR preconditioners
– Ashcraft, Grimes
- 1988
|
|
17
|
Parallelization of Robust Multigrid Methods: ILU Factorization and Frequency Decomposition Method
– Bastian, Horton
- 1991
|
|
14
|
Inadequacy of first-order upwind difference schemes for some recirculating flows
– BRANDT, YAVNEH
- 1991
|
|
14
|
Iterative solution methods for certain sparse linear systems with a non-symmetric matrix arising from PDE-problems
– Vorst
- 1981
|
|
13
|
Fourier analysis of relaxed incomplete factorization preconditioners
– Chan
- 1991
|
|
12
|
A note on the efficiency of domain decomposed incomplete factorizations
– Chan, Goovaerts
|
|
12
|
Towards automatic multigrid algorithms for SPD, nonsymmetric and indefinite problems
– Shapira, Israeli, et al.
- 1996
|
|
9
|
Transpose Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
– Freund, W
- 1993
|
|
6
|
An incomplete factorization preconditioning using repeated red–black ordering
– Brand
- 1992
|
|
5
|
Coloring Update Methods
– Shapira
- 1995
|
|
4
|
Parallel Conjugate Gradient Like Algorithms for Solving Sparse Nonsymmetric Linear Systems on a Vector Multiprocessor", Parallel Computing 11
– Radicati, Robert
- 1989
|
|
3
|
Overlapping Multicolor MILU Preconditioning
– Washio, Hayami
- 1995
|
|
3
|
A Simple Parallel Algorithm for Polynomial Evaluation
– Li, Hu, et al.
- 1996
|
|
2
|
A Parallelizable Incomplete LU-type Preconditioner for the Solution of Sparse Linear Systems
– Shapira, Sidi, et al.
- 1993
|
|
1
|
Modified Incomplete Methods", in Preconditioning Methods
– Gustafsson
- 1983
|
|
1
|
On modified incomplete factorization methods
– Gustafsson
|
|
1
|
der Vorst H.A., "An Iterative Solution Method for Linear Systems of which the Coefficients Matrix is a Symmetric M-matrix
– Meijerink, Van
- 1977
|
|
1
|
der Vorst H.A., "Guidelines for the Usage of Incomplete Decompositions in Solving Sets of Linear Equations as they Occur in Practical Problems
– Meijerink, Van
- 1981
|
|
1
|
Optimal Error Bounds for Convergents of a Family of Continued Fractions
– Shapira, Sidi, et al.
- 1996
|
|
1
|
A Parallelizable Incomplete LU -type Preconditioner for the Solution of Sparse Linear Systems
– Shapira, Sidi, et al.
- 1994
|
|
1
|
Vorst H.A., "a Vectorizable Version of some Incomplete Conjugate Gradients Methods
– der
- 1982
|
|
1
|
Vorst H.A., "High Performance Preconditioning
– der
- 1989
|
|
1
|
A Domain Decompositioned Fast Poisson Solver
– Chan, Resasco
- 1987
|
|
1
|
Convergence Properties of Certain Families of Continued Fractions and Applications for Tridiagonal Systems
– Shapira
- 1995
|
|
1
|
Reducing the Effect of Global Communication in GMRES(m
– Struler, Vorst
- 1995
|
|
