A spectral projection preconditioner for solving ill conditioned linear systems

Journal of Computational Science

Volumn 20, Issue , 2017, Pages 177-186

  Yeung, Man Chung ^a   Douglas, Craig C ^a   Lee, Long ^a  

^a UNIVERSITY OF WYOMING   (United States)

Author keywords

Multigrid; Numerical analysis; Preconditioners; Scientific computing

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; COMPUTER SIMULATION; NATURAL SCIENCES COMPUTING; NUMERICAL ANALYSIS;

ILL CONDITIONED LINEAR SYSTEMS OF EQUATIONS; ILL CONDITIONED PROBLEMS; ILL-CONDITIONED LINEAR SYSTEMS; KRYLOV SUBSPACE METHOD; KRYLOV SUBSPACE SOLVERS; LINEAR SYSTEM OF EQUATIONS; MULTI-GRID; NOCV1; PRECONDITIONERS;

LINEAR SYSTEMS;

EID: 85010899682     PISSN: 18777503     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jocs.2017.01.005     Document Type: Article

References (56)

1. Astrakhantsev, G.P., An iterative method of solving elliptic net problems. Z. Vycisl. Mat. i. Mat. Fiz. 11 (1971), 439–448.
2. Bakhvalov, N.S., On the convergence of a relaxation method under natural constraints on an elliptic operator. Z. Vycisl. Mat. i. Mat. Fiz. 6 (1966), 861–883.
3. Bank, R.E., Douglas, C.C., Sharp estimates for multigrid rates of convergence with general smoothing and acceleration. SIAM J. Numer. Anal. 22 (1985), 617–633.
4. Beck, R., Graph-based algebraic multigrid for lagrange-type finite elements on simplicial meshes. Preprint SC 99-22, Konrad-Zuse-Zentrum fur Informationstechnik. 1999.
5. Brandt, A., Multi-level adaptive solutions to boundary-value problems. Math. Comp. 31 (1977), 333–390.
6. Chapman, A., Saad, Y., Deflated and augmented Krylov subspace techniques. Numer. Linear Algebra Appl. 4:1 (1997), 43–66.
7. Chatelin, F., Spectral Approximation of Linear Operators. 1984, Academic Press, New York.
8. Davis, Tim A., Hu, Yifan, The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38 (2011), 1–25 http://www.cise.ufl.edu/research/sparse/matrices (last visited April 4, 2016).
9. Dinkla, R.M., GMRES(m) with deflation applied to nonsymmetric systems arising from fluid mechanics problems. Masters thesis. 2009, Delft University of Technology, Delft, The Netherlands.
10. Douglas, C., Lee, L., Yeung, M., On solving ill conditioned linear systems. Procedia Comput. Sci. 80 (2016), 1–10.
11. C. C. Douglas;1; Abstract multi-grid with applications to elliptic boundary-value problems. In G. Birkhoff and A. Schoenstadt, editors, Elliptic Problem Solvers II, pages, 453-466. Academic Press, New York, 1984.
12. Douglas, C.C., Multi-grid algorithms with applications to elliptic boundary-value problems. SIAM J. Numer. Anal. 21 (1984), 236–254.
13. Douglas, C.C., A generalized multigrid theory in the style of standard iterative methods. In Multigrid Methods IV. Proceedings of the Fourth European Multigrid Conference, Amsterdam, July 6-9, 1993, volume 116 of ISNM, Basel, Birkhäuser, 1994, 19–34.
14. Douglas, C.C., Madpack: A family of abstract multigrid or multilevel solvers. Comput. Appl. Math. 14 (1995), 3–20.
15. Douglas, C.C., A review of numerous parallel multigrid methods. Astfalk, G., (eds.) Applications on Advanced Architecture Computers, 1996, SIAM, Philadelphia, 187–202.
16. Douglas, C.C., Douglas, J., Fyfe, D.E., A multigrid unified theory for non-nested grids and/or quadrature. E. W. J. Numer. Math. 2 (1994), 285–294.
17. Douglas, C.C., Hu, J., Kowarschik, M., Rüde, U., Weiss, C., Cache optimization for structured and unstructured grid multigrid. Elect. Trans. Numer. Anal. 10 (2000), 21–40.
18. Dunford, N., Schwartz, J.T., Linear Operators, General Theory (Part I). 1988, Wiley-Interscience, Hoboken, New Jersey.
19. Engl, H.W., Regularization methods for the stable solution of inverse problems. Surveys Math. Indust. 3 (1993), 71–143.
20. R. P. Fedorenko;1; A relaxation method for solving elliptic difference equations. Z. Vycisl. Mat. i. Mat. Fiz., 1: 922-927, 1961. Also in U.S.S.R. Comput. Math. and Math. Phys., 1 (1962), pp. 1092-1096.
21. Fedorenko, R.P., The speed of convergence of one iterative process. Z. Vycisl. Mat. i. Mat. Fiz. Z. Vycisl. Mat. i. Mat. Fiz., 4: 559-563, 1964. Also in U.S.S.R. Comput. Math. and Math. Phys. 4 (1964), 227–235.
22. Fletcher, R., Conjugate gradient methods for indefinite systems. 1976, Springer-Verlag, Berlin-Heidelberg-New York, 73–89.
23. Frank, J., Vuik, C., On the construction of deflation-based preconditioners. SIAM J. Sci. Comput. 23:2 (2001), 442–462.
24. Futamura, Y., Tadano, H., Sakurai, T., Parallel stochastic estimation method of eigenvalue distribution. JSIAM Letters 2 (2011), 27–30.
25. Gaul, A., Gutknecht, M.H., Liesen, J., Nabben, R., A framework for deflated and augmented krylov subspace methods. SIAM J. Matrix Anal. Appl. 34:2 (2013), 495–518.
26. Gijzen, M., Sonneveld, P., Algorithm 913: an elegant IDR(s) variant that efficiently exploits bi-orthogonality properties. ACM Trans. Math. Software, 38, 2011 5:1-5:19.
27. Golub, G., Van Loan, C., Matrix Computations. 4th edition, 2013, The Johns Hopkins University Press, Baltimore.
28. Groetsch, C.W., Generalized Inverses of Linear Operators. 1997, New York, Dekker.
29. Haase, G., A parallel AMG for overlapping and non-overlapping domain decomposition. Elect. Trans. Numer. Anal. 10 (2000), 41–55.
30. Hackbusch, W., Multigrid Methods and Applications, volume 4 of Computational Mathematics. volume 4 of Computational Mathematics. 1985, Springer-Verlag, Berlin.
31. Kato, T., Perturbation Theory for Linear Operators. 1976, New York, Springer-Verlag.
32. Mansfield, L., Damped Jacobi preconditioning and coarse grid deflation for conjugate gradient iteration on parallel computers. SIAM J. Sci. Stat. Comput. 12:6 (1997), 1314–1323.
33. Morgan, R.B., A restarted GMRES method augmented with eigenvectors. SIAM J. Matrix Anal. Appl. 16 (1995), 1154–1171.
34. Morgan, R.B., GMRES with deflated restarting. SIAM J. Sci. Comput. 24 (2002), 20–37.
35. Edoardo Di Napoli and Eric Polizzi and Yousef Saad;1; Efficient estimation of eigenvalue counts in an interval. arXiv:1308.4275, 2014.
36. Nicolaides, R.A., Deflation of conjugate gradients with applications to boundary value problems. SIAM J. Numer. Anal. 24 (1987), 355–365.
37. Paige, C.C., Saunders, M.A., Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12 (1975), 617–629.
38. Polizzi, E., Density-matrix-based algorithm for solving eigenvalue problems. Phys. Rev. B, 79(115112), 2009.
39. Ruge, J.W., Stüben, K., Efficient solution of finite difference and_nite element equations by algebraic multigrid (AMG). Paddon, D.J., Holstein, H., (eds.) Multigrid Methods for Integral and Differential Equations, The Institute of Mathematics and its Applications Conference Series, 1985, Clarendon Press, Oxford, 169–212.
40. Saad, Y., Iterative Methods for Sparse Linear Systems. 2nd edition, 2003, SIAM, Philadelphia.
41. Saad, Y., Numerical Methods for Large Eigenvalue Problems. 2011, Philadelphia, SIAM.
42. Saad, Y., Schultz, M.H., GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7 (1986), 856–869.
43. Sakurai, T., Sugiura, H., A projection method for generalized eigenvalue problems using numerical integration. J. comput. Appl. Math. 159 (2003), 119–128.
44. Sakurai, T., Tadano, H., CIRR: A Rayleigh-Ritz type method with contour integral for generalized eigenvalue problems. Hokkaido Math. J. 36 (2007), 745–757.
45. Sonneveld, P., van Gijzen, M., IDR(s): a family of simple and fast algorithms for solving large nonsymmetric systems of linear equations. SIAM J. Sci. Comput. 31:2 (2008), 1035–1062.
46. Stüben, K., An introduction to algebraic multigrid. Trottenberg, U., Oosterlee, C.W., Schüller, A., (eds.) Multigrid, 2000, Academic Press, London, 413–532 Appendix A.
47. Tang, J.M., Vuik, C., On deflation and singular symmetric positive semi-definite matrices. J. Comput. Appl. Math. 206:2 (2006), 603–614.
48. Tang, P.T.P., Polizzi, E., Feast as a subspace iteration eigensolver accelerated by approximate spectral projection. SIAM J. Matrix Anal. Appl. 35 (2014), 354–390.
49. van der Sluis, A., van der Vorst, H.A., The rate of convergence of conjugate gradients. Numer. Math. 48 (1986), 543–560.
50. Vuik, C., Segal, A., Meijerink, J.A., An efficient preconditioned CG method for the solution of a class of layered problems with extreme contrasts in the coefficients. J. Comput. Phys. 152:1 (1999), 385–403.
51. Wesseling, P., An Introduction to Multigrid Methods. 1992, John Wiley & Sons, Chichester.
52. Yeung, M., ML(n)BiCGStab: Refomulation, analysis and implementation. Numer. Math. Theor. Meth. Appl. 5 (2012), 447–492.
53. Yeung, M., ML(n)BiCGStabt: a ML(n)BiCGStab variant with A-transpose. J. Comput. Appl. Math. 272 (2014), 57–69.
54. Yeung, M., Tang, J., Vuik, C., On the convergence of GMRES with invariant-subspace deflation. Report 10-14. 2010, Delft Univ. of Technology.
55. Yin, G., Chan, R.H., Yeung, M., A FEAST algorithm with oblique projection for generalized eigenvalue problems. To appear in Numerical Linear Algebra with Applications. 2016.
56. J. Zhang A software package for generating test matrices for the convection-diffusion equations. http://www.cs.uky.edu/∼jzhang/bench.html, 1997.