Next Article in Journal
Preventive Maintenance of k-out-of-n System with Dependent Failures
Previous Article in Journal
Impulsive Control of Some Types of Nonlinear Systems Using a Set of Uncertain Control Matrices
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

A Review of Mathematical Models of Elasticity Theory Based on the Methods of Iterative Factorizations and Fictitious Components

1
Department of Mathematical and Computer Modeling, Institute of Natural Sciences and Mathematics, South Ural State University, 76 Prospekt Lenina, 454080 Chelyabinsk, Russia
2
Department of Automotive Engineering, Institute of Engineering and Technology, South Ural State University, 76 Prospekt Lenina, 454080 Chelyabinsk, Russia
3
Department of Digital Economy and Information Technology, School of Economics and Management, South Ural State University, 76 Prospekt Lenina, 454080 Chelyabinsk, Russia
4
Department of Energy and Power Engineering, Institute of Engineering and Technology, South Ural State University, 76 Prospekt Lenina, 454080 Chelyabinsk, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(2), 420; https://doi.org/10.3390/math11020420
Submission received: 4 December 2022 / Revised: 10 January 2023 / Accepted: 11 January 2023 / Published: 13 January 2023
(This article belongs to the Section Dynamical Systems)

Abstract

:
This review analyzes articles on mathematical modeling of elasticity theory using iterative factorizations and fictitious components. To carry out this study, various methods are developed, for example, an approximate analytical method of iterative factorizations for calculating the displacements of a rectangular plate, and a modified method of fictitious components for calculating the continuous displacement of plates. The performed calculations confirm the effectiveness of these methods. Descriptions of solutions to problems of elasticity theory and possible applications of the considered mathematical models and methods are given. An overview of the methods used to solve these problems is given. Particular attention is paid to problematic issues that arise in solving these problems. Techniques used to reduce complex problems to the solution of simple problems are given, for example, the lowering of the order of differential equations and the reduction of solutions in complex domains to solutions in a simple domain. For the first approach, iterative factorization methods are often used, and for the second, methods of the fictitious component type are often used. The main presentation in this review is focused on the approximate solution of elliptic boundary value problems. The works considered in the review raise questions about the development of methods in research on fictitious domains, fictitious components, and iterative factorizations.

1. Introduction

Various physical phenomena in nature and technology, in areas such as hydrodynamics, mechanics, heat engineering, and electrical engineering, can be described by mathematical models derived from partial differential equations. or instance, stationary or steady processes are often modeled using elliptic equations of the second and fourth orders. The Poisson equation models, for example, describe the movement of membranes under the influence of applied pressure.
The numerical solution of the biharmonic equation and similar ones, even in a square region, under the main boundary conditions is not sufficiently mastered, and there are difficulties in solving such problems.
This review is devoted to solving problems of the following mathematical models.
  • − The mathematical model of the displacement of the points of a rectangular membrane on an elastic base, under the action of pressure, fixed on two adjacent sides:
