Toward extremely scalable nonlinear domain decomposition methods for elliptic partial differential equations
The solution of nonlinear problems, eg, in material science, requires fast and highly scalable
parallel solvers. Finite element tearing and interconnecting dual primal (FETI-DP) domain …
parallel solvers. Finite element tearing and interconnecting dual primal (FETI-DP) domain …
Multispace and multilevel BDDC
Abstract The Balancing Domain Decomposition by Constraints (BDDC) method is the most
advanced method from the Balancing family of iterative substructuring methods for the …
advanced method from the Balancing family of iterative substructuring methods for the …
Adaptive-multilevel BDDC and its parallel implementation
We combine the adaptive and multilevel approaches to the BDDC and formulate a method
which allows an adaptive selection of constraints on each decomposition level. We also …
which allows an adaptive selection of constraints on each decomposition level. We also …
On adaptive-multilevel BDDC
B Sousedík*, J Mandel - Domain decomposition methods in science and …, 2010 - Springer
The BDDC method [2] is one of the most advanced methods of iterative substructuring. In the
case of many substructures, solving the coarse problem exactly becomes a bottleneck …
case of many substructures, solving the coarse problem exactly becomes a bottleneck …
A BDDC method for mortar discretizations using a transformation of basis
HH Kim, M Dryja, OB Widlund - SIAM Journal on Numerical Analysis, 2009 - SIAM
A BDDC (balancing domain decomposition by constraints) method is developed for elliptic
equations, with discontinuous coefficients, discretized by mortar finite element methods for …
equations, with discontinuous coefficients, discretized by mortar finite element methods for …
A three-level BDDC algorithm for a saddle point problem
X Tu - Numerische Mathematik, 2011 - Springer
BDDC algorithms have previously been extended to the saddle point problems arising from
mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC …
mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC …
Mathematical analysis of robustness of two-level domain decomposition methods with respect to inexact coarse solves
F Nataf - Numerische Mathematik, 2020 - Springer
Convergence of domain decomposition methods rely heavily on the efficiency of the coarse
space used in the second level. The GenEO coarse space has been shown to lead to a …
space used in the second level. The GenEO coarse space has been shown to lead to a …
A nonlinear FETI-DP method with an inexact coarse problem
A new nonlinear version of the well-known FETI-DP method (Finite Element Tearing and
Interconnecting Dual-Primal) is introduced. In this method, the nonlinear problem is …
Interconnecting Dual-Primal) is introduced. In this method, the nonlinear problem is …
Balancing Domain Decomposition by Constraints preconditioners for Virtual Element discretizations of Saddle-point problems
T Bevilacqua - 2024 - air.unimi.it
Abstract The Virtual Element Method (VEM) is a novel family of numerical methods for
approximating partial differential equations on general polygonal or polyhedral …
approximating partial differential equations on general polygonal or polyhedral …
Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations
LT Diosady - 2011 - dspace.mit.edu
Aerodynamic flows involve features with a wide range of spatial and temporal scales which
need to be resolved in order to accurately predict desired engineering quantities. While …
need to be resolved in order to accurately predict desired engineering quantities. While …