An adaptive BDDC algorithm in variational form for mortar discretizations
From MaRDI portal
Publication:1743929
DOI10.1016/J.CAM.2017.11.031zbMATH Open1448.65246arXiv1704.07674OpenAlexW2962744332MaRDI QIDQ1743929FDOQ1743929
Authors: Jie Peng, Shi Shu, Junxian Wang 
Publication date: 16 April 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Abstract: A balancing domain decomposition by constraints (BDDC) algorithm with adaptive primal constraints in variational form is introduced and analyzed for high-order mortar discretization of two-dimensional elliptic problems with high varying and random coefficients. Some vector-valued auxiliary spaces and operators with essential properties are defined to describe the variational algorithm, and the coarse space is formed by using a transformation operator on each interface. Compared with the adaptive BDDC algorithms for conforming Galerkin approximations, our algorithm is more simple, because there is not any continuity constraints at subdomain vertices in the mortar method involved in this paper. The condition number of the preconditioned system is proved to be bounded above by a user-defined tolerance and a constant which is dependent on the maximum number of interfaces per subdomain, and independent of the mesh size and the contrast of the given coefficients. Numerical results show the robustness and efficiency of the algorithm for various model problems.
Full work available at URL: https://arxiv.org/abs/1704.07674
Recommendations
- A BDDC Algorithm for Mortar Discretization of Elasticity Problems
- A BDDC method for mortar discretizations using a transformation of basis
- Adaptive deluxe BDDC mixed and hybrid primal discretizations
- A three-level BDDC algorithm for mortar discretizations
- A BDDC algorithm for the mortar-type rotated \(Q_1\) FEM for elliptic problems with discontinuous coefficients
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Series and parallel addition of matrices
- A simple and efficient extension of a class of substructure based preconditioners to heterogeneous structural mechanics problems
- Title not available (Why is that?)
- A Mortar Finite Element Method Using Dual Spaces for the Lagrange Multiplier
- Discretization methods and iterative solvers based on domain decomposition
- BDDC and FETI-DP without matrices or vectors
- BDDC methods for discontinuous Galerkin discretization of elliptic problems
- FETI-DP, BDDC, and block Cholesky methods
- A Preconditioner for Substructuring Based on Constrained Energy Minimization
- Title not available (Why is that?)
- A BDDC Algorithm for Mortar Discretization of Elasticity Problems
- Adaptive selection of face coarse degrees of freedom in the BDDC and the FETI-DP iterative substructuring methods
- A three-level BDDC algorithm for mortar discretizations
- Three‐level BDDC in two dimensions
- Iterative Substructuring Preconditioners for Mortar Element Methods in Two Dimensions
- BDDC preconditioners for continuous and discontinuous Galerkin methods using spectral/\(hp\) elements with variable local polynomial degree
- An adaptive choice of primal constraints for BDDC domain decomposition algorithms
- A BDDC method for mortar discretizations using a transformation of basis
- BDDC and FETI-DP preconditioners with adaptive coarse spaces for three-dimensional elliptic problems with oscillatory and high contrast coefficients
- PCBDDC: a class of robust dual-primal methods in PETSc
- A BDDC algorithm with enriched coarse spaces for two-dimensional elliptic problems with oscillatory and high contrast coefficients
- A BDDC algorithm with adaptive primal constraints for staggered discontinuous Galerkin approximation of elliptic problems with highly oscillating coefficients
- BDDC algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields
- A regularized domain decomposition method with Lagrange multiplier
- Adaptive selection of primal constraints for isogeometric BDDC deluxe preconditioners
- Adaptive Coarse Spaces for BDDC with a Transformation of Basis
- Robust BDDC preconditioners for Reissner-Mindlin plate bending problems and MITC elements
- Multilevel balancing domain decomposition by constraints deluxe algorithms with adaptive coarse spaces for flow in porous media
Cited In (7)
- Adaptive-multilevel BDDC algorithm for three-dimensional plane wave Helmholtz systems
- A BDDC algorithm with enriched coarse spaces for two-dimensional elliptic problems with oscillatory and high contrast coefficients
- Adaptive deluxe BDDC mixed and hybrid primal discretizations
- A BDDC method for mortar discretizations using a transformation of basis
- An adaptive BDDC method enhanced with prior selected primal constraints
- An adaptive BDDC preconditioner for advection-diffusion problems with a stabilized finite element discretization
- Adaptive BDDC algorithms for the system arising from plane wave discretization of Helmholtz equations
Uses Software
This page was built for publication: An adaptive BDDC algorithm in variational form for mortar discretizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743929)
