Partially Updated Restricted Additive Schwarz Preconditioner

  • Laurent BerenguerEmail author
  • Damien Tromeur-Dervout
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 104)


The solution of differential equations with implicit methods requires the solution of a nonlinear problem at each time step. We consider Newton-Krylov ([8], Chap.  3) methods to solve these nonlinear problems: the linearized system of each Newton iteration of each time step is solved by a Krylov method. Generally speaking, the most time-consuming part of the numerical simulation is the solution of the sequence of linear systems by the Krylov method. Then, providing a good preconditioner is a critical point: a balance must be found between the ability of the preconditioner to reduce the number of Krylov iterations, and its computational cost. The method that combines a Newton-Krylov method with a Schwarz domain decomposition preconditioner is called Newton-Krylov-Schwarz (NKS) [5]. In this paper, we deal with the Restricted Additive Schwarz (RAS) preconditioner [4]. We propose to freeze this preconditioner for a few time steps, and to partially update it. Here, the partial update of the preconditioner consists in recomputing some parts of the preconditioner associated to certain subdomains, keeping the other ones frozen. These partial updates improve the efficiency and the longevity of the frozen preconditioner. Furthermore, they can be computed asynchronously in order to improve the parallelism.



This work has been supported by the French National Agency of Research (project ANR-MONU12-0012 H2MNO4), and the région Rhône-Alpes. Authors also thank the Center for the Development of Parallel Scientific Computing (CDCSP) of the University of Lyon 1 for providing us with computing resources.


  1. 1.
    S. Balay, J. Brown, K. Buschelman, V. Eijkhout, W.D. Gropp, D. Kaushik, M.G. Knepley, L.C. McInnes, B.F. Smith, H. Zhang, PETSc users manual. Technical Report ANL-95/11 - Revision 3.3, Argonne National Laboratory (2012)Google Scholar
  2. 2.
    M. Benzi, D. Bertaccini, Approximate inverse preconditioning for shifted linear systems. BIT Numer. Math. 43(2), 231–244 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    L. Bergamaschi, R. Bru, A. Martínez, M. Putti, Quasi-Newton preconditioners for the inexact Newton method. Electron. Trans. Numer. Anal. 23, 76–87 (electronic) (2006)Google Scholar
  4. 4.
    X.-C. Cai, M. Sarkis, A restricted additive Schwarz preconditioner for general sparse linear systems. SIAM J. Sci. Comput. 21(2), 792–797 (electronic) (1999)Google Scholar
  5. 5.
    X.-C. Cai, W.D. Gropp, D.E. Keyes, M.D. Tidriri, Newton-Krylov-Schwarz methods in CFD, in Proceedings of the International Workshop on Numerical Methods for the Navier-Stokes Equations (Vieweg, Braunschweig, 1995), pp. 17–30zbMATHGoogle Scholar
  6. 6.
    J. Erhel, K. Burrage, B. Pohl, Restarted gmres preconditioned by deflation. J. Comput. Appl. Math. 69(2), 303–318 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    A. Frommer, D.B. Szyld, On asynchronous iterations. J. Comput. Appl. Math. 123(1–2), 201–216 (2000) [Numerical Analysis, vol. III. Linear Algebra (2000)]Google Scholar
  8. 8.
    C.T. Kelley, Solving Nonlinear Equations with Newton’s Method. Fundamentals of Algorithms, vol. 1 (Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 2003)Google Scholar
  9. 9.
    M.L. Parks, E. De Sturler, G. Mackey, D.D. Johnson, S. Maiti, Recycling Krylov subspaces for sequences of linear systems. SIAM J. Sci. Comput. 28(5), 1651–1674 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Y. Saad, A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Comput. 14(2), 461–469 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    P. Spiteri, J.-C. Miellou, D.E. Baz, Parallel asynchronous Schwarz and multisplitting methods for a nonlinear diffusion problem. Numer. Algorithms 33(1–4), 461–474 (2003). [International Conference on Numerical Algorithms, vol. I (Marrakesh, 2001)]Google Scholar
  12. 12.
    J.D. Tebbens, M. Tuma, Efficient preconditioning of sequences of nonsymmetric linear systems. SIAM J. Sci. Comput. 29(5), 1918–1941 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    J.D. Tebbens, M. Tuma, Preconditioner updates for solving sequences of linear systems in matrix-free environment. Numer. Linear Algebra Appl. 17, 997–1019 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    H.A. van der Vorst, Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymetric linear systems. SIAM J. Sci. Stat. Comput. 13, 631–644 (1992)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Université de LyonUniversité Lyon 1, CNRS, Institut Camille Jordan (UMR 5208)VilleurbanneFrance

Personalised recommendations