Inexact Dual-Primal Isogeometric Tearing and Interconnecting Methods

  • Christoph HoferEmail author
  • Ulrich LangerEmail author
  • Stefan TakacsEmail author
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 125)


In Isogeometric Analysis (IgA), non-trivial computational domains are often composed of volumetric patches where each of them is discretized by means of tensor-product B-splines or NURBS. In such a setting, the dual-primal IsogEometric Tearing and Interconnecting (IETI-DP) method, that is nothing but the generalization of the FETI-DP method to IgA, has proven to be a very efficient solver for huge systems of IgA equations. Using IETI-DP, basically any patch-local solver can be extended to the global problem. So far, only direct solvers have been considered as patch-local solvers. In the present paper, we compare them with the option of using robust multigrid as patch-local solver. This is of special interest for large-scale patch-local systems or/and for large spline degrees, because the convergence of standard smoothers deteriorates with large spline degrees and the robust multigrid smoother chosen is only available on tensor-product discretizations.



This work was supported by the Austrian Science Fund (FWF) under the grant W1214, project DK4, and via the NFN project S117-03. This support is gratefully acknowledged.


  1. 1.
    L. Beirão da Veiga, D. Cho, L.F. Pavarino, S. Scacchi, BDDC preconditioners for isogeometric analysis. Math. Models Methods Appl. Sci. 23(6), 1099–1142 (2013)MathSciNetCrossRefGoogle Scholar
  2. 2.
    L. Beirão da Veiga, A. Buffa, G. Sangalli, R. Vázquez, Mathematical analysis of variational isogeometric methods. Acta Numer. 23, 157–287 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    L. Beirão da Veiga, L.F. Pavarino, S. Scacchi, O.B. Widlund, S. Zampini, Adaptive selection of primal constraints for isogeometric BDDC deluxe preconditioners. SIAM J. Sci. Comput. 39(1), A281–A302 (2017)MathSciNetCrossRefGoogle Scholar
  4. 4.
    J.H. Bramble, J.E. Pasciak, A preconditioning technique for indefinite systems resulting from mixed approximations of elliptic problems. Math. Comput. 50(181), 1–17 (1988)MathSciNetCrossRefGoogle Scholar
  5. 5.
    C. Hofer, Parallelization of continuous and discontinuous Galerkin dual–primal isogeometric tearing and interconnecting methods. Comput. Math. Appl. 74(7), 1607–1625 (2017)MathSciNetCrossRefGoogle Scholar
  6. 6.
    C. Hofer, U. Langer, Dual-primal isogeometric tearing and interconnecting solvers for multipatch dG-IgA equations. Comput. Methods Appl. Mech. Eng. 316, 2–21 (2017)MathSciNetCrossRefGoogle Scholar
  7. 7.
    C. Hofreither, S. Takacs, Robust multigrid for isogeometric analysis based on stable splittings of spline spaces. SIAM J. Numer. Anal. 55(4), 2004–2024 (2017)MathSciNetCrossRefGoogle Scholar
  8. 8.
    T.J.R. Hughes, J.A. Cottrell, Y. Bazilevs, Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement. Comput. Methods Appl. Mech. Eng. 194, 4135–4195 (2005)MathSciNetCrossRefGoogle Scholar
  9. 9.
    A. Klawonn, O. Rheinbach, Inexact FETI-DP methods. Int. J. Numer. Methods Eng. 69(2), 284–307 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    A. Klawonn, M. Lanser, O. Rheinbach, A Highly Scalable Implementation of Inexact Nonlinear FETI-DP Without Sparse Direct Solvers (Springer International Publishing, Cham, 2016), pp. 255–264zbMATHGoogle Scholar
  11. 11.
    S. Kleiss, C. Pechstein, B. Jüttler, S. Tomar, IETI-isogeometric tearing and interconnecting. Comput. Methods Appl. Mech. Eng. 247, 201–215 (2012)MathSciNetCrossRefGoogle Scholar
  12. 12.
    A. Kuzmin, M. Luisier, O. Schenk, Fast methods for computing selected elements of the Greens function in massively parallel nanoelectronic device simulations, in Euro-Par 2013, ed. by F. Wolf, B. Mohr, D. Mey. LNCS, vol. 8097 (Springer, Berlin, 2013), pp. 533–544Google Scholar
  13. 13.
    J. Schöberl, W. Zulehner, Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems. SIAM J. Matrix Anal. Appl. 29(3), 752–773 (2007)MathSciNetCrossRefGoogle Scholar
  14. 14.
    A. Toselli, O.B. Widlund, Domain Decomposition Methods– Algorithms and Theory (Springer, Berlin, 2005)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Johannes Kepler University (JKU)LinzAustria
  2. 2.Austrian Academy of SciencesRICAMLinzAustria

Personalised recommendations