On using the cell discretization algorithm for mixed-boundary value problems and domain decomposition
DOI10.1016/S0377-0427(99)00186-7zbMath0947.65118OpenAlexW2068585048MaRDI QIDQ1971851
Publication date: 12 November 2000
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(99)00186-7
convergenceerror estimatescollocationmixed boundary value problemsselfadjoint elliptic equationscell discretization algorithmdomain decompositions
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- The p- and h-p versions of the finite element method. An overview
- Error estimates for the combined h and p versions of the finite element method
- Analysis of a nonoverlapping domain decomposition method for elliptic partial differential equations
- An Iterative Procedure with Interface Relaxation for Domain Decomposition Methods
- The Cell Discretization Algorithm for Elliptic Partial Differential Equations
- Primal Hybrid Finite Element Methods for 2nd Order Elliptic Equations
- On the Use of Lagrange Multipliers in Domain Decomposition for Solving Elliptic Problems
- A parallel iterative nonoverlapping domain decomposition procedure for elliptic problems
- On the Convergence Rate of the Cell Discretization Algorithm for Solving Elliptic Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On using the cell discretization algorithm for mixed-boundary value problems and domain decomposition
