Optimal order preconditioning of finite difference matrices

SIAM Journal on Scientific Computing

Volumn 21, Issue 6, 2000, Pages 1991-2007

  Notay, Yvan ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE DIFFERENCE MATRICES; MODIFIED INCOMPLETE FACTORIZATION; PRECONDITIONING; SCHUR COMPLEMENT; SECOND ORDER ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS;

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; FINITE DIFFERENCE METHOD; ITERATIVE METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA; PARTIAL DIFFERENTIAL EQUATIONS; POLYNOMIALS; THEOREM PROVING;

NATURAL SCIENCES COMPUTING;

EID: 0034511247     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827597320770     Document Type: Article

References (39)

1. O. AXELSSON, On multigrid methods of the two-level type, in Multigrid Methods, W. Hackbusch and U. Trottenberg, eds., Lecture Notes in Math. 960, Springer-Verlag, Berlin, Heidelberg, New York, 1981, pp. 352-367.
2. O. AXELSSON, The method of diagonal compensation of reduced matrix entries and multilevel iteration, J. Comput. Appl. Math., 38 (1991), pp. 31-43.
3. O. AXELSSON, On algebraic multilevel iterations for methods for selfadjoint elliptic problems with anisotropy, Fascicolo Speciale, Numerical Methods, Rend. Sem. Mat. Univ. Politec. Torino, (1991), pp. 31-61.
4. O. AXELSSON, Iterative Solution Methods, University Press, Cambridge, 1994.
5. O. AXELSSON AND V. A. BARKER, Finite Element Solution of Boundary Value Problems. Theory and Computation, Academic Press, New York, 1984.
6. O. AXELSSON AND V. EIJKHOUT, Analysis of recursive 5-point/9-point factorization method, in Preconditioned Conjugate Gradient Methods, O. Axelsson and L. Kolotilina, eds., Lecture Notes in Math. 1457, Springer-Verlag, Berlin, Heidelberg, New York, 1990, pp. 154-173.
7. O. AXELSSON AND V. EIJKHOUT, The nested recursive two level factorization for nine-point difference matrices, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 1373-1400.
8. O. AXELSSON AND I. GUSTAFSSON, Preconditioning and two-level multigrid methods of arbitrary degree of approximation, Math. Comp., 40 (1983), pp. 214-242.
9. O. AXELSSON AND G. LINDSKOG, On the eigenvalue distribution of a class of preconditioning methods, Numer. Math., 48 (1986), pp. 479-498.
10. O. AXELSSON AND M. NEYTCHEVA, Algebraic multilevel iterations for Stieltjes matrices, Numer. Linear Algebra Appl., 1 (1994), pp. 213-236.
11. O. AXELSSON AND P. S. VASSILEVSKI, Algebraic multilevel preconditioning methods, I, Numer. Math., 56 (1989), pp. 157-177.
12. O. AXELSSON AND P. S. VASSILEVSKI, Algebraic multilevel preconditioning methods, II, SIAM J. Numer. Anal., 27 (1990), pp. 1569-1590.
13. R. E. BANK, Hierarchical bases and the finite element method, Acta Numerica, 5 (1996), pp. 1-43.
14. R. E. BANK AND T. F. DUPONT, Analysis of a Two-Level Scheme for Solving Finite Element Equations, Tech. Rep. CNA-159, Center for Numerical Analysis, The University of Texas at Austin, Austin, TX, 1980.
15. R. E. BANK, T. F. DUPONT, AND H. YSERENTANT, The hierarchical basis multigrid method, Numer. Math., 52 (1988), pp. 427-458.
16. R. BARRETT, M. BERRY, T. F. CHAN, J. W. DEMMEL, J. DONATO, J. DONGARRA, V. EIJKHOUT, R. POZO, C. ROMINE, AND H. A. VAN DER VORST, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, 1993.
17. R. BEAUWENS, Upper eigenvalue bounds for pencils of matrices, Linear Algebra Appl., 62 (1984), pp. 87-104.
18. E. BOTTA, K. DEKKER, Y. NOTAY, A. VAN DER PLOEG, C. VUIK, F. WUBS, AND P. DE ZEEUW, How fast the Laplace equation was solved in 1995, Appl. Numer. Math., 24 (1997), pp. 439-455.
19. D. BRAESS, The convergence rate of a multigrid method with Gauss-Seidel relaxation for the Poisson equation, Math. Comp., 42 (1984), pp. 505-519.
20. T. C. CHAN AND H. A. VAN DER VORST, Approximate and incomplete factorizations, in Parallel Numerical Algorithms, D. E. Keyes, A. Samed, and V. Venkatakrishnan, eds., ICASE/LaRC Interdiscip. Ser. Sci. Eng. 4, Kluwer, Dordecht, 1997, pp. 167-202.
21. P. CONCUS, G. H. GOLUB, AND G. MEURANT, Block preconditioning for the conjugate gradient method, SIAM J. Sci. Statist. Comput., 6 (1985), pp. 220-252.
22. 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.
23. V. EIJKHOUT AND P. VASSILEVSKI, The role of the strengthened c.b.s. inequality in multilevel methods, SIAM Rev., 33 (1991), pp. 405-419.
24. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
25. Y. A. KUZNETSOV, Algebraic multigrid domain decomposition methods, Soviet J. Numer. Anal. Math. Modeling, 4 (1989), pp. 361-392.
26. Y. A. KUZNETSOV, Multi-level domain decomposition methods, Appl. Numer. Math., 6 (1989), pp. 303-314.
27. Y. A. KUZNETSOV, Multigrid domain decomposition methods, in Third International Symposium on Domain Decomposition Methods for Partial Differential Equations, T. F. Chan, R. Glowinski, J. Périaux, and O. B. Widlund, eds., SIAM, Philadelphia, 1990, pp. 211-227.
28. M. M. MAGOLU, Ordering strategies for modified block incomplete factorization, SIAM J. Sci. Comput., 16 (1995), pp. 378-399.
29. S. NAKAMURA, Computational Methods in Engineering and Science, John Wiley and Sons, New York, 1977.
30. Y. NOTAY, Polynomial acceleration of iterative schemes associated with subproper splittings, J. Comput. Appl. Math., 24 (1988), pp. 153-167.
31. Y. NOTAY, Incomplete factorization of singular linear systems, BIT, 29 (1989), pp. 682-702.
32. Y. NOTAY, Solving positive (semi)definite linear systems by preconditioned iterative methods, in Preconditioned Conjugate Gradient Methods, O. Axelsson and L. Kolotilina, eds., Lectures Notes in Math. 1457, Springer-Verlag, Berlin, Heidelberg, New York, 1990, pp. 105-125.
33. Y. NOTAY, Using approximate inverses in algebraic multilevel methods, Numer. Math., 80 (1998), pp. 397-417.
34. A. VAN DER PLOEG, E. BOTTA, AND F. WUBS, Nested grids ILU-decomposition (NGILU), J. Comput. Appl. Math., 66 (1996), pp. 515-526.
35. H. A. VAN DER VORST AND T. C. CHAN, Linear system solvers: Sparse iterative solvers, in Parallel Numerical Algorithms, D. E. Keyes, A. Samed, and V. Venkatakrishnan, eds., ICASE/LaRC Interdiscip. Ser. Sci. Eng. 4, Kluwer, Dordecht, 1997, pp. 91-118.
36. P. VASSILEVSKI, Nearly Optimal Iterative Methods for Solving Finite Element Elliptic Equations Based on the Multilevel Splitting of the Matrix, Tech. Report 1989-09, Institute for Scientific Computation, University of Wyoming, Laramie, WY, 1989.
37. P. VASSILEVSKI, Hybrid V-cycle algebraic multilevel preconditioners, Math. Comp., 58 (1992). pp. 489-512.
38. P. VASSILEVSKI, On two ways of stabilizing the hierarchical basis multilevel methods, SIAM Rev., 39 (1997), pp. 18-53.
39. H. YSERENTANT, On the multi-level splitting of finite element spaces, Numer. Math., 49 (1986), pp. 379-412.