Parallelizable approximate solvers for recursions arising in preconditioning
The aim of this paper is to show that it is possible to replace the modified incomplete LU recursions by corresponding restarted recursions which are efficiently implemented on parallel and vector computers. Two types of domain decomposition, suitable for two types of parallel architectures are introduced. The first one is based on overlapping square subdomains and is suitable for message-passing parallel architecture with mesh-connected processor arrays. The second type uses subdomains consisting of several consecutive data fronts, suitable for line-connected arrays of vector or SIMD processors. Finally, numerical examples with the standard and parallelizable algorithms are presented.
- A class of first order factorization methods
- A Note on the Efficiency of Domain Decomposed Incomplete Factorizations
- A Simple Parallel Algorithm for Polynomial Evaluation
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A Vectorizable Variant of some ICCG Methods
- Accelerated Multigrid Convergence and High-Reynolds Recirculating Flows
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An incomplete-factorization preconditioning using repeated red-black ordering
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- Fourier Analysis of Relaxed Incomplete Factorization Preconditioners
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- scientific article; zbMATH DE number 3786053 (Why is no real title available?)
- scientific article; zbMATH DE number 194538 (Why is no real title available?)
- scientific article; zbMATH DE number 3797130 (Why is no real title available?)
- Inadequacy of first-order upwind difference schemes for some recirculating flows
- Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
- Line Iterative Methods for Cyclically Reduced Discrete Convection-Diffusion Problems
- Nested grids ILU-decomposition (NGILU)
- On the eigenvalue distribution of a class of preconditioning methods
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- Optimal error bounds for convergents of a family of continued fractions
- Optimal Parallel Solution of Sparse Triangular Systems
- Overlapped Multicolor MILU Preconditioning
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Parallelization of Robust Multigrid Methods: ILU Factorization and Frequency Decomposition Method
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- The Multi-Grid Method for the Diffusion Equation with Strongly Discontinuous Coefficients
- Towards Automatic Multigrid Algorithms for SPD, Nonsymmetric and Indefinite Problems
This page was built for publication: Parallelizable approximate solvers for recursions arising in preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386504)
