Lower bounds for additive Schwarz methods with mortars

DOI10.1016/J.CRMA.2004.09.016zbMath1061.65137OpenAlexW1987002053MaRDI QIDQ1763500

Dan Stefanica

Publication date: 22 February 2005

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2004.09.016

zbMATH Keywords

condition numberelliptic problemslower boundsmortar finite elementsoverlapping additive Schwarz algorithms

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites Work

• Unnamed Item
• Domain Decomposition Algorithms with Small Overlap
• A Mortar Finite Element Method Using Dual Spaces for the Lagrange Multiplier
• Lower Bounds for Two-Level Additive Schwarz Preconditioners with Small Overlap
• Two‐Level Schwarz Algorithms with Overlapping Subregions for Mortar Finite Elements

This page was built for publication: Lower bounds for additive Schwarz methods with mortars