Spectral analysis of parallel incomplete factorizations with implicit pseudo-overlap

Numerical Linear Algebra with Applications

Volumn 9, Issue 1, 2002, Pages 45-64

  Magolu Monga Made, M ^a   Van der Vorst, Henk A ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Incomplete factorizations; Large sparse linear systems; Multiprocessor computers; Preconditioned conjugate gradient

Indexed keywords

EID: 0011807867     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.247     Document Type: Article

References (46)

1. Duff IS, Meurant GA. The effect of ordering on preconditioned conjugate gradients. BIT 1989; 29:635-657.
2. van der Vorst HA. A vectorizable variant of some ICCG methods. SIAM Journal on Scientific and Statistical Computing 1982; 3:350-356.
3. van der Vorst HA. High performance preconditioning. SIAM Journal on Scientific and Statistical Computing 1989; 10:1174-1185.
4. Duff IS, van der Vorst HA. Developments and trends in the parallel solution of linear systems. Parallel Computing 1999; 25:1931-1970.
5. Doi S. On parallelism and convergence of incomplete LU factorizations. Applied Numerical Mathematics 1991; 7:417-436.
6. Doi S, Lichnewsky A. A graph-theory approach for analyzing the effects of ordering on ILU preconditioning. INRIA Report 1452, INRIA-Rocquencourt, France, 1991.
7. Bridson R, Tang WP. A structural diagnosis of some IC orderings. SIAM Journal on Scientific Computing 2000; 22:1527-1532.
8. Doi S, Washio T. Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorizations. Parallel Computing 1999; 25:1995-2014.
9. Magolu monga Made M, Polman B. Efficient planewise like preconditioners to cope with 3D problems. Numerical Linear Algebra with Applications 1999; 6:379-406.
10. Hysom D, Pothen A. A scalable parallel algorithm for incomplete factor preconditioning. SIAM Journal on Scientific Computing 2001; 22:2194-2215.
11. Magolu monga Made M, van der Vorst HA. Parallel incomplete factorizations with pseudo-overlapped subdomains. Parallel Computing 2001; 27:989-1008.
12. Magolu monga Made M, van der Vorst HA. ParIC: A family of parallel incomplete Cholesky preconditioners. In High Performance Computing and Networking, Bubak M, Afsarmanesh H, Williams R, Hertzberger B (eds). Proceedings of the HPCN Europe 2000 Conference, Amsterdam. Lecture Notes in Computer Science, vol. 1823. Springer: Berlin, 2000; 89-98.
13. Magolu monga Made M. Implementation of parallel block preconditionings on a transputer-based multiprocessor. Future Generation Computer Systems 1995; 11:167-173.
14. Notay Y. An efficient parallel discrete PDE solver. Parallel Computing 1995; 21:1725-1748.
15. Haase G. Parallel incomplete Cholesky preconditioners based on the nonoverlapping data distribution. Parallel Computing 1998; 24:1685-1703.
16. Dongarra JJ, Duff IS, Sorensen DC, van der Vorst HA. Numerical Linear Algebra for High-Performance Computers. SIAM: Philadelphia, PA, 1998.
17. van der Vorst HA. Large tridiagonal and block tridiagonal linear systems on vector and parallel computers. Parallel Computing 1987; 5:45-54.
18. Smith BF, Bjørstad PE, Gropp D. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press: Cambridge, 1996.
19. Varga RS. Matrix Iterative Analysis. Prentice-Hall: Englewood Cliffs, NJ, 1962.
20. Berman A, Plemmons RJ. Nonnegative Matrices in the Mathematical Sciences. Academic Press: New York, 1979.
21. Nakamura S. Computational Methods in Engineering and Science. Wiley: New York, 1977.
22. Barret RF, Berry M, Chan TF, Demmel J, Donato J, Dongarra JJ, Eijkhout V, Pozo R, Romine C, van der Vorst HA. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM: Philadelphia, PA, 1994.
23. Golub GH, van Loan CF. Matrix Computations (3rd edn). The John Hopkins University Press: Baltimore, MD, 1996.
24. Meijerink JA, van der Vorst HA. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Mathematics of Computation 1977; 31:148-162.
25. Meijerink JA, van der Vorst HA. Guidelines for the usage of incomplete decompositios in solving sets of linear equations as they occur in practical problems. Journal of Computational Physics 1981; 44:134-155.
26. van Driessche R. Algorithms for static and dynamic load balancing on parallel computers. Ph.D. Thesis, Dept of Computer Science, Katholieke Universiteit Leuven, Belgium, 1995.
27. Magolu monga Made M, Valkenberg R, Beauwens R, Warzée G. A synthesis of available automatic mesh partitioning techniques. DOMINOS Report D1.1.2. Service des Milieux Continus, Université Libre de Bruxelles, April 1998.
28. Axelsson O. Iterative Solution Methods. Cambridge University Press: Cambridge, 1994.
29. Axelsson O, Lindskog G. On the eigenvalue distribution of a class of preconditioning methods. Numerische Mathematik 1986; 48:479-498.
30. Notay Y. On the convergence rate of the conjugate gradients in the presence of rounding errors. Numerische Mathematik 1993; 65:301-317.
31. van der Sluis A. The convergence behaviour of conjugate gradients and ritz values in various circumstances. In Iterative Methods in Linear Algebra, Beauwens R, de Groen P (eds). North-Holland: Amsterdam, 1992; 49-66.
32. van der Sluis A, van der Vorst HA. The rate of convergence of conjugate gradients. Numerische Mathematik 1986; 48:543-560.
33. van der Sluis A, van der Vorst HA. The convergence behavior of Ritz values in the presence of close eigenvalues. Linear Algebra and its Applications 1987; 88/89:651-694.
34. van der Vorst HA, Sleijpen GLG. The effect of incomplete decomposition preconditioning on the convergence of conjugate gradients. In Incomplete Decomposition (ILU) - Algorithms, Theory and Applications, Hackbusch W, Wittum W (eds). Notes on Numerical Fluid Mechanics, vol. 41. Vieweg: Braunschweig, 1993; 179-187.
35. Magolu monga Made M. Modified block-approximate factorization strategies. Numerische Mathematik 1992; 61:91-110.
36. Beauwens R. Modified incomplete factorization strategies. In Preconditioned Conjugate Gradient Methods, Axelsson O, Kolotilina L (eds). Lectures Notes in Mathematics, vol. 1457. Springer: Berlin, 1990; 1-16.
37. Magolu monga Made M. Sparse approximate block factorizations for solving symmetric positive (semi)definite linear systems. Ph.D. Thesis, Service de Métrologie Nucléaire, Université Libre de Bruxelles, Belgium, 1992.
38. Magolu monga Made M. Analytical bounds for block approximate factorization methods. Linear Algebra and its Applications 1993; 179:33-57.
39. Magolu monga Made M. Ordering strategies for modified block incomplete factorizations. SIAM Journal on Scientific Computing 1995; 16:378-399.
40. Magolu monga Made M. Taking advantage of the potentialities of dynamically modified block incomplete factorizations. SIAM Journal on Scientific Computing 1998: 19:1083-1108.
41. van der Vorst HA. Iterative solution methods for certain sparse linear systems with a non-symmetric matrix arising from PDE-problems. Journal of Computational Physics 1981; 44:1-19.
42. van der Vorst HA. Preconditioning by incomplete decompositions. Ph.D. Thesis, Utrecht University, the Netherlands, 1982.
43. Chan TF, Elman HC. Fourier analysis of iterative methods for elliptic problems. SIAM Review 1989; 31:20-49.
44. Elman HC. A stability analysis of incomplete LU factorizations. Mathematics of Computation 1986; 47:191-217.
45. Notay Y, Van de Velde A. Coarse grid acceleration of parallel incomplete preconditioners. In Iterative Methods in Linear Algebra II, Margenov S, Vassilevski P (eds). IMACS series in Computational and Applied Mathematics 1996; 3:106-130.
46. 3), Dimov IT, Sendov BL, Vassilevski PS (eds). World Scientific: Singapore, 1994; 26-34.