ASM-BDDC preconditioners with variable polynomial degree for CG- and DG-SEM

DOI10.1007/978-3-319-05789-7_52zbMATH Open1382.65379OpenAlexW2281622627MaRDI QIDQ3133666FDOQ3133666

Authors L. F. Pavarino, Alexandre B. Pieri, C. Canuto 

Publication date 5 February 2018

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-05789-7_52

zbMATH Keywords

numerical resultspreconditionerdiscontinuous Galerkinbalancing domain decomposition by constraintssecond order elliptic problemsauxiliary space method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Recommendations

• BDDC preconditioners for continuous and discontinuous Galerkin methods using spectral/\(hp\) elements with variable local polynomial degree
• A unified analysis of balancing domain decomposition by constraints for discontinuous Galerkin discretizations
• Multilevel preconditioning of discontinuous Galerkin spectral element methods. I: Geometrically conforming meshes.
• Efficient preconditioning for the discontinuous Galerkin finite element method by low-order elements
• A class of domain decomposition preconditioners for \(hp\)-discontinuous Galerkin finite element methods

Cited in

(2)

• Robust preconditioners for DG-discretizations with arbitrary polynomial degrees
• BDDC preconditioners for continuous and discontinuous Galerkin methods using spectral/\(hp\) elements with variable local polynomial degree

This page was built for publication: ASM-BDDC preconditioners with variable polynomial degree for CG- and DG-SEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133666)