Parallelizable approximate solvers for recursions arising in preconditioning
From MaRDI portal
Publication:1386504
DOI10.1016/S0024-3795(97)00339-XzbMath0901.65030WikidataQ126628523 ScholiaQ126628523MaRDI QIDQ1386504
Publication date: 26 November 1998
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
numerical examplesdomain decompositionpreconditioningparallel algorithmmodified incomplete LU recursionsrestarted recursions
Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inadequacy of first-order upwind difference schemes for some recirculating flows
- On the eigenvalue distribution of a class of preconditioning methods
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- An incomplete-factorization preconditioning using repeated red-black ordering
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Optimal error bounds for convergents of a family of continued fractions
- Nested grids ILU-decomposition (NGILU)
- Fourier Analysis of Relaxed Incomplete Factorization Preconditioners
- A Note on the Efficiency of Domain Decomposed Incomplete Factorizations
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- The Multi-Grid Method for the Diffusion Equation with Strongly Discontinuous Coefficients
- A Vectorizable Variant of some ICCG Methods
- Parallelization of Robust Multigrid Methods: ILU Factorization and Frequency Decomposition Method
- Line Iterative Methods for Cyclically Reduced Discrete Convection-Diffusion Problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A class of first order factorization methods
- Accelerated Multigrid Convergence and High-Reynolds Recirculating Flows
- Overlapped Multicolor MILU Preconditioning
- A Simple Parallel Algorithm for Polynomial Evaluation
- Towards Automatic Multigrid Algorithms for SPD, Nonsymmetric and Indefinite Problems
- Optimal Parallel Solution of Sparse Triangular Systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
This page was built for publication: Parallelizable approximate solvers for recursions arising in preconditioning