Preconditioner updates for solving sequences of linear systems in matrix-free environment

Numerical Linear Algebra with Applications

Volumn 17, Issue 6, 2010, Pages 997-1019

  Duintjer Tebbens, Jurjen ^a   Tůma, Miroslav ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Factorization updates; Incomplete factorizations; Inexact Newton Krylov methods; Matrix free environment; Preconditioned iterative methods

Indexed keywords

EID: 78649654096     PISSN: 10705325     EISSN: 10991506     Source Type: Journal    
DOI: 10.1002/nla.695     Document Type: Article

References (48)

1. Kelley CT. Iterative Methods for Linear and Nonlinear Equations. SIAM: Philadelphia, PA, 1995.
2. Kelley CT. Solving Nonlinear Equations with Newton's Method. Fundamentals of Algorithms. SIAM: Philadelphia, PA, 2003.
3. Brown PN, Saad Y. Hybrid Krylov methods for solving systems of nonlinear equations. SIAM Journal on Scientific and Statistical Computing 1990; 11:450-481.
4. Mousseau VA, Knoll DA, Rider WJ. Physics-based preconditioning and the Newton-Krylov method for non-equilibrium radiation diffusion. Journal of Computational Physics 2000; 160:743-765.
5. Keyes D. Terascale Implicit Methods for Partial Differential Equations. Contemporary Mathematics, vol. 306. AMS: Providence, RI, 2001; 29-84.
6. Reisner J, Mousseau VA, Wyszogrodzki AA, Knoll DA. An efficient physics-based preconditioner for the fully implicit solution of small-scale thermally driven atmospheric flows. Journal of Computational Physics 2003; 189:30-44.
7. Knoll DA, Keyes D. Jacobian-free Newton-Krylov methods: a survey of approaches and applications. Journal of Computational Physics 2004; 193:357-397.
8. Bernsen E, Dijkstra HA, Wubs FW. A method to reduce the spin-up time of ocean models. Ocean Modelling 2008; 20:380-392.
9. Li X, Primeau F. A fast Newton-Krylov solver for seasonally varying global ocean biogeochemistry models. Ocean Modelling 2008; 23:13-20.
10. Khatiwala S. Fast spin up of ocean biogeochemical models using matrix-free Newton-Krylov. Ocean Modelling 2008; 23:121-129.
11. Chan T, Jackson K. Nonlinearly preconditioned Krylov subspace methods for discrete Newton algorithms. SIAM Journal on Scientific and Statistical Computing 1984; 5(3):533-542.
12. Luo H, Baum JD, Löhner R. A fast, matrix-free implicit method for compressible flows on unstructured grids. Journal of Computational Physics 1998; 146(2):664-690.
13. Choquet R. A matrix-free preconditioner applied to CFD. Technical Report No. 940, INRIA, France, 1995.
14. Chen Y, Shen C. A Jacobian-free Newton-GMRES(m) method with adaptive preconditioner and its application for power flow calculations. IEEE Transactions on Power Systems 2006; 21(3):1096-1103.
15. Morales JL, Nocedal J. Automatic preconditioning by limited memory quasi-Newton updating. SIAM Journal on Optimization 2000; 10(4):1079-1096 (electronic).
16. Bergamaschi L, Bru R, Martínez A, Putti M. Quasi-Newton preconditioners for the inexact Newton method. Electronic Transactions on Numerical Analysis 2006; 23:63-74.
17. Nocedal J. Updating quasi-Newton matrices with limited storage. Mathematical Computations 1980; 35(151):773-782.
18. Serra Capizzano S, Tablino Possio C. High-order finite difference schemes and Toeplitz based preconditioners for elliptic problems. Electronic Transactions on Numerical Analysis 2000; 11:55-84 (electronic).
19. Serra Capizzano S, Tablino Possio C. Preconditioning strategies for 2D finite difference matrix sequences. Electronic Transactions on Numerical Analysis 2003; 16:1-29 (electronic).
20. Bertaccini D, Golub GH, Serra Capizzano S, Tablino Possio C. Preconditioned HSS methods for the solution of non-Hermitian positive definite linear systems and applications to the discrete convection-diffusion equation. Numerische Mathematik 2005; 99(3):441-484.
21. Kharchenko SA, Yeremin AY. Eigenvalue translation based preconditioners for the GMRES(k) method. Numerical Linear Algebra with Applications 1995; 2(1):51-77.
22. Baglama J, Calvetti D, Golub GH, Reichel L. Adaptively preconditioned GMRES algorithms. SIAM Journal on Scientific Computing 1998; 20:243-269.
23. Erhel J, Burrage K, Pohl B. Restarted GMRES preconditioned by deflation. Journal of Computational and Applied Mathematics 1996; 69(2):303-318.
24. Morgan RB. A restarted GMRES method augmented with eigenvectors. SIAM Journal on Matrix Analysis and Applications 1995; 16(4):1154-1171.
25. Saad Y, Yeung M, Erhel J, Guyomarc'h F. A deflated version of the conjugate gradient algorithm. SIAM Journal on Scientific Computing 2000; 21(5):1742-1749. Iterative methods for solving systems of algebraic equations (Copper Mountain, CO, 1998).
26. Parks ML, de Sturler E, Mackey G, Johnson DD, Maiti S. Recycling Krylov subspaces for sequences of linear systems. SIAM Journal on Scientific Computing 2006; 28(5):1651-1674 (electronic).
27. Wang S, de Sturler E, Paulino GH. Large-scale topology optimization using preconditioned Krylov subspace methods with recycling. International Journal for Numerical Methods in Engineering 2007; 69(12):2441-2468.
28. de Sturler E, Le C, Wang S, Paulino G. Large scale topology optimization using preconditioned Krylov subspace recycling and continuous approximation of material distribution. In Multiscale and Functionally Graded Materials 2006 (M&FGM 2006), Paulino GH, Pindera M-J, Dodds Jr RH, Rochinha FA, Dave E, Chen L (eds), Oahu Island, Hawaii, 15-18 October 2006. AIP Conference Proceedings, 2008; 279-284.
29. Meurant G. On the incomplete Cholesky decomposition of a class of perturbed matrices. SIAM Journal on Scientific Computing 2001; 23(2):419-429 (electronic). Copper Mountain Conference, 2000.
30. Benzi M, Bertaccini D. Approximate inverse preconditioning for shifted linear systems. BIT 2003; 43(2):231-244.
31. Bertaccini D. Efficient preconditioning for sequences of parametric complex symmetric linear systems. Electronic Transactions on Numerical Mathematics 2004; 18:49-64.
32. Duintjer Tebbens J, Tůma M. Efficient preconditioning of sequences of nonsymmetric linear systems. SIAM Journal on Scientific Computing 2007; 29(5):1918-1941.
33. Duintjer Tebbens J, Tůma M. Improving Triangular Preconditioner Updates for Nonsymmetric Linear Systems. Lecture Notes in Computer Science, vol. 4818. Springer: New York, 2008; 737-744.
34. Birken P, Duintjer Tebbens J, Meister A, Tůma M. Preconditioner updates applied to CFD model problems. Applied Numerical Mathematics 2008; 58(11):1628-1641.
35. Curtis AR, Powell MJD, Reid JK. On the estimation of sparse Jacobian matrices. Journal of the Institute of Mathematics and its Applications 1974; 13:117-119.
36. Coleman TF, Moré JJ. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM Journal on Numerical Analysis 1983; 20:187-209.
37. Gebremedhin AH, Manne F, Pothen A. What color is your Jacobian? Graph coloring for computing derivatives. SIAM Review 2005; 47:629-705.
38. Griewank A, Toint PL. On the unconstrained optimization of partially separable functions. Nonlinear Optimization, 1981 (Cambridge, 1981). NATO Conference Series II: Systems Science. Academic Press: London, 1982; 301-312.
39. Cullum J, Tůma M. Matrix-free preconditioning using partial matrix estimation. BIT Numerical Mathematics 2006; 46:711-729.
40. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co.: New York, 1979.
41. Siefert C, de Sturler E. Probing methods for saddle-point problems. Electronic Transactions on Numerical Analysis 2006; 22:163-183 (electronic).
42. Cuthill EH, McKee J. Reducing the bandwidth of sparse symmetric matrices. Proceedings of the 24th National Conference of the ACM. ACM Press: New York, 1969; 157-172.
43. Liu JWH, Sherman AH. Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices. SIAM Journal on Numerical Analysis 1976; 13:198-213.
44. Benzi M, Szyld DB, van Duin A. Orderings for incomplete factorization preconditioning of nonsymmetric problems. SIAM Journal on Scientific Computing 1999; 20(5):1652-1670.
45. Lukšan L, Vlček J. Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations. Optimization Methods in Software 1998; 8(3-4):201-223.
46. Lukšan L, Tůma M, Vlček J, Ramešová N, Šiška M, Hartman J, Matonoha C. UFO 2008-interactive system for universal functional optimization. Technical Report V-1040, downloadable from, ICS AS CR 2008.
47. Saad Y. ILUT: a dual threshold incomplete LU factorization. Numerical Linear Algebra with Applications 1994; 1(4):387-402.
48. Hartmann S, Duintjer Tebbens J, Quint K, Meister A. Iterative solvers within sequences of large linear systems in non-linear structural mechanics. ZAMM 2009; 89:711-728.