Efficient and reliable iterative methods for linear systems

Journal of Computational and Applied Mathematics

Volumn 149, Issue 1, 2002, Pages 251-265

  Van der Vorst, Henk A ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Bi CGSTAB; Conjugate gradients; Domain decomposition; GMRES; Incomplete Cholesky; Iterative methods; Krylov methods; Preconditioning

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS;

SUBSPACE METHODS;

LINEAR SYSTEMS;

ITERATIVE TECHNIQUE;

EID: 0036895155     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(02)00534-4     Document Type: Article

References (44)

1. The principle of minimized iteration in the solution of the matrix eigenproblem (1951)
2. A parallel linear system solver for circuit-simulation problems
3. Nested grids ILU-decomposition (NGILU)
4. A generalized conjugate gradient method for the numerical solution of elliptic partial diFerential equations
5. Ordering methods for preconditioned conjugate gradient methods applied to unstructured grid problems
6. The effect of ordering on preconditioned conjugate gradient
7. Developments and trends in the parallel solution of linear systems
8. Relaxed and stabilized incomplete factorizations for non-self-adjoint linear systems
9. Necessary and sufficient conditions for the existence of a conjugate gradient method
10. A class of first order factorization methods
11. Parallel incomplete Cholesky preconditioners based on the nonoverlapping data distribution
12. Parallel solvers for nonlinear elliptic problems based on domain decomposition ideas
13. Methods of conjugate gradients for solving linear systems
14. The incomplete Choleski-conjugate gradient method for the iterative solution of systems of linear equations
15. Two-color Fourier analysis of iterative algorithms for elliptic problems with red/black ordering
16. A generalized domain decomposition paradigm for parallel incomplete LU factorization preconditionings
17. Parallel incomplete factorizations with pseudo-overlapped subdomains
18. Spectral analysis of parallel incomplete factorizations with implicit pseudo-overlap
19. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix
20. Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
21. DRIC: A dynamic version of the RIC method
22. Parallel conjugate gradient-like algorithms for solving sparse non- symmetric systems on a vector multiprocessor
23. The use of conjugate gradients for systems of equations possessing 'Property A'
24. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems
25. Reliable updated residuals in hybrid Bi-CG methods
26. CGS: A fast Lanczos-type solver for nonsymmetric linear systems
27. Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
28. Large tridiagonal and block tridiagonal linear systems on vector and parallel computers
29. High performance preconditioning
30. Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of non-symmetric linear systems
31. Refined residual replacement techniques for subspace iterative methods for convergence of true residuals
32. Parallel block preconditioning based on SSOR and MILU