A Three-Level BDDC Algorithm for Mortar Discretizations
From MaRDI portal
Publication:3559159
DOI10.1137/07069081XzbMath1194.65146MaRDI QIDQ3559159
Publication date: 11 May 2010
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
convergencenumerical experimentscondition numberelliptic boundary-value problemsbalancing domain decomposition by constraintscoarse problemMortar discretizationthree-level domain decomposition
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Related Items
A unified dual-primal finite element tearing and interconnecting approach for incompressible Stokes equations ⋮ Inexact and primal multilevel FETI‐DP methods: a multilevel extension and interplay with BDDC ⋮ BDDC and FETI-DP for the virtual element method ⋮ A three-level BDDC algorithm for a saddle point problem ⋮ Analysis of BDDC algorithms for Stokes problems with hybridizable discontinuous Galerkin discretizations ⋮ Adaptive-multilevel BDDC and its parallel implementation ⋮ An adaptive BDDC algorithm in variational form for mortar discretizations ⋮ A substructuring preconditioner with vertex-related interface solvers for elliptic-type equations in three dimensions ⋮ DUAL-PRIMAL METHODS FOR THE CARDIAC BIDOMAIN MODEL ⋮ Substructuring Preconditioners for the Systems Arising from Plane Wave Discretization of Helmholtz Equations
