Experimental comparison of three-dimensional point and line modified incomplete factorizations

Numerical Algorithms

Volumn 23, Issue 1, 2000, Pages 51-70

  Magolu Monga Made, Mardochée ^a   Polman, Ben ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Discretized partial differential equations; Large sparse linear systems; Modified incomplete factorizations; Partitionings; Preconditioned conjugate gradient

Indexed keywords

EID: 0043190404     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019191715286     Document Type: Article

References (64)

1. Z.O. Amar, A parallel solver for 3D-PDEs on SIMD computers, in: Iterative Methods in Linear Algebra II, eds. S. Margenov and P. Vassilevski, IMACS Series in Computational and Applied Mathematics, Vol. 3 (1996) pp. 140-155.
2. C.C. Ashcraft and R.G. Grimes, On vectorizing incomplete factorization and SSOR preconditioners, SIAM J. Sci. Statist. Comput. 9 (1988) 122-151.
3. O. Axelsson, Bounds of eigenvalues of preconditioned matrices, SIAM J. Matrix Anal. Appl. 13 (1992) 847-862.
4. O. Axelsson and V. Eijkhout, Vectorizable preconditioners for elliptic difference equations in three space dimensions, J. Comput. Appl. Math. 27 (1989) 299-321.
5. O. Axelsson and G. Lindskog, On the eigenvalue distribution of a class of preconditioning methods, Numer. Math. 48 (1986) 479-498.
6. O. Axelsson and H. Lu, On eigenvalue estimates for block incomplete factorization methods, SIAM J. Matrix Anal. Appl. 16 (1995) 1074-1085.
7. O. Axelsson, H. Lu and B. Polman, On the numerical radius of matrices and its application to iterative methods, Linear and Multilinear Algebra 37 (1994) 225-238.
8. O. Axelsson and B. Polman, An approximate factorization method for block matrices suitable for vector and parallel processors, Linear Algebra Appl. 77 (1986) 3-26.
9. O. Axelsson and B. Polman, Block preconditioning and domain decomposition methods II, J. Comput. Appl. Math. 24 (1988) 55-72.
10. R.F. Barret, M. Berry, T.F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine and H. van der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods (SIAM, Philadelphia, PA, 1994).
11. R. Beauwens, Upper eigenvalue bounds for pencils of matrices, Linear Algebra Appl. 62 (1984) 87-104.
12. R. Beauwens, Approximate factorizations with S/P consistently ordered M-factors, BIT 29 (1989) 658-681.
13. R. Beauwens, Approximate factorizations with modified S/P consistently ordered M-factors, Numer. Linear Algebra Appl. 1 (1994) 3-17.
14. R. Beauwens and M. Ben Bouzid, Existence and conditioning properties of sparse approximate block factorizations, SIAM J. Numer. Anal. 25 (1988) 941-956.
15. 3), eds. I.T. Dimov, B. Sendov and P.S. Vassilevski (World Scientific, Singapore, 1994) pp. 26-34.
16. M. Benzi and M. Tůma, Numerical experiments with two sparse approximate inverse preconditioners, BIT 38 (1998) 234-241.
17. T.F. Chan, Fourier analysis of relaxed incomplete factorization preconditioners, SIAM J. Sci. Statist. Comput. 12 (1991) 668-680.
18. T.F. Chan and H.C. Elman, Fourier analysis of iterative methods for elliptic problems, SIAM Rev. 31 (1989) 20-49.
19. T.F. Chan and G.A. Meurant, Fourier analysis of block preconditioners, CAM Report 90-04, University of California, Los Angeles (February 1990).
20. T.F. Chan and P.S. Vassilevski, A framework for block-ILU factorization using block-size reduction, Math. Comp. 64 (1995) 129-156.
21. T.F. Chan and H.A. van der Vorst, Approximate and incomplete factorizations, in: Parallel Numerical Algorithms, eds. D.E. Keyes, A. Samed and V. Venkatakrishnan, ICASE/LaRC Interdisciplinary Series in Science and Engineering, Vol. 4 (Kluwer Academic, Dodrecht, 1997) pp. 167-202.
22. E. Chow and M.A. Heroux, BPKIT block preconditioning tool kit, Technical Report UMSI 96/183, University of Minnesota, Supercomputer Institute (September 1996).
23. P. Concus, G.H. Golub and G.A. Meurant, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statist. Comput. 6 (1985) 220-252.
24. P. Concus and G.A. Meurant, On computing INV block preconditionings for the conjugate gradient method, BIT 26 (1986) 493-504.
25. S. Demko, W.F. Moss and P.W. Smith, Decay rates for inverses of band matrices, Math. Comp. 43 (1984) 491-499.
26. J.M. Donato and T.F. Chan, Fourier analysis of incomplete factorization preconditioners for 3-dimensional anisotropic problems, SIAM J. Sci. Statist. Comput. 13 (1992) 319-338.
27. J.J. Dongarra, I.S. Duff, D.C. Sorensen and H.A. van der Vorst, Numerical Linear Algebra for High-Performance Computers (SIAM, Philadelphia, PA, 1998).
28. I.S. Duff and G.A. Meurant, The effect of ordering on preconditioned conjugate gradients, BIT 29 (1989) 635-657.
29. I.S. Duff and H.A. van der Vorst, Developments and trends in the parallel solution of linear systems, Parallel Comput. 25 (1999) 1931-1970.
30. T. Dupont, R.P. Kendall and H.H. Rachford, An approximate factorization procedure for solving self-adjoint elliptic difference equations, SIAM J. Numer. Anal. 5 (1968) 559-573.
31. V. Eijkhout and B. Polman, Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices, Linear Algebra Appl. 109 (1988) 247-277.
32. G.H. Golub and H.A. van der Vorst, Closer to the solution: iterative linear solvers, in: The State of the Art in Numerical Analysis, eds. I.S. Duff and G.A. Watson (Clarendon Press, Oxford, 1997) pp. 63-92.
33. M.J. Grote and T. Huckle, Parallel preconditionings with sparse approximate inverses, SIAM J. Sci. Comput. 18 (1997) 838-853.
34. I. Gustafsson, A class of first order factorization methods, BIT 18 (1978) 142-156.
35. I. Gustafsson, Modified Incomplete Cholesky (MIC) methods, in: Preconditioning Methods. Theory and Applications, ed. D. Evans (Gordon and Breach, New York, 1983) pp. 265-293.
36. G. Haase, Parallel incomplete Cholesky preconditioners based on the nonoverlapping data distribution, Parallel Comput. 24 (1998) 1685-1703.
37. R. Kettler, Linear multigrid methods for numerical reservoir simulation, Ph.D. thesis, Dept. of Mathematics and Informatics, Delft University of Technology (1987).
38. L. Kolotilina, Eigenvalues bounds for block preconditioned matrices, Research Report EM-RR 16/94, Elegant Mathematics, Inc. (June 1994).
39. M. Magolu monga Made, Modified block-approximate factorization strategies, Numer. Math. 61 (1992) 91-110.
40. M. Magolu monga Made, Analytical bounds for block approximate factorization methods, Linear Algebra Appl. 179 (1993) 33-57.
41. M. Magolu monga Made, Ordering strategies for modified block incomplete factorizations, SIAM J. Sci. Comput. 16 (1995) 378-399.
42. M. Magolu monga Made, Implementation of parallel block preconditionings on a transputer-based multiprocessor, Future Generation Computer Systems 11 (1995) 167-173.
43. M. Magolu monga Made, Taking advantage of the potentialities of dynamically modified block incomplete factorizations, SIAM J. Sci. Comput. 19 (1998) 1083-1108.
44. M. Magolu monga Made and Y. Notay, On the conditioning analysis of block approximate factorization methods, Linear Algebra Appl. 154-156 (1991) 583-599.
45. M. Magolu monga Made and Y. Notay, Dynamically relaxed block incomplete factorization methods for solving two- and three-dimensional problems, SIAM J. Sci. Comput. (2000), to appear.
46. M. Magolu monga Made and B. Polman, Efficient planewise like preconditioners to cope with 3D problems, Numer. Linear Algebra Appl. 6 (1999) 379-406.
47. J.A. Meijerink and H.A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp. 31 (1977) 148-162.
48. G.A. Meurant, The block preconditioned conjugate gradient method on vector computers, BIT 24 (1984) 623-633.
49. G.A. Meurant, A review on the inverse of symmetric tridiagonal and Block tridiagonal matrices, SIAM J. Matrix Anal. Appl. 13 (1992) 707-728.
50. S. Nakamura, Computational Methods in Engineering and Science (Wiley, New York, 1977).
51. Y. Notay, Conditioning analysis of modified block incomplete factorizations, Linear Algebra Appl. 154-156 (1991) 711-722.
52. Y. Notay, Upper eigenvalue bounds and related modified incomplete factorization strategies, in: Iterative Methods in Linear Algebra, eds. R. Beauwens and P. de Groen (North-Holland, Amsterdam, 1992) pp. 551-562.
53. Y. Notay, Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations, Appl. Numer. Math. 10 (1992) 381-396.
54. Y. Notay, On the convergence rate of the conjugate gradients in the presence of rounding errors, Numer. Math. 65 (1993) 301-317.
55. Y. Notay, An efficient parallel discrete PDE solver, Parallel Comput. 21 (1995) 1725-1748.
56. Y. Notay and A. Van de Velde, Coarse grid acceleration of parallel incomplete preconditioners, in: Iterative Methods in Linear Algebra II, eds. S. Margenov and P. Vassilevski, IMACS Series in Computational and Applied Mathematics, Vol. 3 (1996) pp. 106-130.
57. P. Saint-Georges, G. Warzee, R. Beauwens and Y. Notay, Robust and efficient iterative solvers of linear systems for FEM analyses, in: Proc. of the 23rd Internat. FEM Congress in Baden-Baden, IKOSS (IKO Software Service GmbH, Stuttgart, 1994) pp. 179-188.
58. A. van der Sluis, The convergence behaviour of conjugate gradients and ritz values in various circumstances, in: Iterative Methods in Linear Algebra, eds. R. Beauwens and P. de Groen (North-Holland, Amsterdam, 1992) pp. 49-66.
59. H.A. van der Vorst, A vectorizable variant of some ICCG methods, SIAM J. Sci. Statist. Comput. 3 (1982) 350-356.
60. H.A. van der Vorst, High performance preconditioning, SIAM J. Sci. Statist. Comput. 10 (1989) 1174-1185.
61. H.A. van der Vorst, ICCG and related methods for 3D problems on vector computers, Comput. Phys. Commun. 53 (1989) 223-235.
62. H.A. van der Vorst, The convergence behaviour of preconditioned CG and CG-S, in: Preconditioned Conjugate Gradient Methods, eds. O. Axelsson and L. Kolotilina, Lectures Notes in Mathematics, Vol. 1457 (Springer, Berlin, 1990) pp. 126-136.
63. H.A. van der Vorst and G.L. Sleijpen, The effect of incomplete decomposition preconditioning on the convergence of conjugate gradients, in: Incomplete Decomposition (ILU) - Algorithms, Theory and Applications, eds. W. Hackbusch and G. Wittum, Notes on Numerical Fluid Mechanics, Vol. 41 (Vieweg, Braunschweig, 1993) pp. 179-187.
64. E.L. Wachspress, Iterative Solution of Elliptic Systems and Application to the Neutron Diffusion Equations of Reactor Physics (Prentice-Hall, Englewood Cliffs, 1966).