𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On using the cell discretization algorithm for mixed-boundary value problems and domain decomposition

✍ Scribed by Howard Swann

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
276 KB
Volume
115
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

The cell discretization algorithm is used to approximate solutions to self-adjoint elliptic equations with general nonhomogeneous Dirichlet or Neumann or mixed-boundary values. Error estimates are obtained showing general convergence. This provides the framework for a nonoverlapping iterative algorithm for domain decomposition. The domain of a Dirichlet problem is partitioned into two subdomains. Solutions on the two subdomains can be patched together to form a solution to the original problem provided the solutions agree across the common interface of the subdomains and the normal derivatives there have equal absolute values and are opposite in sign. We generate such a solution by alternating between imposing Neumann and Dirichlet conditions on the interface, with boundary data adapted from the results of the previous approximation. A posteriori error estimates show that we have global convergence provided computed interface errors are su ciently small.

πŸ“œ SIMILAR VOLUMES

A Domain Decomposition Method Based on B
A Domain Decomposition Method Based on BEM and FEM for Linear Exterior Boundary Value Problems
✍ Gabriel N. Gatica; George C. Hsiao; Mario E. Mellado πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 137 KB

We develop the finite dimensional analysis of a new domain decomposition method for linear exterior boundary value problems arising in potential theory and heat conductivity. Our approach uses a Dirichlet-to-Neumann mapping to transform the exterior problem into an equivalent boundary value problem

Exponential convergence of the h–p versi
Exponential convergence of the h–p version BEM for mixed boundary value problems on polyhedrons
✍ H. Holm; M. Maischak; E. P. Stephan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 267 KB πŸ‘ 1 views

## Abstract We analyze the __h__–__p__ version of the boundary element method for the mixed Dirichlet–Neumann problems of the Laplacian in polyhedral domains. Based on a regularity analysis of the solution in countably normed spaces, we show that the boundary element Galerkin solution of the __h__–

On the Galerkin and collocation methods
On the Galerkin and collocation methods for two-point boundary value problems using sinc bases
✍ Adel Mohsen; Mohamed El-Gamel πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 272 KB

This paper presents a study of the performance of the collocation and Galerkin methods using sinc basis functions for solving linear and nonlinear second-order two-point boundary value problems. The two methods have the linear systems solved by the Q-R method and have the nonlinear systems solved by