Δ u + κ u = f   in   Ω ,   u | Γ 1 = 0     u n | Γ 2 = 0
where Ω is the rectangular area Ω = ( 0 ; b 1 ) × ( 0 ; b 2 ) , with a border Ω = s ¯ , s = Γ 1 Γ 2 , Ω = s ¯ , s = Γ 1 Γ 2 , Γ 1 = { b 1 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { b 2 } , Γ 2 = { 0 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { 0 } , n is outward normal to Ω , P is pressure, K 0 is the coefficient of rigidity of the elastic foundation, T is membrane tension factor, u is the desired displacement, κ = K / T , and f = P / T .
  • − The mathematical model of the displacement of the points of a rectangular plate on an elastic foundation under the action of pressures, where on two adjacent sides there are homogeneous conditions of hinged support, and on the other two sides there are homogeneous symmetry conditions:
Δ 2 u + a u = f   in   Ω ,   u | Γ 1 = Δ u | Γ 1 = 0 ,   u n | Γ 2 = Δ u n | Γ 2 = 0
where Ω is the rectangular area Ω = ( 0 ; b 1 ) × ( 0 ; b 2 ) , with a border Ω = s ¯ , s = Γ 1 Γ 2 , Γ 1 = { b 1 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { b 2 } , Γ 2 = { 0 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { 0 } , n is outward normal to Ω , wherein a = a 1 0 in the area of Ω 1 , a = a 2 0 in Ω \ Ω 1 , areas Ω 1 , Ω 2 : Ω ¯ = Ω ¯ 1 Ω ¯ 2 , Ω 1 Ω 2 = , Ω 1 Ω 2 , P is pressure, K is the coefficient of the rigidity of the elastic foundation ( K = 0 in the absence of an elastic foundation), D = E h 3 / ( 12 ( 1 σ 2 ) ) is the plate cylindrical stiffness, h is the plate thickness, E is Young’s modulus (tensile modulus), σ ( 0 ; 1 ) is Poisson’s ratio, u is the desired displacement, a = K / D .
  • − The mathematical model of the displacement of the points of a plate on an elastic foundation under the action of pressures, where uniform conditions of rigid embedding, hinged support, symmetry, and free support are set on the corresponding edges
Δ 2 u + a u = f   in   Ω
u | Γ 0 = u n | Γ 0 = 0 ,   u | Γ 1 = l 1 u | Γ 1 = 0
u n | Γ 2 = l 2 u | Γ 2 = 0 ,   l 1 u | Γ 3 = l 2 u | Γ 3 = 0
where
l 1 u = Δ u + ( 1 σ ) n 1 n 2 u x y n 2 2 u x x n 1 2 u y y
l 2 u = Δ u n + ( 1 σ ) s ( n 1 n 2 ( u y y u x x ) + ( n 1 2 n 2 2 ) u x y )
n 1 = cos ( n , x ) , n 2 = cos ( n , y )
Ω is a bounded flat area with piecewise smooth class boundary C 2 without self-intersections and self-contacts
Ω = s ¯ , s = Γ 0 Γ 1 Γ 2 Γ 3 ,   Γ i Γ j =   if   i , j = 0 , 1 , 2 , 3
Γ i , i = 0 , 1 , 2 , 3 is the union of a finite number of disjoint, open subsets of the boundary Ω from arcs of smooth curves of the class C 2 , n is outward normal to Ω , P is pressure, K is the coefficient of the rigidity of the elastic foundation ( K = 0 in the absence of an elastic foundation), D = E h 3 / ( 12 ( 1 σ 2 ) ) is the plate cylindrical stiffness, h is the plate thickness, E is Young’s modulus (tensile modulus), σ ( 0 ; 1 ) is Poisson’s ratio, u is the desired displacement, a = K / D .
In this paper, we review the solutions for the mathematical models of the theory of elasticity based on the methods of iterative factorizations, fictitious components and other methods.

2. Main Results

2.1. The Poisson and the Sophie Germain-Lagrange Equations

The Poisson equation models the displacement of membranes under pressure, with the potentials of electrostatic fields depending on the density of static charges, stationary temperature distributions from heat sources, fluid flow rates, etc. These models have been studied, for example, in the following papers [1,2,3]. The screened Poisson equation models the movement of membranes under the action of pressures in the presence of elastic foundations [2,4,5].
The Poisson equation is an elliptic partial differential equation. This equation looks like:
Δ φ = f ,
where Δ is the Laplace operator, or Laplacian, and f is a real or complex function on some manifold.
In a three-dimensional Cartesian coordinate system, the equation takes the form:
( 2 x 2 + 2 y 2 + 2 z 2 ) φ ( x , y , z ) = f ( x , y , z ) .
In the Cartesian coordinate system, the Laplace operator is written in the form 2 and the Poisson equation becomes:
2 φ = f .
A mathematical model of the displacements of a rectangular membrane in a variational form is considered. This is a variational problem, a generalized mathematical model of the movement of a rectangular membrane on an elastic foundation under mixed boundary conditions
u W : A ( u , v ) = g ( v ) v W , g W ,
where W the Sobolev function space
W = W ( Ω ) = { v W 2 1 ( Ω ) : v | Γ 1 = 0 }
on a rectangular area
Ω = ( 0 ; b 1 ) × ( 0 ; b 2 )   c   Γ 1 = { b 1 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { b 2 }
A ( u , ν ) is the bilinear form
A ( u , v ) = Ω ( u x v x + u y v y + κ u v ) d Ω
and given the constants b 1 , b 2 > 0 , κ 0 .
Based on [4,6,7], a solution to each problem in (4) exists and is unique if g ( v ) = Ω f v d Ω ,   Γ 2 = { 0 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { 0 } , where f is given, u is the desired function.
In the theory of elasticity, the Sophie Germain-Lagrange equation is a biharmonic equation that is used in the mathematical modeling of pressure plate movements. Similar equations form the basis of mathematical models of displacements of plates under pressure on elastic foundations. Such models were studied, for example, in [2,5,8]. A homogeneous biharmonic equation with inhomogeneous boundary conditions is used in the mathematical modeling of plane problems in the theory of elasticity.
It is customary to call thin plates structural elements in which one dimension (thickness) is significantly less than the other two characteristic dimensions (the length of the sides of the plate). The transverse load q ( x , y ) causes the plate to bend, which is accompanied by the appearance of transverse displacements or deflections w . In most cases, the problem of calculating plates during bending is reduced to determining deflections when the corresponding boundary (boundary) conditions are met.
In the theory of elasticity, the Sophie Germain–Lagrange equation is used in the mathematical modeling of plate displacement under pressure. This equation in the Cartesian coordinate system has the following form:
D 2 2 w ( x , y ) = q ( x , y ) ,
or
D ( 4 w x 4 + 4 w x 2 y 2 + 4 w y 4 ) = q ( x , y ) ,
where D is the bending stiffness of the plate.

2.2. Mathematical Models of Elasticity Theory

When considering various options for the given boundary conditions at the edges of the plates, a lot of mathematical models arise. These models often differ significantly in the methods of possible solutions. The complexity of solving problems arising in these models can also be different. Addressing such issues can be reduced to solving problems, for example, arising in mathematical models of hydrodynamics and nonlinear models of the theory of elasticity [2,9].
Let us note the mathematical models of the displacements of rectangular membranes, with and without an elastic base fixed on two adjacent sides under the action of pressures. The models are built on the basis of the Poisson equations and the screened Poisson equation in a rectangular domain, where the main homogeneous boundary condition is set on two adjacent sides, and the natural homogeneous boundary condition is satisfied on the other two sides. Note that the solution to each problem from the indicated boundary value problem is unique [4,6].
We also note the mathematical model of the displacements of a rectangular plate on an elastic foundation under the action of pressures, where on two adjacent sides there are homogeneous conditions for hinged support, and on the other two sides there are homogeneous symmetry conditions. This is a fourth-order elliptic equation in a rectangular region, where the first main homogeneous boundary condition is set on two adjacent sides and the second main homogeneous boundary condition is set on the other two sides, and the other corresponding boundary conditions are naturally homogeneous. This mathematical model of the displacements of a rectangular plate is considered in a variational form, a generalized mathematical model of the displacement of a rectangular plate on an elastic foundation under mixed boundary conditions
u V : Λ ( u , v ) = g ( v ) v V , g V ,
where V is the Sobolev function space
V = V ( Ω ) = { v W 2 2 ( Ω ) : v | Γ 1 = 0 , v n | Γ 2 = 0 }
in the region Ω = ( 0 ; b 1 ) × ( 0 ; b 2 ) with border Ω = s ¯ , s = , Γ 1 Γ 2 , Γ 1 = { b 1 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { b 2 } , Γ 2 = { 0 } × ( 0 ; b 2 ) ( 0 ; b 1 ) × { 0 } , n is outward normal to Ω , bilinear form
Λ ( u , v ) = Ω ( σ Δ u Δ v + ( 1 σ ) ( u x x v x x + 2 u x y v x y + u y y v y y ) + a u v ) d Ω ,
where in a = a 1 in the region Ω 1 , a = a 2 in Ω \ Ω 1 , areas Ω 1 , Ω 2 : Ω ¯ = Ω ¯ 1 Ω ¯ 2 , Ω 1 Ω 2 = , Ω 1 Ω 2 , given constants, σ ( 0 ; 1 ) , b 1 ` , b 2 ( 0 ; + ) , a 1 ` , a 2 [ 0 ; + ) .
It can be noted [4,6] that
c 1 , c 2 ( 0 ; + ) : c 1 v W 2 2 ( Ω ) 2 Λ ( v , v ) c 2 v W 2 2 ( Ω ) 2 v V
and, consequently, a solution to problem (5) exists and is unique [4,6].
If f is a given and u is a desired, sufficiently smooth functions, and
g ( v ) = ( f , v ) ,   where   ( f , v ) = f v d Ω
then problem (5) yields a fourth-order elliptic equation under mixed and homogeneous boundary conditions
Δ 2 u + a u = f , u | Γ 1 = Δ u | Γ 1 = 0 , u n | Γ 2 = 0 .
The question of the existence and uniqueness of a solution to such a problem was considered by Zh.P. Aubin [6], L.A. Oganesyan, L.A. Rukhovets [4] and others.
Of interest are mathematical models of the displacements of plates on elastic foundations under the action of pressures, where uniform conditions of rigid embedding, hinged support, symmetry, and free support are set on the corresponding edges. These models are described by fourth-order elliptic equations in bounded domains, on a plane under the corresponding boundary conditions of these four types and their various combinations [4,6,10]. Boundary value problems are considered under the usual assumptions that ensure the existence and uniqueness of a solution for each problem.
A mathematical model of plate displacements in a variational form is considered. This is a generalized mathematical model of plate displacements on an elastic foundation under homogeneous mixed boundary conditions, i.e., homogeneous conditions of rigid attachment, hinged support, symmetry, and free support
u H :   Λ ( u , ν ) = g ( ν )   ν H ,   g H ,
where u is the desired function; H is the Sobolev function space
H = H ( Ω ) = { v W 2 2 ( Ω ) : v | Γ 0 Γ 1 = 0 , v n | Γ 0 Γ 2 = 0 }
on a limited flat area Ω with piecewise-smooth class boundaries without self-intersections and self-tangency
Ω = s ¯ , s = Γ 0 Γ 1 Γ 2 Γ 3
Γ i Γ j =   if   i j ,   i , j = 0 , 1 , 2 , 3
Γ i , i = 0 , 1 , 2 , 3 is the union of a finite number of disjoint, open subsets of boundaries Ω from arcs of smooth curves of the class C 2 , n is outward normal to Ω , and bilinear forms with constants a [ 0 ; + ) , σ ( 0 ; 1 ) :
Λ ( u , v ) = Ω ( σ Δ u Δ v + ( 1 σ ) ( u x x v x x + 2 u x y v x y + u y y v y y ) + a u v ) d Ω
For problem (6), the assumptions ensuring the existence and uniqueness of its solution to the problem are quite common, e.g., [4,6],
c 1 , c 2 ( 0 ; + ) : c 1 v W 2 2 ( Ω ) 2 Λ ( v , v ) c 2 v W 2 2 ( Ω ) 2 v H
In the research, reductions of mathematical models in a variational form to mathematical models in a discrete form are used, which preserves the properties of the original models at the difference level based on the finite elements [11,12,13,14,15,16,17].
The construction of optimal, almost optimal, or logarithmically optimal methods, in terms of the number of arithmetic operations for finding solutions with predetermined sufficiently small errors, becomes much more complicated with an increase in the orders of the equations [18]. The numerical solution of the biharmonic equation and similar ones, even in the square region under the main boundary conditions, has not been studied in sufficient detail [19]. Approaches based on the reduction of the solutions to boundary value problems to the minimization of the corresponding functionals obtain practically effective numerical methods [20]. Despite the linear nature of the biharmonic equation, the integration of these problems causes a number of difficulties [21]. However, the numerical solutions of even more complex problems can be reduced to the numerical solution of problems such as those arising in nonlinear models of the theory of elasticity.
Given that these fourth-order problems are recognized as problematic and new approaches are required to solve them, building efficient and programmable methods for calculating the displacements of membranes and plates on elastic foundations under various homogeneous boundary conditions, is required. Efficient and programmable methods are understood as methods that are asymptotically optimal, almost optimal, or logarithmically optimal in terms of the number of arithmetic operations needed to solve them [18].
In this work, the mathematical modeling of membrane and plate displacements is simply reduced to the numerical solutions of Poisson and Germain–Lagrange type equations and, ultimately, to solutions of simple systems of linear algebraic equations with triangular matrices that have no more than three non-zero elements in each line [22,23].
For the reduction of complex problems in mathematical physics, these are usually reduced to algebraic equations of a certain structure [14].
While maintaining a logically simple research methodology, when problematic tasks are considered that require new knowledge and approaches for their solution, research is placed in the area of formally more general tasks. These problems are then effectively solved based on the proposed iterative methods.
If statistical methods are better suited for very complex problems, numerical iterative methods for complex problems, and direct methods for simple problems, then for the problems under consideration it is preferable to build numerical iterative solution methods [24]. For the approximate solution of the difference and variational-difference analogues of the problems, iterative methods are often used, which occupy an intermediate position between direct and statistical methods.
There are methods for solving similar equations even on the basis of a statistical approach, for example, using the Monte Carlo method [25,26,27]. For elliptic equations, the Monte Carlo method is not optimal or logarithmically optimal in terms of the number of arithmetic operations [14,18]. However, obtaining analytical and practically acceptable direct solutions of such equations in the final form is impossible.
When solving these equations numerically, if using a system of linear algebraic equations with N unknowns variables, then in the direct Gauss method, an order of arithmetic operations N 3 is required to solve it. Such computational costs will not be economical, despite the rapid progress in computer technology [24]. The optimal number of arithmetic operations for solving such a problem is of the order of N. The asymptotic solution is optimal in terms of the number of arithmetic operations, since it is unimprovable [18].

2.3. Approximation of Step Functions in Problems of Mathematical Modeling

In the theory of elasticity, methods of approximating piecewise linear and generalized functions have been proposed for modeling jump processes [28,29,30,31,32,33]. These methods do not have the disadvantages inherent in expansions in a Fourier series. They are based on the use of trigonometric expressions, but in the form of recursive functions.
Let us take the following step function as an example, which will allow us to explain the main idea of the proposed approximation methods:
f 0 ( x ) = sign ( sin x )
We chose this function because it explains well the difference between the usual expansion of a function in a Fourier series and the approximation of a step function using the proposed method. The selected function is often used to illustrate the procedure for expanding a function using trigonometric series. Note that the expansion of functions into Fourier series has not only positive, but also negative features. We note, for example, the presence of the Gibbs effect, according to which, for a certain class of functions, the approximation error using Fourier series does not tend to zero with an increase in the number of terms in the expansion. The proposed approximation methods do not have the disadvantages of Fourier series, and are based on the expansion of the original function using recursive sequences of periodic trigonometric functions. For example, the approximation dependence of the selected step function (2.4) according to the proposed method has the form:
{ f n ( x ) |   f n ( x ) = sin ( ( π / 2 ) f n 1 ( x ) ) , f 1 ( x ) = sin x ; n 1 N } C [ π , π ]
The proposed procedure ensures fast convergence of the iterative sequence to the original function. In this case, the approximation error is small, even when using a relatively small number of iterations. It is important to note that the negative Gibbs effect is completely absent in the proposed approximation method.
The proposed approximating iterative method is characterized by some features that require additional explanation. Consider the approximating sequence (8) on the interval [ 0 , π / 2 ] , taking into account that periodic functions f n ( x ) and f 0 ( x ) with period 2 π are odd, and periodic functions f n ( x + π / 2 ) and f 0 ( x + π / 2 ) are even.
Consider a sequence of functions { f n ( x ) } L 2 [ 0 , π / 2 ] and the function f 0 ( x ) L 2 [ 0 , π / 2 ] . Because the functions f n ( x ) are bounded and monotonic on the segment [ 0 , π / 2 ] , we get sup n N   sup x [ 0 , π / 2 ] | f n ( x ) | = 1 < and sup n N Var 0 π / 2 f n = 1 < , therefore we can apply Helly’s theorem, according to which it is possible to select a subsequence from the sequence { f n ( x ) } that converges to some function f at each point [ 0 , π / 2 ] , so that, V a r 0 π / 2 f lim n _ _ _ V a r 0 π / 2 f n . It can be shown that the function f can be as such a function f 0 ( x ) .
Statement 1. 
There is a pointwise convergence of the sequence of functions f n ( x ) to the original function f 0 ( x ) , and this convergence is not uniform.
We can prove this statement.
In our case it is obvious that f n ( x ) f 0 ( x ) = 0 , n N at the points x = 0 and x = π / 2 . That is why, for these points we have f n ( x ) n f 0 ( x ) because ε > 0 n N n : n > n | f n ( x ) f 0 ( x ) | = 0 < ε . For instance, it is possible to have n = 1 .
We have sin x > ( 2 / π ) x , x ( 0 , π / 2 ) , therefore we get f n ( x ) = sin ( ( π / 2 ) f n 1 ( x ) ) > f n 1 ( x ) > > f 1 ( x ) > 0 that is right for any points from the interval x ( 0 ,   π / 2 ) . The sequence of functions f n ( x ) , x ( 0 , π / 2 ) is positive, increasing, and bounded. Therefore, for this sequence there is a finite limit. Let us denote the limit by lim n f n ( x ) = A R . So, we have
A = lim n sin ( ( π / 2 ) f n - 1 ( x ) ) = sin ( ( π / 2 ) lim n f n 1 ( x ) ) = sin ( ( π / 2 ) A )
Based on this expression, we can claim that A = 0 or A = 1 . We know that our sequence is positive and increasing. Therefore A = 1 = f 0 ( x ) , ∀x∈(0, π/ 2). Further, for this segment we have that f n ( x ) n f 0 ( x ) . Earlier, we noted the convergence of our sequence of functions at the points x = 0 and x = π / 2 . Therefore, we conclude that f n ( x ) n f 0 ( x ) , x [ 0 , π / 2 ] . Moreover, the proven convergence is only pointwise, but it is not uniform, since the original function f 0 ( x ) is not continuous on the considered segment [ 0 , π / 2 ] . Q.E.D.
Statement 2. 
There is a convergence of a sequence of approximating functions f n ( x ) in the norm to a given function f 0 ( x ) , if we consider the space of measurable functions  L 1 [ 0 , π / 2 ] and the Hilbert space  L 2 [ 0 , π / 2 ] .
We can prove this statement.
Consider the sequence of minorant functions with respect to the sequence of given functions f n ( x )
{ η n ( x ) | η n ( x ) = ( 2 / π ) arctg ( n π ) ; n N } C [ 0 , π / 2 ]
We can show that f n ( x ) η n ( x ) ,   n N , x [ 0 , π / 2 ] . It is not difficult to see that the set of discontinuity points of the original function f 0 ( x ) has a measure equal to zero. Given that the functions f n ( x ) and η n ( x ) are bounded and non-negative in the segment, then we consider we have in space L 1 [ 0 , π / 2 ] :
| | f 0 ( x ) f n ( x ) | | = 0 π / 2 ( 1 f n ( x ) ) dx 0 π / 2 ( 1 η n ( x ) ) dx = π 2 arctg π n 2 + 1 π n ln ( 1 + ( π n ) 2 / 4 )
Because lim n ( π 2 arctg π n 2 + 1 π n ln ( 1 + ( π n ) 2 / 4 ) ) = 0 , we have
| | f 0 ( x ) f n ( x ) | | n 0
In the same way, we can prove the convergence in the norm of a sequence of functions f n ( x ) to the initial function f 0 ( x ) in the Hilbert space L 2 [ 0 , π / 2 ] . Q.E.D.
We have shown that the sequence of approximating functions f n ( x ) is fundamental in the spaces L 1 [ π , π ] and L 2 [ π , π ] . Note that this sequence f n ( x ) is not fundamental in the space C [ π , π ] .
Let us call the function f 1 ( x ) initial or angular. With this function we do not use the sine, but some other, and not necessarily periodic, function. For example, using the iterative procedure (2) and fulfilling the conditions | f 1 ( x ) | < 2 , we have lim n f n ( x ) = s i g n ( f 1 ( x ) ) . It follows from this conclusion that any step function can be approximated using the proposed methods. For example, in the case of a step function
f ( x ) = { h , x ( x 1 , x 2 ) , 0 , x ( x 1 , x 2 )
the following can be chosen as the initial function f 1 ( x ) = exp ( 1 ( a x + b ) 2 ) 1 . Using the following condition f 1 ( x 1 ) = f 1 ( x 2 ) = 0 , we can find that a = 2 / ( x 1 x 2 ) ; b = ( x 1 + x 2 ) / ( x 2 x 1 ) . Taking the founded values of the coefficients a and b , we can write the sequence
{ f n ( x ) | f n ( x ) = ( h / 2 ) ( 1 + sin φ n ( x ) ) , φ n ( x ) = ( π / 2 ) sin φ n 1 , φ 1 ( x ) = ( π / 2 ) f 1 ( x ) , n 1 N }
which converges to the step function f ( x ) . Therefore, any step function with values h i within the segment ( x 1 i , x 2 i ) we can approximate using the sum of the sequences i = 1 k { f n ( x ) } i .
Statement 2 has a universal character and can be applied to the analytical approximation of any step function, since we can write an arbitrary periodic step function using a linear combination f ( x ) = i = 1 k h i · f 0 i ( x ) ,   h i R ,   and, if necessary, shifting in phase and along the y-axis the functions f 0 i ( x ) = sign ( sin ( l i x x i ) ) , l i , x i R .   Based on the statement 2, we can assert that in the spaces L 1 [ π , π ]   and L 2 [ π , π ] there is convergence f 0 i ( x ) f n i ( x ) n 0 , i , so the function f n ( x ) = i = 1 k h i · f n i ( x )   converges to the function f ( x ) in norm, because
f ( x ) f n ( x ) = i = 1 k h i · f 0 i ( x ) i = 1 k h i · f n i ( x )   i = 1 k | h i | · f 0 i ( x ) f n i ( x ) n 0 .
A review of these and other methods is given in [34].

2.4. Multigrid Methods for Solving the Biharmonic Equation

Increasing requirements for the accuracy of the results of mathematical modeling leads to an increase in the number of linear algebraic equations, the complication of their form and an increase in the number of arithmetic operations to solve them [24]. Consequently, there is a practical need for efficient, economical numerical methods that are optimal, or at least almost optimal in terms of computational costs.
Without presuming complete coverage of all methods for solving the biharmonic equation, some of the approaches currently being studied can be noted. There is an extensive literature where mathematical models are considered, which are usually based on partial differential equations of no higher than the second order, while the biharmonic equation is less common. There is also a desire for its effective solution [35]. Multigrid methods are often used [36]. Multigrid iterative algorithms are used for the discrete analogue [37].
There is a need for methods to reduce the order of the biharmonic equation [38]. Sorokin [39] reduces the solution of a biharmonic equation in a rectangle, when the conditions of hinge support are given on three sides, and the conditions of free support on the remaining side reduces to solving a sequence of problems for the same equation, but with boundary conditions of hinge support, which allow splitting the problem into two Dirichlet problems for the Poisson equation. When the problem is continued across the boundary, with natural boundary conditions in methods of the type of fictitious components, computational costs are usually optimal if the problems that arise at each step of the iterative process are optimally solved, as in this paper. Sorokin [40,41] also reduces the numerical solution of the biharmonic equation to the numerical solution of the Dirichlet problems for the Poisson equation. He proposed an iterative process for the numerical solution of the biharmonic equation in a rectangular domain, with principal boundary conditions on the boundary which is not logarithmically optimal [40].
There is a well-known approach that does not claim to be logarithmic optimality [42,43]. In these previous and subsequent works, a fourth-order elliptic boundary value problem in a domain is reduced to second-order elliptic problems in the same domain, solving some integral equation on the boundary of the domain. Karachik, Antropova [44,45,46] constructed polynomial solutions for the Dirichlet problem for a biharmonic equation in a ball. Potapov [47] uses the reduction of the solution of a biharmonic equation to the solution of a system of ordinary differential equations.
The number of works on this topic is increasing, and this indirectly indicates that the numerical solution of such problems has certain difficulties, and problems remain, i.e., their solutions require new approaches. The presence of a sufficiently large number of works on the solution of the Germain–Lagrange plate equation within the framework of possibly irrational logic indicates the importance of these areas of research.
The much larger number of works on the solution of the Poisson equation, which is often reduced to the solution of the biharmonic equation, may indicate both the advantages and possible shortcomings in the methods for solving it, and, consequently, the need for, and possibility of, their improvement.
For numerical solutions of elliptic boundary value problems of the second order in rectangular areas, there are direct methods that are optimal or logarithmically optimal in terms of the number of arithmetic operations [18,48,49,50,51,52,53,54,55]. Direct marching methods are optimal, but they can be numerically unstable to rounding errors in computer calculations [44,48,49,52]. Unfortunately, the issues of stability with respect to rounding errors for these methods are also quite acute [18].
In general cases, the equations of Poisson and Germain–Lagrange plates can hardly be optimally finally solved, given that these are not two problems, but a set of problems in different areas and under different boundary conditions. Therefore, questions arise about the possibility of a successful combination of efficiency and optimality in the number of arithmetic operations of the solution methods and the ease of their computation; the computational stability of the methods to rounding errors is assumed. There are already approaches for the error-free solution of systems of linear algebraic equations [56].
In the one-dimensional case, there are second-order elliptic equations, operators that factorize under certain boundary conditions, and their finite-difference analogs [14]. In the two-dimensional case, for second-order elliptic equations, the Buleev method of incomplete factorization was developed in [14,18,57,58,59,60,61]. This method has a comparable number of operations with the logarithmically optimal variants of the alternating directions method [14].
Novikov and Dynnikov discovered the complex factorization of the Laplace operator, together with its difference analogue on triangular grids, and pointed out the absence of factorization on commonly used rectangular grids [62,63,64]. However, the possibility of complex factorization when approximating the Laplace operator only on triangular grids was not known to the authors, which allowed them to obtain an iterative complex factorization when approximating the Laplace operator on rectangular grids [65,66] for the problems indicated in [67,68], and use it for their asymptotically optimal solution.
Factorized models in problems of mathematical physics were considered in [69,70]. Matsokin [71] implements the idea of factorization in the two-dimensional case of a difference operator that arises when approximating a fourth-order elliptic-type equation in a rectangle, on the boundary of which the hinged support conditions are specified. If, at each step of the iterative process in this paper, we apply not the logarithmically optimal direct method, as expected, but the method of iterative factorizations proposed in [65] for a problem with mixed boundary conditions, then we get a gain in the number of arithmetic operations.
When obtaining effective methods, the spectral, energy equivalence of operators obtained by approximating elliptic equations under certain boundary conditions by the finite element method and the finite difference method is often used [18,72,73,74,75,76]. Dyakonov [18] constructs a logarithmically optimal method for a model elliptic problem of the fourth order in a rectangle under the main boundary conditions. In this paper [18], basic model elliptic problems in a rectangle are considered under mixed boundary conditions, and these problems are asymptotically optimally solved in [18] based on iterative factorization methods [65,66,67,68].
For sufficiently arbitrary domains, methods for solving fourth-order elliptic equations are constructed. These methods are used to solve equations with basic boundary conditions. They are logarithmically optimal when continuing across the boundary, and asymptotically optimal when continuing the solution of the problem across the boundary with natural boundary conditions. The solutions obtained are modifications of the corresponding known methods using fictitious components. The finite element method is used for parabolic completions [6]. Margenov, Lazarov [77] performed work using parabolic splines for the numerical solution of fourth-order elliptic equations, where the computational cost is clearly not optimal.
A popular approach to solving elliptic equations is based on the Schwartz method [24,78,79,80,81,82,83]. The original problem is effectively reduced to a series of problems which are optimally solved for second-order equations by marching methods.
There are a large number of works on iterative solutions of fourth-order elliptic equations by Korneev, for example, [84]. A logarithmically optimal method is constructed for a fourth-order equation under natural boundary conditions, based on the methods of fictitious components and the fast discrete Fourier transform [85]. The methods of fictitious components are iterative processes for solving systems of difference and variational difference equations. The fast discrete Fourier transform [85] is an algorithm to accelerate the calculation of the discrete Fourier transform, which allows you to get the result in less than O(N2) time (required for direct, formula-by-formula calculation). For similar problems, the iterative factorization methods proposed in [65,66,67,68], in combination with the modified method of fictitious components, give asymptotically optimal methods.
The method of fictitious components was proposed, investigated and optimized, in theoretical terms, in [80,81,82,86,87,88,89,90,91,92]. The use of modifications of this technique [65,66,67,68] and the methods of iterative factorizations makes it possible to obtain numerical iterative methods that are efficient in terms of the number of arithmetic operations for calculating the displacements of plates.
The method of fictitious components was developed in [91], which used operators that give a norm-preserving extension of discrete functions. The method is asymptotically optimal in terms of the number of arithmetic operations if we use the iterative factorization methods proposed in [65], not the fast discrete Fourier transform. Thus, the methods of iterative factorizations can be more effectively used in combination with the fictitious space method for the numerical solution of elliptic boundary value problems of the second order, in arbitrary areas of complex geometric shape.
In [65,66,67], the main model problems of the second and fourth orders in a rectangular domain are considered, and new efficient methods for their solution are proposed. The proposed solutions are based on the special properties of these problems. In [65], unstable replacements for optimal marching methods are proposed. The works [52,55,56,59] describe efficient methods of iterative factorization. At the final stages in [93], the author proposes modifications of the methods proposed and developed in [78,79,80,81,82] for reducing solutions of fourth-order problems in arbitrary domains, to solving the indicated basic model problems in a rectangular domain. In a number of cases [93,94,95,96,97,98,99,100], for fourth-order equations under basic boundary conditions, in contrast to the second-order equations considered in [91], only logarithmic optimality takes place. This preserves the simple implementation of the methods. The difference is no longer inherent in the modifications of the methods used, but the last difference between optimality and almost optimality can be sacrificed for the sake of the simple practical implementation and automation of the application of numerical methods. In accordance with [14], under the natural assumption that the modulus of the logarithm of the relative error of the iterative process of the same order as the logarithm of the number of unknowns of the system of linear algebraic equations being solved, the iterative processes of fictitious component methods are transformed from asymptotically optimal methods into logarithmically optimal methods.

2.5. Modified Mathematical Models in the Theory of Elasticity

New approaches are completed by obtaining efficient numerical methods based on replacing the original mathematical models with their fictitious extensions. The theoretical results have been experimentally confirmed by calculations. One can note the revival of the direction of methods of fictitious regions, unknowns, and components and spaces in [100,101].
In [102], the stressed state of an eccentric ring made of an elastic material is studied. Loading is performed by concentrated forces symmetrically along the outer boundary. The Airy stress function written in bipolar coordinates was used. The elastic potential corresponding to a given load was considered for a compact disk in bipolar coordinates. An analytical expression of the elastic potential in a Fourier series was carried out. Boundary conditions were imposed by adding an auxiliary potential. The number of terms in the Fourier expansion is subject to significant change, depending on the final form of the total potential. The results were confirmed using finite element software, and using the photo-elastic method in experimental studies. The article investigated six loading options for two rings with different geometric dimensions, and all the analyzed cases are characterized by good convergence of analytical, numerical, and experimental results. Using analytical calculations, the effect of stress concentration on the inner hole was found. As the eccentricity of the inner hole decreases, the integrals describing the total elastic potential have decreasing convergence near the inner boundary.
To obtain a general solution to the plane problem of elasticity theory, the Airy stress function U ( x . y ) was found in the form of a biharmonic function, the property of which is expressed by the relation:
U ( x , y ) = 0 .
A particular solution of the problem was obtained by imposing boundary conditions. In this case, various possible cases were considered: taking into account only stresses, only displacements, or superimposed stresses on the one hand and superimposed displacements on the other. To obtain the values of stresses and displacements, the derivatives of the stress function were used. Stresses in Cartesian coordinates have the form:
σ x = 2 U y 2 ;   σ y = 2 U x 2 ;   τ x y = 2 U x y   ,  
and the displacements u and ν correspond to the dependencies:
λ θ + 2 μ u x = 2 U y 2 ;   λ θ + 2 μ v y = 2 U x 2   ,
where
θ = u x + v y  
is the bulk deformation and the coefficients λ and µ are the Lamé constants.
Under the given boundary conditions, the correct choice of the coordinate system is important for solving a partial differential equation; it should provide the simplest form of boundary curves. Ideally, the boundary curves should be the coordinate curves of the selected reference system.
In the case of a homogeneous isotropic elastic material, the boundaries of the eccentric ring are two non-concentric circles. In this case, the bipolar coordinate system is the most adequate. The description of the relationship between bipolar coordinates (α, β) and Cartesian coordinates (x, y) is given by any of the following systems:
x = a · sin β cos h α cos β ; y = a · sin h α cos h α cos β ;  
α + i β = ln x + i ( y + a ) x + i ( y a ) = ln z + i a z i a ;
  x 2 + ( y a tan h α ) 2 = ( a / sin h α ) 2 ;
  y 2 + ( x a tan β ) 2 = ( a / sin β ) 2 .  
The monograph [103] describes the main provisions of the theory of ill-posed abstract integro-differential equations, Volterra. This theory of linear integro-differential equations has received significant development, especially in the last 30 years. A significant part of the monograph refers to the study of various types of abstract multi-term fractions.
Similar with the previous monograph, the work [104] is devoted to the study of the theory of abstract Volterra equations. As noted earlier, this theory has been rapidly developing over the past three decades. Basically, such interest in this theory is explained by its wide applications to problems of mathematical physics. One can note the applications of that theory in such areas as viscoelasticity, thermal conductivity in materials with memory, electrodynamics, and others. The theory of abstract Volterra equations provides useful methods and tools for solving problems that arise in these areas. The monograph [104] describes a significant number of interesting phenomena that are not detected using differential equations, but are observed on specific examples of the Volterra equations. This makes it possible to improve research to improve the understanding of real phenomena, a more accurate reflection of reality. At present, there are several monographs devoted to the development of research into the Volterra equations. These monographs do not consider linear problems in infinite dimensions. The noted monograph [104] closes this shortcoming. The purpose of the monograph is to systematically and completely describe the linear theory in its current state. The monograph reflects relevant results in the field of abstract Volterra equations and their wide applications. In addition, this monograph notes a number of problems in linear theory that have not yet found their solution and require their detailed consideration.

3. Conclusions

The review of the methods of the mathematical modeling of the theory of elasticity revealed that effective methods have now been built for calculating the displacements of rectangular membranes and plates under the specified boundary conditions. Calculations of plate displacements with the help of modifications of the fictitious component method are effectively reduced to the solutions of the previously mentioned problems in rectangular domains.
This review presents an analysis of articles and a description of recent research in the field of mathematical modeling of problems and processes of elasticity theory using iterative factorizations and fictitious components. To carry out the noted studies, various methods have been developed, which are noted in the review. One can specify, for example, an approximate analytical method of iterative factorizations for calculating displacements of a rectangular plate, a modified method of fictitious components for calculating continuous displacements of plates, efficient numerical methods of iterative factorizations for calculating displacements of rectangular membranes, and other methods. Computer implementation of the algorithms of these methods has confirmed their effectiveness. Particular attention is paid to problematic issues that arise in solving problems of the theory of elasticity. The presented review includes research on the development of methods for reducing the solution of complex problems to solving simple problems. As an example, we can cite methods for lowering the order of differential equations and reducing solutions in complex domains, to solutions in a simple domain using iterative factorization methods and fictitious component methods.
Numerical methods have been developed for calculating the displacements of rectangular membranes and plates under the indicated mixed boundary conditions, and are effective in terms of the number of computational operations.
When modifying the fictitious component method, numerical methods for calculating the displacements of plates are constructed, which are logarithmically optimal for rigid mounting and asymptotically optimal for free support in terms of the number of arithmetic operations.
Based on the results of the mathematical modeling, computer programs have been compiled for calculating the displacements of membranes and plates.

Author Contributions

Conceptualization, A.U. and S.Z.; Methodology, A.U. and S.Z.; Validation, S.A., A.A. and K.O.; Formal Analysis, S.A., A.A. and K.O.; Investigation, A.U., S.A. and K.O.; Resources, A.U., S.A. and A.A.; Data Collection, A.U. and S.Z.; Writing-Original Draft Preparation, A.U. and S.A.; Writing-Review & Editing, S.Z., A.A. and K.O; Visualization, S.A.; Supervision, S.Z.; Project Administration, S.Z. and S.A.; Funding Acquisition, A.A. and K.O. All of the authors contributed significantly to the conception, design, and completion of this review, writing and improving the paper. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

There are no data applicable in this study.

Acknowledgments

The authors thank South Ural State University (SUSU) for its support.

Conflicts of Interest

The authors declare no conflict of interest.

Abbeviations

u displacement, solution of an elliptic equation
f right side of the elliptic equation
K coefficient of rigidity of the elastic foundation
K membrane tension factor
D plate cylindrical stiffness
E Young’s modulus
σ Poisson’s ratio
h plate thickness
P pressure
Ωbounded area on a plane
b 1 , b 2 the lengths of the sides of the rectangle
κcoefficient in second order equation
a , a 1 , a 2 coefficients in fourth order equations
noutward normal to the boundary of the region
s area boundaries
Γ 1 , Γ 2 , Γ 3 , Γ 4 parts of the border area
Wspace of solutions of a second-order elliptic equation
Hspace of solutions of a fourth-order equation
A( , )bilinear form of the second order equation
Λ( , )bilinear forms in fourth order equations
g( )linear functional
c 1 , c 2 positive constants
l 1 , l 2 boundary condition operators.

References

  1. Krizsky, V.N. Mathematical model of geosteering in control systems for drilling horizontal wells. Autom. Telemech. 2004, 45–56. [Google Scholar] [CrossRef]
  2. Landau, L.D.; Lifshits, E.M. Theory of Elasticity; Nauka: Moscow, Russia, 1965; Volume 7, 204p. [Google Scholar]
  3. Ryazhskikh, A.V. Hydrodynamic initial section during the flow of a high-viscosity Newtonian fluid in a round pipe. Bull. St. Petersburg Univ. Ser. Appl. Mathematics. Inform. Manag. Process. 2012, 3, 98–102. [Google Scholar]
  4. Oganesyan, L.A.; Rukhovets, L.A. Variational-Difference Methods for Solving Elliptic Equations; Publishing House of the Academy of Sciences of the ArmSSR: Yerevan, Armenia, 1979; 235p. [Google Scholar] [CrossRef]
  5. Timoshenko, S.P.; Voinovsky-Krieger, S. Plates and Shells; Nauka: Moscow, Russia, 1966; 636p, Available online: http://science.totalarch.com/book/4052.rar (accessed on 17 January 2021).
  6. Aubin, J.P. Approximate Solution of Elliptic Boundary Value Problems; Mir: Kansas, MO, USA, 1977; 383p, ISBN 0486457915/9780486457918. [Google Scholar]
  7. Sobolev, S.L. Some Applications of Functional Analysis in Mathematical Physics; Publishing House of Leningrad State University: Saint Petersburg, Russia, 1950; 256p, ISBN 0-8218-4549-7. [Google Scholar]
  8. Solomin, V.I. On the Development of Methods for Calculating Flexible Foundations and Their Foundations; Series: Construction and architecture; South Ural State University: Chelyabinsk, Russia, 2007; Volume 22, pp. 6–10. [Google Scholar]
  9. Happel, J.; Brenner, G. Hydrodynamics at Small Reynolds Numbers; Mir: Kansas, MO, USA, 1976; 630p. [Google Scholar] [CrossRef]
  10. Maslovskaya, L.B. Mixed finite element method for basic boundary value problems of plate theory in domains with corner points. In Approximation and Interpolation Methods: Sat. Scientific Tr.; Computing Center SO AN USSR: Novosibirsk, Russia, 1981; pp. 75–84. Available online: https://fizmathim.com/smeshannyy-metod-konechnyh-elementov-v-zadachah-deformatsii-obolochek (accessed on 17 May 2021).
  11. Courant, R.; Gilbert, D. Methods of Mathematical Physics; Gostekhizdat: Moscow, Russia, 1957; Volume 1, 476p. [Google Scholar]
  12. Ladyzhenskaya, O.A. Boundary Value Problems of Mathematical Physics; Nauka: Moscow, Russia, 1973; Volume 49, 407p. [Google Scholar]
  13. Ladyzhenskaya, O.A.; Uraltsev, N.N. Linear and Quasilinear Equations of Elliptic Type; Nauka: Moscow, Russia, 1973; Volume 17, 576p. [Google Scholar]
  14. Marchuk, G.I. Methods of Computational Mathematics; Nauka: Moscow, Russia, 1989; 608p, Available online: https://www.studmed.ru/marchuk-gi-metody-vychislitelnoy-matematiki_69900c38d84.html (accessed on 9 March 2021).
  15. Mikhlin, S.G. Variational Methods in Mathematical Physics; Nauka: Moscow, Russia, 1970; 512p, Available online: https://lib-bkm.ru/load/96-1-0-2986 (accessed on 23 March 2021).
  16. Samarsky, A.A. Theory of Difference Schemes; Nauka: Moscow, Russia, 1989; 616p. [Google Scholar] [CrossRef]
  17. Samarsky, A.A.; Andreev, V.B. Difference Methods for Elliptic Equations; Nauka: Moscow, Russia, 1976; 352p. [Google Scholar] [CrossRef]
  18. Dyakonov, E.G. Minimization of computational work. In Asymptotically Optimal Algorithms for Elliptic Problems; Nauka: Moscow, Russia, 1989; 272p, Available online: https://www.livelib.ru/book/1001103545-minimizatsiya-vychislitelnoj-raboty-evgenij-dyakonov (accessed on 22 March 2021).
  19. Anuchina, N.N.; Babenko, K.I.; Godunov, S.K. (Eds.) Theoretical Foundations and Design of Numerical Algorithms for Problems of Mathematical Physics; Nauka: Moscow, Russia, 1979; 296p. [Google Scholar]
  20. Bellman, R.; Angel, E. Dynamic Programming and Partial Differential Equations; Mir: Kansas, MO, USA, 1974; 204p. [Google Scholar]
  21. Ryazhskikh, V.I.; Slyusarev, M.I.; Popov, M.I. Numerical Integration of the Biharmonic Equation in the Quadratic Region; Series Applied Mathematics; Informatics. Management Processes; St. Petersburg University: Saint Petersburg, Russia, 2013; pp. 52–62. [Google Scholar]
  22. Gantmakher, F.R. Matrix Theory.; Nauka: Moscow, Russia, 1967; 576p. [Google Scholar]
  23. Lancaster, P. Matrix Theory; per. from English; Nauka: Moscow, Russia, 1982; 272p. [Google Scholar]
  24. Nepomnyashchikh, S.V. Methods of Decomposition of the Region and Fictitious Space: Dis. … Dr. Phys.-Math. Sciences; Novosibirsk State University: Novosibirsk, Russia, 2008; 262p. [Google Scholar]
  25. Lukinov, V.L.; Mikhailov, G.A. Monte Carlo methods for solving the first boundary value problem for a polyharmonic equation. J. Comput. Math. Math. Phys. 2005, 45, 495–508. [Google Scholar]
  26. Mikhailov, G.A.; Lukinov, V.L. Solving the multidimensional difference biharmonic equation by the Monte Carlo method. Sib. Math. J. 2001, 42, 1125–1135. [Google Scholar] [CrossRef]
  27. Sabelfeld, K.K. Solving one boundary value problem for a metaharmonic equation by the Monte Carlo method. J. Comput. Math. Math. Phys. 1979, 19, 961–969. [Google Scholar]
  28. Alyukov, S.V. Approximation of step functions in problems of mathematical modeling. J. Russ. Acad. Sci. 2011, 23, 75–88. [Google Scholar] [CrossRef]
  29. Alyukov, S.V. Modeling of dynamic processes with piecewise-linear characteristics. Proceedings of universities. Appl. Nonlinear Dyn. 2011, 19, 27–34. [Google Scholar]
  30. Alyukov, S.V. Approximation of generalized functions and their derivatives. Questions of atomic science and technology. Ser. Math. Model. Phys. Process. 2013, 2, 57–62. [Google Scholar]
  31. Sharkov, O.V.; Koryagin, S.I.; Velikanov, N.L. Forming the profile of cutting tools for manufacture of fine-module ratchet teeth. Mater. Today Proc. 2021, 38, 1437–1440. [Google Scholar] [CrossRef]
  32. Dubrovskiy, A.; Aliukov, S.; Dubrovskiy, S.; Alyukov, A. Basic Characteristics of Adaptive Suspensions of Vehicles with New Principle of Operation. SAE Int. J. Commer. Veh. 2017, 10, 193–203. [Google Scholar] [CrossRef]
  33. Alyukov, S.V. Approximation of electrocardiograms with help of new mathematical methods. Comput. Math. Model. 2018, 29, 59–70. [Google Scholar] [CrossRef]
  34. Aliukov, S.; Alabugin, A.; Osintsev, K. Review of Methods, Applications and Publications on the Approximation of Piecewise Linear and Generalized Functions. Mathematics 2022, 10, 3023. [Google Scholar] [CrossRef]
  35. Bjorstad, P. Fast numerical solution of the biharmonic dirichlet problem on rectangles. SIAM J. Numer. Anal. 1983, 20, 59–71. [Google Scholar] [CrossRef]
  36. Marchuk, G.I.; Shaydurov, V.V. Improving the Accuracy of Solutions of Difference Schemes; Nauka: Moscow, Russia, 1979; 320p. [Google Scholar]
  37. Gileva, L.V.; Shaydurov, V.V. Two multigrid iterative algorithms for a discrete analogue of the biharmonic equation. Sib. J. Comput. Math. 2004, 7, 213–228. [Google Scholar]
  38. Pavlov, S.P.; Zhigalov, M.V. An Iterative Procedure for Reducing a Biharmonic Equation to a Poisson-Type Equation; Saratov State Technical University: Saratov, Russia, 2011; Volume 1, pp. 22–29. [Google Scholar]
  39. Sorokin, S.B. Exact Energy Equivalence Constants in the Method of Recalculating Boundary Conditions for a Biharmonic Equation. Bulletin of the Novosibirsk State University. Math. Mech. Inform. 2013, 13, 113–121. [Google Scholar]
  40. Sorokin, S.B. Preconditioning in the numerical solution of the Dirichlet problem for a biharmonic equation. Sib. J. Comput. Math. 2011, 14, 205–213. [Google Scholar] [CrossRef]
  41. Sorokin, S.B. Analytical solution of the generalized spectral problem in the method of recalculation of boundary conditions for the biharmonic equation. Sib. J. Comput. Math. 2013, 16, 267–274. [Google Scholar]
  42. Glovinskiy, R.; Pironno, O. On the application of the “quasi-direct” method and iterative methods to the solution of the Dirichlet problem for a biharmonic operator with mixed finite element approximation. Computational Methods in Mathematical Physics, Geophysics and Optimal Control. Novosib. Izd. Nauka 1978, 238, 34–57. [Google Scholar]
  43. Ciarlet, P.G. Dual iterative technigues for solving a finite element approximation of the biharmonic eguation. Comput. Methods Appl. Mech. Eng. 1975, 5, 277–295. [Google Scholar] [CrossRef] [Green Version]
  44. Karachik, V.V.; Antropova, N.A. Construction of Polynomial Solutions of the Dirichlet Problem for a Biharmonic Equation. Math. Mech. Phys. 2011, 54, 39–50. [Google Scholar]
  45. Karachik, V.V. On polynomial solutions of the Dirichlet problem for a biharmonic equation in a ball. Sib. J. Comput. Math. 2012, 15, 86–98. [Google Scholar] [CrossRef]
  46. Karachik, V.V.; Antropova, N.A. Polynomial solutions of the Dirichlet problem for a biharmonic equation in a ball. Differ. Equ. 2013, 49, 250–254. [Google Scholar] [CrossRef]
  47. Potapov, A.N. On the prospects for the development of an approach based on the use of an algebraic problem of a quadratic form in problems of structural mechanics. Constr. Archit. 2007, 22, 46–50. [Google Scholar]
  48. Kaporin, I.E. Modified march algorithm for solving the Dirichlet difference problem for the Poisson equation in a rectangle. In Difference Methods of Mathematical Physics: Sat. Scientific Tr.; Moscow University: Moscow, Russia, 1980; pp. 11–21. [Google Scholar]
  49. Kaporin, I.E. Marching method for a system with a block-tridiagonal matrix. In Numerical Methods of Linear Algebra: Sat. Scientific Tr.; Moscow University: Moscow, Russia, 1982; pp. 63–72. [Google Scholar]
  50. Nikolaev, E.S. Method of incomplete cyclic reduction. In Difference Methods of Mathematical Physics: Sat. Scientific Tr.; Moscow University: Moscow, Russia, 1981; pp. 3–12. [Google Scholar]
  51. Samarsky, A.A.; Kaporin, I.E.; Kucherov, A.B.; Nikolaev, E.S. Some Modern Methods for Solving Grid Equations; Izv. Universities Maths: Moscow, Russia, 1983; Volume 27, pp. 3–12. [Google Scholar]
  52. Bank, R.E.; Rose, D.J. Marching algorithms for elliptic boundary value problems. SIAM J. Numer. Anal. 1977, 14, 792–829. [Google Scholar] [CrossRef]
  53. Swarztrauber, P.N. A direct method for discrete solution of separable elliptic equations. SIAM J. Numer. Anal. 1974, 11, 1136–1150. [Google Scholar] [CrossRef]
  54. Swarztrauber, P.N. The method of cyclic reduction, Fourier analysis fnd FACR algorithms for the discrete solution of Poisson’s equations on a rectangle. SIAM Rev. 1977, 19, 490–501. [Google Scholar] [CrossRef]
  55. Sweet, P.A. A cyclic reduction algorithm for solving block tridiagonal systems arbitrary dimension. SIAM J. Numer. Anal. 1977, 14, 706–720. [Google Scholar] [CrossRef]
  56. Panyukov, A.V.; Germanenko, M.I. Error-free solution of systems of linear algebraic equations. Math. Phys. Chem. 2009, 33–40. [Google Scholar]
  57. Buleev, N.I. Incomplete factorization method for solving two-dimensional and three-dimensional equations of diffusion type. J. Comput. Math. Math. Phys. 1970, 10, 1044. [Google Scholar] [CrossRef]
  58. Ilyin, V.P. On the rate of convergence of iterations of implicit methods of incomplete factorization. J. Comput. Math. Math. Phys. 1993, 33, 3–11. [Google Scholar]
  59. Ilyin, V.P. Incomplete Factorization Methods for Solving Algebraic Systems; Fizmatlit: Moscow, Russia, 1995; 288p. [Google Scholar]
  60. Ilyin, V.P. Incomplete factorization methods with semiconjugate residuals. Novosibirsk: SO RAN. J. Avtometry 2007, 43, 66–73. [Google Scholar]
  61. Manteuffel, T. An incomlete factorization technigue for positive definite linear systems. Math. Comput. 1980, 38, 114–123. [Google Scholar]
  62. Grinevich, P.G.; Novikov, S.P. The Cauchy kernel of DN—Discrete complex analysis of Novikov—Dynnikov on a triangular lattice. Adv. Math. Sci. 2007, 62, 155–156. [Google Scholar] [CrossRef]
  63. Grinevich, P.G.; Novikov, S.P. Discrete—Connections and self-adjoint difference operators on two-dimensional manifolds. Adv. Math. Sci. 2013, 68, 81–110. [Google Scholar]
  64. Novikov, S.P. Discrete spectral symmetries of low-dimensional differential operators and difference operators on regular lattices and two-dimensional manifolds. Adv. Math. Sci. 1997, 52, 175–234. [Google Scholar] [CrossRef] [Green Version]
  65. Ushakov, A.L. Modification of iterative factorization for the numerical solution of two second-order elliptic equations in a rectangular domain. Math. Mech. Phys. 2013, 5, 88–93. [Google Scholar]
  66. Ushakov, A.L. Iterative factorization on fictitious continuation for the numerical solution of a fourth-order elliptic equation. Math. Mech. Phys. 2014, 6, 17–22. [Google Scholar]
  67. Ushakov, A.L. Iterative Splitting Method for Special Elliptic Boundary Value Problems; Chelyabinsk Polytechnic Institute Chelyabinsk: Chelyabinsk, Russia, 1990; 32p. [Google Scholar]
  68. Ushakov, A.L. Method of Iterative Factorization; Chelyabinsk State Technical University Chelyabinsk: Chelyabinsk, Russia, 1994; 31p. [Google Scholar]
  69. Konovalov, A.N. Conjugate factorized models in problems of mathematical physics. Sib. J. Comput. Math. 1998, 1, 25–58. [Google Scholar]
  70. Konovalov, A.N. Iterative methods for operator equations with conjugate factorized structure. Sib. Math. J. 2000, 40, 370–384. [Google Scholar]
  71. Matsokin, A.M. Application of the fictitious component method for solving the simplest difference scheme for a fourth-order elliptic equation. In Variational-Difference Methods in Problems of Numerical Analysis: Sat. Scientific Tr Novosibirsk; Computing Center SO AN USSR: Novosibirsk, Russia, 1987; pp. 129–136. [Google Scholar]
  72. Dyakonov, E.G. On one iterative method for solving systems of finite-difference equations. Rep. Acad. Sci. USSR 1961, 138, 522–525. [Google Scholar]
  73. Dyakonov, E.G. On the application of difference splitting operators. J. Comput. Math. Math. Phys. 1963, 3, 385–388. [Google Scholar]
  74. Dyakonov, E.G. Majorizing operator method for solving difference analogs of strongly elliptic systems. Adv. Math. Sci. 1964, 19, 385–386. [Google Scholar]
  75. Dyakonov, E.G. On the use of spectrum-equivalent operators for solving difference analogues of strongly elliptic systems. Rep. Acad. Sci. USSR 1965, 163, 1314–1317. [Google Scholar]
  76. Dyakonov, E.G. On the construction of iterative methods based on the use of operators equivalent in spectrum. J. Comput. Math. Math. Phys. 1966, 6, 12–34. [Google Scholar]
  77. Margenov, S.G.; Lazarov, R.D. Application of Parabolic and Cubic Splines for Solving Fourth-Order Elliptic Boundary Value Problems in A Rectangle; Computing Center SO AN USSR: Novosibirsk, Russia, 1979; 14p. [Google Scholar]
  78. Astrakhantsev, G.P. Domain decomposition method for problems of bending of inhomogeneous plates. J. Comput. Math. Math. Phys. 1998, 38, 1758–1766. [Google Scholar]
  79. Matsokin, A.M. Method of fictitious components and a modified difference analogue of the Schwartz method. In Computational Methods of Linear Algebra: Sat. Scientific Tr; CC SO AN USSR: Novosibirsk, Russia, 1980; pp. 66–77. [Google Scholar]
  80. Matsokin, A.M. Methods of Fictitious Components and Alternation by Subdomains; Computing Center SO AN USSR: Novosibirsk, Russia, 1985; 25p. [Google Scholar]
  81. Matsokin, A.M. Relationship of the bordering method with the method of fictitious components and the method of alternation by subdomains. In Partial Differential Equations: Sat. Scientific Tr; IM SO AN SSSR: Novosibirsk, Russia, 1986; pp. 138–142. [Google Scholar]
  82. Matsokin, A.M. Convergence criterion for the Schwartz method in a Hilbert space. In Computational Processes and Systems; Nauka: Moscow, Russia, 1988; pp. 221–224. [Google Scholar]
  83. Zhang, X. Multilevel Schwarz method for the biharmonic Dirichlet problem. SIAM J. Sci. Comput. 1994, 15, 621–644. [Google Scholar] [CrossRef]
  84. Korneev, V.G. On the iterative solution of schemes of the finite element method for elliptic equations of the fourth order. In Numerical Methods of Continuum Mechanics; ITAM SO AN SSSR: Novosibirsk, Russia, 1978; Volume 9, pp. 85–104. [Google Scholar]
  85. Weber, B.; Korneev, V.G. Preconditioner of one finite element matrix for a fourth-order elliptic equation. J. Comput. Math. Math. Phys. 1993, 33, 364–379. [Google Scholar]
  86. Astrakhantsev, G.P. Method of fictitious domains for a second-order elliptic equation with natural boundary conditions. J. Comput. Math. Math. Phys. 1978, 18, 118–125. [Google Scholar] [CrossRef]
  87. Kaporin, I.E.; Nikolaev, E.S. Method of Fictitious Unknowns for Solving Difference Elliptic Boundary Value Problems in Irregular Domains. Differ. Equ. 1980, 16, 1211–1225. [Google Scholar]
  88. Kaporin, I.E.; Nikolaev, E.S. The method of fictitious unknowns for solving difference equations of elliptic type in domains of complex shape. DAN USSR 1980, 251, 544–548. [Google Scholar]
  89. Kuznetsov, Y.A.; Matsokin, A.M. On the optimization of the method of fictitious components. In Computational Methods of Linear Algebra: Sat. Scientific Tr; Computing Center SO AN USSR: Novosibirsk, Russia, 1977; pp. 79–86. [Google Scholar]
  90. Marchuk, G.I.; Kuznetsov, Y.A. Some questions of iterative methods. In Computational Methods of Linear Algebra: Sat. Scientific Tr; Computing Center SO AN USSR: Novosibirsk, Russia, 1972; pp. 4–20. [Google Scholar]
  91. Matsokin, A.M.; Nepomnyashchikh, S.V. Fictitious space method and explicit continuation operators. J. Comput. Math. Math. Phys. 1993, 33, 52–68. [Google Scholar]
  92. Marchuk, G.I.; Kuznetsov, Y.A.; Kuznetsov, A.M. Fictitious domain and domain decomposition methods. Sovet. J. Numer. Analyzes. Math. Model. 1986, 1, 3–35. [Google Scholar] [CrossRef]
  93. Ushakov, A.L. On modeling of plate deformations. Math. Model. Program. 2015, 8, 138–142. [Google Scholar]
  94. Ushakov, A.L. The Method of Fictitious Components for the Approximate Solution of a Fourth-Order Elliptic Differential Equation; Chelyabinsk Polytechnic Institute Chelyabinsk: Chelyabinsk, Russia, 1989; 29p. [Google Scholar]
  95. Ushakov, A.L. The Method of Fictitious Components at a Continuous Level; Chelyabinsk Polytechnic Chelyabinsk: Chelyabinsk, Russia, 1989; 15p. [Google Scholar]
  96. Ushakov, A.L. Modification of the Method of Fictitious Components for Nonsymmetric Expansion; Chelyabinsk State Technical University Chelyabinsk: Chelyabinsk, Russia, 1991; 25p. [Google Scholar]
  97. Ushakov, A.L. Modification of the Method of Fictitious Components; Chelyabinsk State Technical University Chelyabinsk: Chelyabinsk, Russia, 1991; 40p. [Google Scholar]
  98. Ushakov, A.L. Modification of the method of fictitious components for the numerical solution of elliptic boundary value problems of the fourth order. In Mathematical Models and Group Theory: Sat. Scientific Tr. Cafe General Mathematics of the South Ural State University; Publishing House of SUSU: Chelyabinsk, Russia, 2007; pp. 61–65. [Google Scholar]
  99. Ushakov, A.L. Method of fictitious components for elliptic differential equations. In Proceedings of the 5 School of Young Mathematicians of Siberia and the Far East: Abstracts. dokl., Novosibirsk, Russia, 10–16 December 1990; SO AN USSR: Novosibirsk, Russia, 1990; p. 123. [Google Scholar]
  100. Ushakov, A.L. Mathematical modeling of plate deformations on elastic foundations. In Proceedings of the 67th SUSU Scientific Conference, Chelyabinsk, Russia, 14–17 April 2015; SUSU: Chelyabinsk, Russia, 2015; pp. 75–83. [Google Scholar]
  101. Ushakov, A.L.; Meltsaykin, A.L. Analysis of Biharmonic and Harmonic Models by the Methods of iterative Extensions. Math. Model. Program. Comput. Softw. 2022, 15, 51–66. [Google Scholar] [CrossRef]
  102. Alaci, S.; Ciornei, F.-C.; Romanu, I.-C. Stress State in an Eccentric Elastic Ring Loaded Symmetrically by Concentrated Forces. Mathematics 2022, 10, 1314. [Google Scholar] [CrossRef]
  103. Kostic, M. Abstract Volterra Integro-Differential Equations; Taylor and Francis Group/CRC Press: Boca Raton, Fl, USA, 2015; 44p. [Google Scholar] [CrossRef]
  104. Prüss, J. Evolutionary Integral Equations and Applications; Basel etc., Birkhäuser Verlag: Basel, Switzerland, 1993; Volume XXVI, 366p, ISBN 3-7643-2876-2. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ushakov, A.; Zagrebina, S.; Aliukov, S.; Alabugin, A.; Osintsev, K. A Review of Mathematical Models of Elasticity Theory Based on the Methods of Iterative Factorizations and Fictitious Components. Mathematics 2023, 11, 420. https://doi.org/10.3390/math11020420

AMA Style

Ushakov A, Zagrebina S, Aliukov S, Alabugin A, Osintsev K. A Review of Mathematical Models of Elasticity Theory Based on the Methods of Iterative Factorizations and Fictitious Components. Mathematics. 2023; 11(2):420. https://doi.org/10.3390/math11020420

Chicago/Turabian Style

Ushakov, Andrey, Sophiya Zagrebina, Sergei Aliukov, Anatoliy Alabugin, and Konstantin Osintsev. 2023. "A Review of Mathematical Models of Elasticity Theory Based on the Methods of Iterative Factorizations and Fictitious Components" Mathematics 11, no. 2: 420. https://doi.org/10.3390/math11020420

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop