Convergence rate estimate for a domain decomposition method
convergence ratedomain decomposition methodfinite elementiterative methodnonsymmetric and indefinite elliptic problemspreconditioned GMRES methodsubstructuring
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
We provide a convergence rate analysis for a variant of the domain decomposition method introduced by the second and the third author for solving the algebraic equations that arise from finite element discretization of nonsymmetric and indefinite elliptic problems with Dirichlet boundary conditions in \({\mathbb{R}}^ 2\). We show that the convergence rate of the preconditioned GMRES method is nearly optimal in the sense that the rate of convergence depends only logarithmically on the mesh size and the number of substructures, if the global coarse mesh is fine enough.
- A capacitance matrix method for Dirichlet problem on polygon region
- A Preconditioned GMRES Method for Nonsymmetric or Indefinite Problems
- An Observation Concerning Ritz-Galerkin Methods with Indefinite Bilinear Forms
- Domain Decomposition Algorithms for Indefinite Elliptic Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 4191031 (Why is no real title available?)
- scientific article; zbMATH DE number 4149498 (Why is no real title available?)
- scientific article; zbMATH DE number 4082901 (Why is no real title available?)
- scientific article; zbMATH DE number 4094729 (Why is no real title available?)
- scientific article; zbMATH DE number 3312898 (Why is no real title available?)
- scientific article; zbMATH DE number 4187060 (Why is no real title available?)
- On the Multi-Level Splitting of Finite Element Spaces for Indefinite Elliptic Boundary Value Problems
- Parallel Performance of Domain-Decomposed Preconditioned Krylov Methods for PDE<scp>s</scp>with Locally Uniform Refinement
- The Analysis of Multigrid Algorithms for Nonsymmetric and Indefinite Elliptic Problems
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Performance of fully coupled domain decomposition preconditioners for finite element transport/reaction simulations
- Domain decomposition like technique with H/h-independent rate of convergence
- A discrete domain decomposition method for acoustics with uniform exponential rate of convergence using non-local impedance operators
- On condition numbers of symmetric and nonsymmetric domain decomposition methods
- Large-scale stabilized FE computational analysis of nonlinear steady-state transport/reaction systems
- On domain decomposition algorithms for covolume methods for elliptic problems
- Convergence rate analysis of domain decomposition methods for obstacle problems
- Geometry Related Convergence Results for Domain Decomposition Algorithms
- Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition
- Convergence of the method of partition of regions for second-order elliptic conjugation problems
- scientific article; zbMATH DE number 1893680 (Why is no real title available?)
- scientific article; zbMATH DE number 766254 (Why is no real title available?)
- Finite element approximation of diffusion equations with convolution terms
- Convergence analysis of a domain decomposition paradigm
This page was built for publication: Convergence rate estimate for a domain decomposition method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803761)
