1. Introduction
This article is dedicated to the development of a new iterative extensions method for the analysis of stationary physical systems [
1,
2,
3,
4,
5,
6]. The numerical solution of the biharmonic equation and similar ones, even in a square region, under the main boundary conditions has not been sufficiently mastered, and there are difficulties in solving such problems. The solution of shielded Poisson and Sophie Germain equations is considered with a mandatory presence of the Dirichlet boundary condition. Developing a method that is asymptotically optimal in terms of computational costs for solving such problems is challenging [
7]. For the screened Poisson equation, such a method was obtained in [
8]. This method was quite complicated, not universal, and was not developed, for example, in [
9,
10,
11]. The work reported in [
8] provides a more detailed overview of the fundamental works on the developed methodology. It is worth noting that there are a large number of approaches to solving the problems under consideration, which are not listed here. This work has a highly specialized focus on the used methodology. We can say that a new development of fictitious domain methods is proposed, for example, as in [
8,
12]. The considered problems have both differences and common properties. To illustrate this, it is necessary to present their classical and generalized formulations simultaneously.
Firstly, this article is devoted to the development of a new method of iterative extensions for the analysis of the screened biharmonic system [
13]. A shielded biharmonic system is a mixed boundary problem for the shielded Sophie Germain equation.
where Ω is a bounded domain in the plane with a piecewise-smooth boundary, and
is the external normal to
.
The previous boundary problem can be formulated as the representation of a linear functional in the form of a scalar product:
where the space of Sobolev functions is
and the scalar product is
If
—is a given function, then the linear functional is
Secondly, this article is devoted to the development of a new method of iterative extensions for the analysis of the screened harmonic system [
14]—a mixed boundary value problem for the screened Poisson equation in the three-dimensional case:
where
,
,
—is a limited region in three-dimensional space with a piecewise smooth boundary, and
is the outer normal to
.
We can formulate the previous boundary value problem as the problem of representing a linear functional in the form of a scalar product:
where the Sobolev space is
and the scalar product is
and if
is the given function, then the linear functional is
Due to the universality of the formulations of the above problems, universal methods for solving them are being developed. In the method of iterative extensions, the computational costs are asymptotically optimal, i.e., the number of operations is of the order of the number of unknowns in the resulting systems of linear algebraic equations, if at each step of the applied iterative processes, known marching methods are used, for example, from [
1].
2. Analysis of Shielded Biharmonic System
Let us consider the shielded biharmonic system in a variational form:
where the right-hand side of the problem, if
is a given function, is given as
where the space of Sobolev functions is
on a flat, bounded domain
with a boundary:
and
is the external normal to
, and the scalar product is
where coefficient
and coefficient
. When considering
, the solved problem of the shielded biharmonic system is examined. When considering
, a fictitious problem of the shielded biharmonic system is examined.
The extended shielded biharmonic system is provided as follows:
where the extended solution space of the considered extended problem is the Sobolev space:
and the regions
are such that
and the boundary of the region
also consists of the closure of the unions of open non-intersecting parts.
And the non-empty intersection of the boundary of the first region and the boundary of the second region is the closure of the intersection of the corresponding parts of the boundaries of these regions:
where
is the external normal to
.
The extended solution space contains a subspace of solutions for the extended problem.
Arbitrary projection operators from the extended space to the subspace of solutions for the extended problem are used in the extended problem:
The extended shielded biharmonic system is considered in a finite-dimensional subspace of the Sobolev space. Parabolic finite elements are used for approximation. The discretization of the extended shielded biharmonic system is analyzed when
A grid is defined in a rectangular domain with nodes:
Grid functions are introduced on the set of nodes of the introduced grid:
Grid functions are completed using parabolic basis functions.
It is assumed that the basis functions outside the rectangular domain are zero.
Linear combinations of basis functions are used, which define a finite-dimensional subspace in the extended solution space:
The extended system is considered in Euclidean space. After approximation, the extended system problem is formulated in matrix form as a system of linear algebraic equations. When approximating the problem for the extended system using a finite-dimensional subspace, a system of equations is obtained.
It is assumed that the projection operator on the solution space of the extended problem zeros the coefficients of the basis functions whose supports are not entirely contained in the first region. The extended system problem in matrix form is obtained by defining the extended matrix and the extended right-hand side of the system.
In this case, the first basis functions, whose supports are entirely contained in the first region, are numbered first. Then, the basis functions, whose supports intersect the boundary of the first region and the second region together, are numbered. The numbering ends with the basis functions, whose supports are entirely contained in the second region. With this numbering, the resulting vectors have the following form:
The matrix has a well-known structure:
The extended problem is solved in matrix form:
This solution is the matrix form of the original problem, and this is the zero solution of the fictitious problem in matrix form:
Matrices generated by scalar products are specified:
These matrices have the following structure:
A subspace of vectors is introduced:
Additionally, a subspace of vectors is defined:
An asymptotically optimal analysis of the extended system is carried out based on the iterative extensions method [
13]. For solving problem (7), a new iterative extensions method is used. The extended matrix is defined as the sum of the first matrix and the second matrix multiplied by a positive parameter.
It is assumed that the continuation conditions are satisfied.
The iterative extensions method is a generalization of the method of fictitious components, where additional parameters are used in choosing the extended matrix, and the iterative parameters are chosen based on the method of minimal residuals.
where, to calculate the iterative parameters, residuals, corrections equivalent to residuals are successively calculated.
A norm generated by the extended matrix is defined as
Theorem 1. For the iterative extensions method (8) in the analysis of the shielded biharmonic system, a convergence estimate holds: An algorithm implementing the iterative extensions method for solving the extended system problem in Euclidean space is presented. The method of minimal residuals is applied in choosing the iterative parameters [
15].
I. An initial approximation and an iterative parameter are chosen.
II. The residual is found.
III. The square of the norm of the absolute error is calculated.
IV. The correction is found.
V. The equivalent residual is found.
VI. The optimal value of the iterative parameter is found.
VII. The next approximation is found.
VIII. The termination criterion for iterations is checked with formulas based on a specified estimate of the relative error.
An example of solving problem (5) using the iterative extension method, when
is as follows:
and the boundaries of the regions have the following parts:
In this square area and an encircling stripe, a grid with nodes is defined:
With the right side expressed as follows:
The solution to the original problem has the following form:
When solving a problem on a computer, the estimate is given as
. The graphs of the last approximation and the exact solution almost coincide (
Figure 1).
3. Analysis of Shielded Harmonic System
Let us consider a screened harmonic system in the three-dimensional case in variational form:
where the Sobolev functions space is
on a flat bounded area
with a boundary given as
and the scalar product is
When , a solvable problem of a screened harmonic system in the three-dimensional case is considered. When , a fictitious problem of a screened harmonic system in the three-dimensional case is considered.
The extended harmonic system is
where the extended solution space of the extended problem considered is the Sobolev space
and the regions are
such that
,
, and the boundary of a region
also consists of the closure of unions of open disjoint areas:
and a non-empty intersection of boundaries of the first and second areas is the closure of the intersection of the corresponding parts of the boundaries of these areas:
The extended solution space contains a subspace of solutions to the extended problem
The extended problem uses arbitrary projecting operators of the extended space onto the subspace of solutions to the extended problem:
The extended screened harmonic system in a three-dimensional case is considered on a finite-dimensional subspace of the Sobolev space. The discretization of the extended harmonic system is analyzed when
A grid with nodes is defined in a rectangular area:
Grid functions are introduced:
The completion of grid functions with linear basis functions is applied.
The basis functions outside the rectangular region are considered to be zero:
Linear combinations of basis functions define a finite-dimensional subspace in the extended solution space.
The extended system is considered in Euclidean space. The approximated extended system problem is considered in matrix form as a system of linear algebraic equations. We approximate the problem for an extended system using a finite-dimensional subspace and obtain a system of equations.
Let us consider that the projection operator onto the solution space of the extended problem nullifies the coefficients of basis functions whose supports are not completely contained in the first domain. We obtain the extended system problem in matrix form if we define the extended matrix and the extended right-hand side of the system as follows:
In this case, the basis functions whose supports lie entirely in the first region are enumerated first. Then, the basis functions whose supports intersect the boundary of the first region and the second region together are enumerated. Finally, the basis functions whose supports lie entirely in the second region are enumerated. With this numbering, the resulting vectors have the following form:
The matrix has a well-known structure:
The extended problem is solved in matrix form:
The solution to the original problem in matrix form and the zero solution to the fictitious problem in matrix form are
The matrices generated by scalar products are defined as
These matrices have the following structure:
A subspace of vectors is introduced:
Additionally, a subspace of vectors is defined:
An asymptotically optimal analysis of the extended system is performed based on the method of iterative extensions [
13,
14]. To solve problem (11), a method of iterative extensions is applied. The extended matrix is defined as the sum of the first matrix and the second matrix, multiplied by a positive parameter.
It is assumed that the continuation provisions comply with the following:
The method of iterative extensions is a generalization of the fictitious domain method [
12], where additional parameters are used when choosing extended matrices, and the iterative parameters are selected with the method of minimal residuals [
15].
where, to calculate the iterative parameters, residuals, corrections, and equivalent residuals are sequentially calculated.
The norm generated by the extended matrix is
Theorem 2. For the method of iterative extensions (12) when analyzing a screened harmonic system in the three-dimensional case, the convergence is estimated as An algorithm for solving the problem of and extended system in Euclidean space is given. When choosing iterative parameters, the method of minimal residuals is used.
I. Start with the zero initial approximation.
II. Calculate the residual.
III. Calculate the value of the squared norm of the initial absolute error, which is preserved throughout all calculations.
IV. Calculate the correction.
V. Calculate the equivalent residual.
VI. Calculate the optimal value of the iterative parameter.
VII. Find the new approximation.
VIII. Check the iteration stop criterion for a given estimation of the relative error.
An example of solving problem (9) with the method of iterative extensions is given in the following domains:
with
The projected last approximation to the solution is displayed in
Figure 1 with the specified
and the evaluation criterion
. The red grid represents projected solution
and the blue surface represents the projected last approximation (
Figure 2).