Taking advantage of the potentialities of dynamically modified block incomplete factorizations

SIAM Journal on Scientific Computing

Volumn 19, Issue 4, 1998, Pages 1083-1108

  Monga Made, Magolu ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Block incomplete factorizations; Diagonal perturbations; Large and sparse positive definite linear systems; Preconditioned conjugate gradient

Indexed keywords

EID: 0001395262     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144594266284     Document Type: Article

References (67)

1. O. AXELSSON, Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers, Appl. Math. Comput., 19 (1986), pp. 3-22.
2. O. AXELSSON, Iterative Solution Methods, Cambridge University Press, Cambridge, UK, 1994.
3. O. AXELSSON AND V. BARKER, Finite Element Solution of Boundary Value Problems. Theory and Computation, Academic Press, New York, 1984.
4. O. AXELSSON AND V. EIJKHOUT, Vectorizable preconditioners for elliptic difference equations in three space dimensions, J. Comput. Appl. Math., 27 (1989), pp. 299-321.
5. O. AXELSSON AND G. LINDSKOG, On the eigenvalue distribution of a class of preconditioning methods, Numer. Math., 48 (1986), pp. 479-498.
6. O. AXELSSON AND G. LINDSKOG, On the rate of convergence of the preconditioned conjugate gradient method, Numer. Math., 48 (1986), pp. 499-523.
7. O. AXELSSON AND H. LU, On eigenvalue estimates for block incomplete factorization methods, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1074-1085.
8. O. AXELSSON AND B. POLMAN, An approximate factorization methods for block matrices suitable for vector and parallel processors, Linear Algebra Appl., 77 (1986), pp. 3-26.
9. O. AXELSSON AND B. POLMAN, Block preconditioning and domain decomposition methods II, J. Comput. Appl. Math., 24 (1988), pp. 55-72.
10. R. F. BARRETT, 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, 1994.
11. R. BEAUWENS, private communication, Université Libre de Bruxelles, Brussels, 1991.
12. R. BEAUWENS, On Axelsson's perturbations, Linear Algebra Appl., 68 (1985), pp. 221-242.
13. R. BEAUWENS, Lower eigenvalue bounds for pencils of matrices, Linear Algebra Appl., 85 (1987), pp. 101-119.
14. R. BEAUWENS, Modified incomplete factorization strategies, in Preconditioned Conjugate Gradient Methods, Lecture Notes in Mathematics 1457, O. Axelsson and L. Kolotilina, eds.,Springer-Verlag, 1990, pp. 1-16.
15. R. BEAUWENS AND M. BEN BOUZID, On sparse block factorization iterative methods, SIAM J. Numer. Anal., 24 (1987), pp. 1066-1076.
16. R. BEAUWENS AND M. BEN BOUZID, Existence and conditioning properties of sparse approximate block factorizations, SIAM J. Numer. Anal., 25 (1988), pp. 941-956.
17. 3), I.T. Dimov, Bl. Sendov, and P. S. Vassilevski, eds., World Scientific, Singapore, 1994, pp. 26-34.
18. R. BEAUWENS AND M. M. MAGOLU, Sparse Block Factorization Algorithms, Scientific report, Université Libre de Bruxelles, Bruxelles, 1988.
19. R. BEAUWENS AND R. STANKIEWICZ, On Single-Stage Iterative Methods for Solving Three-Dimensional Diffusion Problems, Internal report, Université Libre de Bruxelles, Brussels, 1976.
20. R. BEAUWENS AND R. SURLEZANOSKA, Sur les taux de convergence asymptotiques des méthodes itératives de factorisation, Rapport interne, Université Libre de Bruxelles, Brussels, 1976.
21. M. BEN BOUZID AND M. M. MAGOLU, Taux de convergence asymptotiques des méthodes bloc-Varga 2, Rapport scientifique, Université Libre de Bruxelles, Brussels, 1987.
22. A. BERMAN AND R. J. PLEMMONS, Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
23. T. F. CHAN AND G. A. MEURANT, Fourier Analysis of Block Preconditioners, CAM report 90-04, University of California, Los Angeles, 1990.
24. T. F. CHAN AND P. S. VASSILEVSKI, A framework for block-ILU factorization using block-size reduction, Math. Comp., 64 (1995), pp. 129-156.
25. P. CONCUS, G. H. GOLUB, AND G. A. MEURANT, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 220-252.
26. P. CONCUS, G. H. GOLUB, AND D. P. O'LEARY, A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations, in Sparse Matrix Computations, J. Bunch and D. Rose, eds., Academic Press, New York, 1976, pp. 309-332.
27. P. CONCUS AND G. A. MEURANT, On computing INV block preconditionings for the conjugate gradient method, BIT, 26 (1986), pp. 493-504.
28. S. DEMKO, W. F. MOSS, AND P. W. SMITH, Decay rates for inverses of band matrices, Math. Comp., 43 (1984), pp. 491-499.
29. 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), pp. 559-573.
30. V. EIJKHOUT AND B. POLMAN, Decay rates of inverses of banded M-matrices that are near to Toeplitz matrices, Linear Algebra Appl., 109 (1988), pp. 247-277.
31. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
32. A. GREENBAUM, Comparison of splittings used with the conjugate gradient algoritm, Numer. Math., 33 (1979), pp. 181-194.
33. I. GUSTAFSSON, Modified incomplete Cholesky (MIC) methods, in Preconditioning Methods. Theory and Applications, D. Evans, ed., Gordon and Breach, New York, London, Paris, 1983, pp. 265-293.
34. A. JENNINGS, Influence of the eigenvalue spectrum on the convergence rate of the conjugate gradient method, J. Inst. Math. Appl., 20 (1977), pp. 61-72.
35. S. KANIEL, Estimates for some computational techniques in linear algebra, Math. Comp., 20 (1966), pp. 369-378.
36. R. KETTLER, Linear Multigrid Methods for Numerical Reservoir Simulation, Ph.D. thesis, Dept. of Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands, 1987.
37. M. M. MAGOLU, Conditioning analysis of sparse block approximate factorizations, Appl. Numer. Math., 8 (1991), pp. 25-42.
38. M. M. MAGOLU, Modified block-approximate factorization strategies, Numer. Math., 61 (1992), pp. 91-110.
39. M. M. MAGOLU, Lower eigenvalue bounds for singular pencils of matrices, J. Comput. Appl. Math., 39 (1992), pp. 329-351.
40. M. M. MAGOLU, Sparse block approximate factorizations for singular problems, in Iterative Methods in Linear Algebra, R. Beauwens and P. de Groen, eds., North-Holland, Amsterdam, 1992, pp. 519-529.
41. M. M. MAGOLU, 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, Brussels, Belgium, 1992.
42. M. M. MAGOLU, Analytical bounds for block approximate factorization methods, Linear Algebra Appl., 179 (1993), pp. 33-57.
43. M. M. MAGOLU, Empirically modified block incomplete factorizations, in Incomplete Decomposition (ILU) - Algorithms, Theory and Applications, Notes Numer. Fluid Mech. 41, W. Hackbush and G. Wittum, eds., Vieweg, Braunschweig, 1993, pp. 78-87.
44. M. M. MAGOLU, Ordering strategies for modified block incomplete factorizations, SIAM J. Sci. Comput., 16 (1995), pp. 378-399.
45. M. M. MAGOLU, Implementation of parallel block preconditionings on a transputer-based multiprocessor, Future Generation Computer Systems, 11 (1995), pp. 167-173.
46. M. M. MAGOLU, Taking Advantage of the Potentialities of Dynamically Modified Block Incomplete Factorizations (Revised version), Report 9605, Department of Mathematics, University of Nijmegen, The Netherlands, February 1996.
47. M. M. MAGOLU AND Y. NOTAY, On the conditioning analysis of block approximate factorization methods, Linear Algebra Appl., 154-156 (1991), pp. 583-599.
48. M. M. MAGOLU AND B. POLMAN, Theoretical Comparison of Pointwise, Linewise and Planewise Preconditioners for Solving Three-Dimensional Problems, Report 9609, Department of Mathematics, University of Nijmegen, The Netherlands, March 1996, submitted.
49. G. A. MEURANT, The block preconditioned conjugate gradient method on vector computers, BIT, 24 (1984), pp. 623-633.
50. G. A. MEURANT, A review on the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal., 13 (1992), pp. 707-728.
51. Y. NOTAY, Solving positive (semi)definite linear systems by preconditioned iterative methods, Preconditioned Conjugate Gradient Methods, Lecture Notes in Math. 1457, O. Axelsson and L. Kolotilina, eds., Springer-Verlag, 1990, pp. 105-125.
52. Y. NOTAY, Conditioning analysis of modified block incomplete factorizations, Linear Algebra Appl., 154-156 (1991), pp. 711-722.
53. Y. NOTAY, On the robustness of modified incomplete factorization methods, Internat. J. Computer Math., 40 (1992), pp. 121-141.
54. Y. NOTAY, On the convergence rate of the conjugate gradients in presence of rounding errors, Numer. Math, 65 (1993), pp. 301-317.
55. S. V. PARTER, Iterative methods for elliptic problems and the discovery of "q," SIAM Rev., 28 (1986), pp. 153-175.
56. G. W. STEWART, The convergence of the method of conjugate gradient at isolated extreme points of the spectrum, Numer. Math., 24 (1975), pp. 85-93.
57. H. L. STONE, Iterative solution of implicit approximation of multidimensional partial differential equations, SIAM J. Numer. Anal., 5 (1968), pp. 530-558.
58. A. VAN DER SLUIS, The convergence behaviour of conjugate gradients and Ritz values in various circumstances, in Iterative Methods in Linear Algebra, R. Beauwens and P. de Groen, eds., North-Holland, Amsterdam, 1992, pp 49-66.
59. A. VAN DER SLUIS AND H. A. VAN DER VORST, The rate of convergence of conjugate gradients, Numer. Math., 48 (1986), pp. 543-560.
60. A. VAN DER SLUIS AND H. A. VAN DER VORST, The convergence behavior of Ritz values in the presence of close eigenvalues, Linear Algebra Appl., 88/89 (1987), pp. 651-694.
61. H. A. VAN DER VORST, The convergence behavior of some iterative methods, in Proc. Fifth International Symposium on Numerical Methods in Engineering 1, R. Gruber, J. Periaux, and R. Shaw, eds., Springer-Verlag, Berlin, 1989, pp. 61-72.
62. H. A. VAN DER VORST, The convergence behaviour of preconditioned CG and CG-S, in Preconditioned Conjugate Gradient Methods, Lecture Notes in Math 1457, O. Axelsson and L. Kolotilina, eds., Springer-Verlag, 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, W. Hackbusch and G. Wittum, eds., Notes Numer. Fluid Mech. 41, Vieweg, Braunschweig, 1993, pp. 179-187.
64. R. S. VARGA, Matrix Iterative Analysis, Prentice Hall, Englewood Cliffs, NJ, 1962.
65. P. S. VASSILEVSKI, On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorizations, Computing, 43 (1990), pp. 277-296.
66. E. L. WACHSPRESS, Iterative Solution of Elliptic Systems and Application to the Neutron Diffusion Equations of Reactor Physics, Prentice-Hall, Englewood Cliffs, NJ, 1966.
67. R. WINTHER, Some superlinear convergence results for the conjugate gradient method, SIAM J. Numer. Anal., 17 (1980), pp. 14-17.