𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local discretization error bounds using interval boundary element method

✍ Scribed by B. F. Zalewski; R. L. Mullen

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
477 KB
Volume
78
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper, a method to account for the point‐wise discretization error in the solution for boundary element method is developed. Interval methods are used to enclose the boundary integral equation and a sharp parametric solver for the interval linear system of equations is presented. The developed method does not assume any special properties besides the Laplace equation being a linear elliptic partial differential equation whose Green's function for an isotropic media is known. Numerical results are presented showing the guarantee of the bounds on the solution as well as the convergence of the discretization error. Copyright Β© 2008 John Wiley & Sons, Ltd.

πŸ“œ SIMILAR VOLUMES

Approximation of Navier–Stokes incompres
Approximation of Navier–Stokes incompressible flow using a spectral element method with a local discretization in spectral space
✍ Kelly Black πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 211 KB πŸ‘ 2 views

A spectral element technique is examined, which builds upon a local discretization within the spectral space. To approximate a given system of equations the domain is subdivided into nonoverlapping quadrilateral elements, and within each element a discretization is found in the spectral space. The d

Stokes flow around cylinders in a bounde
Stokes flow around cylinders in a bounded two-dimensional domain using multipole-accelerated boundary element methods
✍ A. A. Mammoli; M. S. Ingber πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 217 KB πŸ‘ 1 views

The multipole technique has recently received attention in the ΓΏeld of boundary element analysis as a means of reducing the order of data storage and calculation time requirements from O(N 2 ) (iterative solvers) or O(N 3 ) (gaussian elimination) to O(N log N ) or O(N ), where N is the number of nod