Ders notları İngilizce olarak yayımlanmaktadır.
Contents
The Boundary Element Method
The boundary element method (BEM) is a method for solving differential equations, especially partial differential equations, by discretizing only the boundary of the region. In two dimensions the boundary is a curve; in one dimension the boundary is just the two endpoints of an interval.
Most other numerical methods (finite differences FDM, finite elements FEM, finite volumes FVM, …) discretize the whole region: a grid or a mesh of elements covers the entire domain. The boundary element method discretizes only the boundary, so the resulting linear system is much smaller. This is the main advantage of the method.
Example. Consider the Laplace equation with mixed boundary conditions:
where . On the value is known and is unknown; on the flux is known and is unknown.
The steps of the method are:
- Transform the PDE in into an integral equation on the boundary .
- Discretize the boundary .
- Solve the integral equation on by discretizing it.
- The result is a linear system , where is the vector of unknown boundary values.
- Use the boundary values to obtain the solution at an interior point.
The tool behind the first step is the weighted residual method (WRM), a general way of finding approximate solutions of differential equations. The next sections develop it on simple examples.
Weighted Residual Methods
The residual
Example. Consider the initial value problem
If is the exact solution, then . If is only an approximate solution, the left-hand side is not zero:
Definition. Let be an approximate solution of a differential equation written in the form . The function obtained by substituting into the left-hand side is the residual of . It is identically zero exactly when solves the equation.
We want the residual to be as small as possible. Several methods make this precise. All of them start with an approximate form for the solution containing unknown coefficients. Here we take
There is no constant term because ; there is no linear term either, so every choice of satisfies the initial condition. Then
Each method below gives two equations for the two unknowns and .
1. The collocation method
Definition. In the collocation method we choose as many points in the region as there are unknown coefficients in , and require the residual to vanish at those points: .
Take and . Then
Solving these two equations gives
an approximate solution in the sense of collocation.
If we know the exact solution, we can check the difference. Here , and
so at , for example, is an approximate solution with accuracy about .
2. The method of moments
Definition. In the method of moments the weighting functions are the monomials : we require taking as many monomials as there are unknown coefficients.
With two unknowns we use and :
These give
and so
an approximate solution in the sense of the method of moments.
3. The Galerkin method
Definition. In the Galerkin method the weighting functions are the same functions that are used in the approximation. For these are and :
Solving the resulting system for gives
the approximate solution in the sense of Galerkin.
4. The subdomain method
Definition. In the subdomain method the region is divided into as many subintervals as there are unknown coefficients, and the integral of the residual over each subinterval is set to zero.
With the subintervals and :
which gives
in the sense of the subdomain method.
5. The method of least squares
Definition. In the method of least squares the coefficients are chosen to minimize , so the derivatives with respect to the coefficients vanish:
This gives
in the sense of least squares.
Summary. For , and :
| Method | ||
|---|---|---|
| Collocation () | ||
| Method of moments () | ||
| Galerkin () | ||
| Subdomain () | ||
| Least squares |
A boundary value problem
Example. Consider the boundary value problem
Take a cubic polynomial as the approximate solution:
The boundary conditions give and . Let , , . Then
The functions are the shape functions.
Galerkin method. The residual is
and we make it as small as possible in the sense of Galerkin, with the shape functions as weights:
This gives the system
so the approximate solution is
The exact solution is . Comparing:
| difference | |||
|---|---|---|---|
So is accurate with a tolerance of .
Exercise. Solve the differential equation
with and given at , using the Galerkin approach and the two-term approximation .
Galerkin Approximations in Two Dimensions
Example. Consider the Poisson problem on a rectangle:
where . (If , the boundary values are zero and by the maximum principle the only solution is .)
Let
which satisfies all the boundary conditions. Then
Thus the Laplacian of is
Galerkin approach. The weight is the trial function , and the weighted residual statement is
Evaluating the integrals,
so
Example. Alternatively, take a double sine series, which also satisfies the boundary conditions:
The Galerkin equation for each pair is
which gives
and
The coefficient is zero whenever or is even, since then or .
Natural Boundary Conditions
Integration identities
To handle natural boundary conditions we move derivatives from one function to another with the following identities.
1-D: integration by parts. On with boundary ,
where are integrable functions of .
2-D: Green's theorem. For a region with closed boundary ,
where are suitably defined differentiable and integrable functions.
3-D: the divergence theorem.
where
A natural boundary condition in one dimension
Example. Consider
Take the approximation
where satisfies the boundary condition, the are constants, and the are the shape (trial) functions, here polynomials. The trial functions must vanish on the part of the boundary where the Dirichlet boundary condition is given, i.e. at . Let
The weighted residual statement contains a domain residual and a boundary residual:
Galerkin approach: (weight function = shape function) and . Since at , the boundary term is needed only at :
Applying integration by parts to the first term,
The term at vanishes and the terms with cancel, so
The natural boundary condition now appears only on the right-hand side. Substituting ,
This is a linear system
where is a known vector and
Remark. We will use the Galerkin approach throughout the course.
The General Weighted Residual Statement
Suppose
where is a differential operator and is a boundary operator. For example,
Example. The Laplace equation
has this form with
Let . The residuals are
The weighted residual statement in general takes one of two forms:
where and are weight functions.
Form (1) with Galerkin weights gives
that is, with
Form (2) with and (taking ) gives
The terms multiplying form the matrix and the terms with and form the vector: with
The BEM for the Laplace and Poisson Equations
Consider
Definition. A boundary condition prescribing the value of the unknown function, , is a forced (essential, Dirichlet) boundary condition. A boundary condition prescribing the normal derivative, , is a natural (Neumann) boundary condition.
Let be the exact solution (assume it is not available) and an approximate solution, with . Then the residuals are
We use the Galerkin method to make the residuals as small as possible. The weighted residual statement is
with the boundary weights
Substituting the residuals:
Theorem (Green's identity). In two dimensions this follows from Green's theorem.
With , :
Apply Green's identity again, now with , :
On the terms with cancel, and on the terms with cancel. Therefore
The last two integrals are on the boundary; the first two are on the domain, and we need to convert them or get rid of them.
- Take to get rid of . (Later we will use the DRBEM to handle this inhomogeneous term with a domain integral.)
- We still have the domain integral . To remove it, we choose so that acts like the Dirac delta function.
The Dirac delta function
Definition. For a point , the Dirac delta function (in some books written ) satisfies for and for , in such a way that where and .
Thus in the weighted residual statement the multiplier in the domain integral should be like the Dirac delta function:
where is the source point (like in ) and is a general point, so is the position vector from the source point.
Back to the weighted residual statement with :
where is a constant: for a source point inside , and for a source point on a smooth part of the boundary (in one dimension, at an endpoint).
Fundamental Solutions
Definition. A weight function satisfying is a fundamental solution of the Laplace equation with source point .
For the Laplace equation the fundamental solutions are:
where is the Heaviside function.
Definition. The Heaviside function is
Deriving the fundamental solutions
Away from the source point, satisfies the Laplace equation, and by symmetry it depends only on the distance .
2-D. The Laplacian in cylindrical coordinates is
Assume the axisymmetric case, so only varies:
3-D. Use spherical coordinates, with the angle from the -axis and the angle in the -plane:
Assuming axisymmetry we have only the variable :
Computing the constants. Take a simple domain around the point : an interval of length in 1-D, a disc of radius in 2-D, a ball of radius in 3-D. Integrating over ,
Apply the divergence theorem:
On the normal derivative is evaluated at , which is constant, so the integral is this value times the size of .
- In 3-D: and the sphere has area , so , i.e. .
- In 2-D: and the circle has length , so , i.e. .
- In 1-D: , and the two endpoints contribute , so .
In both 2-D and 3-D the fundamental solutions are, up to a constant,
and is taken from the boundary condition on .
A One-Dimensional Example
Example. Consider the (well-defined) problem
Find and for .
In one dimension the boundary consists of the endpoints and , and the outward normal derivative is at and at . Thus is given at , is given at , and the unknowns are and , the normal derivative at . The weighted residual statement becomes
with at and , and inside. Substitute :
Then
that is,
Since
we get, with the Kronecker delta,
At (, ):
At ():
Inside ():
This is the exact solution: , , . The value is the outward normal derivative at .
Flashcards
One card for every definition in these notes. Tap or click a card (or press the space bar) to see the definition; use the arrows to move between cards.
Boundary element method (BEM)
A method for solving differential equations, especially PDEs, that discretizes only the boundary of the region instead of the whole domain, which gives a smaller linear system.
Residual
The function obtained by substituting an approximate solution into the left-hand side of the equation written as , e.g. for . It is zero exactly when solves the equation.
Collocation method
Choose as many points as there are unknown coefficients and require the residual to vanish there: .
Method of moments
Use the monomials as weighting functions: , one equation per unknown coefficient.
Galerkin method
Use the same functions that appear in the approximation (the shape functions) as weighting functions: for each shape function .
Subdomain method
Divide the region into as many subintervals as there are unknown coefficients and set the integral of the residual over each subinterval to zero.
Method of least squares
Choose the coefficients to minimize , i.e. set for each coefficient .
Forced (Dirichlet) and natural (Neumann) boundary conditions
A forced (essential, Dirichlet) condition prescribes the function, ; a natural (Neumann) condition prescribes the normal derivative, .
Dirac delta function
Zero for and infinite at , so that if and if .
Fundamental solution of the Laplace equation
A weight function with : in 1-D, in 2-D, in 3-D.
Heaviside function
for and for .