Next Article in Journal
On the Multi-Dimensional Sumudu-Generalized Laplace Decomposition Method and Generalized Pseudo-Parabolic Equations
Previous Article in Journal
Two New Tests for the Relationships of Stochastic Dominance
Previous Article in Special Issue
Stability Analysis of a New Fourth-Order Optimal Iterative Scheme for Nonlinear Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

High-Order, Accurate Finite Difference Schemes for Fourth-Order Differential Equations

by
Allaberen Ashyralyev
1,2,3,* and
Ibrahim Mohammed Ibrahım
4,5
1
Department of Mathematics, Bahcesehir University, Istanbul 34353, Turkey
2
Department of Mathematics, Peoples’ Friendship University of Russia RUDN University, Moscow 117198, Russia
3
Institute of Mathematics and Mathematical Modeling, Almaty 050010, Kazakhstan
4
Department of Mathematics, Near East University Nicosia, TRNC Mersin 10, Nicosia 99138, Turkey
5
Department of Mathematics, Akre University for Applied Science, Akre 42002, Duhok, Iraq
*
Author to whom correspondence should be addressed.
Submission received: 30 November 2023 / Revised: 31 December 2023 / Accepted: 2 January 2024 / Published: 30 January 2024
(This article belongs to the Special Issue Numerical Analysis and Applied Mathematics)

Abstract

:
This article is devoted to the study of high-order, accurate difference schemes’ numerical solutions of local and non-local problems for ordinary differential equations of the fourth order. Local and non-local problems for ordinary differential equations with constant coefficients can be solved by classical integral transform methods. However, these classical methods can be used simply in the case when the differential equation has constant coefficients. We study fourth-order differential equations with dependent coefficients and their corresponding boundary value problems. Novel compact numerical solutions of high-order, accurate finite difference schemes generated by Taylor’s decomposition on five points have been studied in these problems. Numerical experiments support the theoretical statements for the solution of these difference schemes.

1. Introduction

Differential equations can be solved with highly accurate difference schemes because of modern computers. Therefore, creating and investigating highly accurate difference schemes for differential equations is a topic of current interest. A thorough investigation was conducted into the application of Taylor’s decomposition on two and three points for the numerical solution of high-order approximation compact finite difference schemes of linear ordinary differential equations and partial differential equations (see, for example, [1,2,3]). In paper [4], the oxygen diffusion problem inside one cell is modelled by a one-dimensional time-dependent partial differential equation whose initial moving boundary value problem is the Du Fort–Frankel finite difference scheme. In [5], a partial differential equation describing oxygen diffusion in absorbing tissues was estimated analytically and numerically. An approximate analytical solution was proposed using Fourier expansion and, with limited modifications, the techniques of Crank and Gupta were employed.
There have not been enough investigations performed on Taylor’s decomposition on four and five points for the numerical solution of high-order approximation compact finite difference schemes of linear ordinary differential equations and partial differential equations. In papers [6,7,8], three-step difference schemes of the fourth order of approximation for the numerical solutions of the local and non-local boundary-value problems for third-order ordinary differential equations and partial differential equations were investigated, and Taylor decomposition on four points was used. A method for numerically solving third-order time-varying linear dynamical systems using Taylor’s decomposition on four points was presented. The procedure for the numerical examination of an up-converter applied in communication networks was explained.
In [9], the four-step difference schemes generated by Taylor decomposition on five points of the sixth order of approximation for the numerical solutions to the boundary-value problem
d 4 u ( t ) d t 4 + a ( t ) u ( t ) = f ( t ) , 0 < t < T , u ( 0 ) = φ , u ( T ) = ω , u ( 0 ) = ψ , u ( T ) = χ
for a fourth-order differential equation with a dependent coefficient were presented. Here and hereafter, a ( t ) and f ( t ) denote smooth given functions defined on [ 0 , T ] .
In theory and applications, boundary value problems for ordinary differential equations are important. Many physical, biological, and chemical phenomena are described using them. Rich areas of such applications include the elasticity work of Timoshenko [10], the deformation of structure monographs by Soedel [11], and the effects of soil settlement work by Dulacska [12].
Boundary value problems of second- and higher-order differential equations have been extensively studied; papers of Anderson and Davis [13], Baxley and Haywood [14], and Hao and Liu [15] are among the recent contributions to this field. The reader is referred to the monographs of Agarwal et al. [16,17] for surveys of known results and additional references. As far as we are aware though, the majority of the aforementioned studies as well as a large body of other literature on ordinary differential equations focused on either the two-point boundary value problem for higher-order ordinary differential equations or the multi-point boundary value problem for second-order ordinary differential equations. The boundary value problem for higher-order ordinary differential equations has been well investigated. In the present article, we investigate the ordinary differential equation of the fourth order (1).
The beam equation, or the nonlinear form of differential Equation (1), has been probed under multiple boundary conditions.
The work of Zill and Cullen ([18], pp. 237–243) provides a succinct and easily readable explanation as well as a physical interpretation of a few of the boundary conditions related to the linear beam equation. The multi-point boundary conditions that are the subject of this study deviate somewhat from those commonly encountered in the literature, such as the conjugate [19], focal [13,20], and Lidstone [21] conditions.
Some physical systems have mathematical descriptions that use linear differential equations subject to specific boundary conditions, particularly beam deflection mathematical models. These beams, which are utilised in many structures, can flex due to external forces acting on them or due to their weight. The deflection curve, also known as the elastic curve, is the curve connecting the centroids of all cross sections if a load is applied to a beam, for instance, on a vertical plane that contains the axis of symmetry. This causes the beam to undergo distortion.
In ref. [22], in the context of structural mechanics, the equation controlling the bending of a cantilever beam under a distributed load was presented and is a famous example of a fourth-order differential equation. This illustration is often known as the “Euler–Bernoulli beam equation”. The beam’s transverse displacement, w(x, t), as a function of position (x) and time (t) is expressed by this equation. The equation for the Euler–Bernoulli beam is as follows:
E I w x x x x x ( x , t ) + p A w t t ( x , t ) = q ( x , t )
where:
Eis the Young’s modulus of the material;
Iis the moment of inertia of the cross-sectional area;
Pis the mass density of the beam material;
Ais the cross-sectional area of the beam;
w x x x x x is the fourth spatial derivative of w with respect to x;
w t t is the second time derivative of w with respect to t;
q ( x , t ) represents an external distributed load.
The numerical solutions of problem (1) are approximated to a high order of accuracy for the construction of the four-step difference schemes and the local boundary value problem of the form
d 4 u ( t ) d t 4 + a ( t ) u ( t ) = f ( t ) , 0 < t < T , u ( 0 ) = φ , u ( T ) = ω , u ( 0 ) = ψ , u ( T ) = χ
For a fourth-order differential equation, we consider the five points t k ± 2 , t k ± 1 , and t k of the uniform grid space
[ 0 , T ] τ = { t k = k τ , k = 0 , 1 , , N , N τ = T } .
Applying the five points t k , t k ± 1 , t k ± 2 [ 0 , T ] τ , we can present the second-order approximation four-step difference schemes as
τ 4 u k + 2 + 4 u k + 1 + 6 u k + 4 u k 1 + u k 2 + a ( t k ) u k = f ( t k ) , 2 k N 2 , u 0 = φ , u N = ω , 3 2 u 0 2 u 1 + 1 2 u 2 = τ ψ , 3 2 u N + 2 u N 1 1 2 u N 2 = τ χ
for the numerical solution of boundary value problem (1), and
τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 + a ( t k ) u k = f ( t k ) , 2 k N 2 , u 0 = φ , u N = ω , 2 u 0 5 u 1 + 4 u 2 u 3 = τ 2 ψ , 2 u N 5 u N 1 + 4 u N 2 u N 3 = τ 2 χ
for the numerical solution of boundary value problem (2). Note that there are two difference schemes for the numerical solutions of boundary value problems (1) and (2). It is easy to see that the order of these difference schemes is two. They are based on the formulas
τ 4 u ( t k + 2 ) 4 u ( t k + 1 ) + 6 u ( t k ) 4 u ( t k 1 ) + u ( t k 2 ) u ( 4 ) ( t k ) ) = o ( τ 2 ) ,
τ 1 3 2 u ( 0 ) 2 u ( τ ) + 1 2 u ( 2 τ ) u ( 0 ) = o ( τ 2 ) ,
τ 1 3 2 u ( T ) + 2 u ( T τ ) 1 2 u ( T 2 τ ) u ( T ) = o ( τ 2 ) ,
τ 2 2 u ( 0 ) 5 u ( τ ) + 4 u ( 2 τ ) u ( 3 τ ) u ( 0 ) = o ( τ 2 ) ,
τ 2 2 u ( T ) 5 u ( T τ ) + 4 u ( T 2 τ ) u ( T 3 τ ) u ( T ) = o ( τ 2 ) .
In this work, we numerically compare the results and methods of other authors. We use the fourth-order approximation of the numerical solutions of the first and second derivatives of local boundary value problems (1) and (2) at points zero and T, while in [6,7], approximations for the numerical solutions of local boundary value problems are used only for the first derivative of each problem.
We have used these different schemes with different values of τ , namely τ = 1 80 , 1 160 , 1 320 . Here and hereafter, the error of the numerical solutions is defined by the formula:
E N = max 0 k N | u ( t k ) u k | .
Remark 1.
Note that (see Table 1). If N is doubled, the value of errors between the exact solution and approximate solution decreases by a factor of approximately 1 / 4 for difference schemes (3) and (4). So, the order of accuracy of these difference schemes is 2.
The main aim of this work is the construction of highly accurate four-step difference schemes for the numerical solution of fourth-order differential equations. In the present paper, fourth- and sixth-order approximation finite difference schemes generated by Taylor decomposition on five points for solving these problems are presented. The results of numerical experiments support the theoretical statements for the solution of these difference schemes. This paper is organised as follows. Section 1 is an introduction. In Section 2 and Section 3, local boundary value problems (1) and (2) are presented. A novel numerical method for the solutions to these problems is investigated. Finally, Section 4 is the conclusion and our future plans.

2. Local Boundary Value Problem (1)

Based on the following theorem, difference schemes of the fourth order of approximation for the numerical solutions of local boundary value problems (1) and (2) are constructed utilising Taylor decomposition on five points.
Theorem 1.
Let ν ( t ) be a function with a continuous eighth derivative ( 0 t T ) . Then, the following relations hold:
τ 4 ( ν ( t k + 2 ) 4 ν ( t k + 1 ) + 6 ν ( t k ) 4 ν ( t k 1 ) + ν ( t k 2 ) )
2 3 v ( 4 ) t k 1 6 v ( 4 ) t k + 1 + v ( 4 ) t k + 1 = o ( τ 4 ) ,
τ 4 ( ν ( t k + 2 ) 4 ν ( t k + 1 ) + 6 ν ( t k ) 4 ν ( t k 1 ) + ν ( t k 2 ) )
11 12 v ( 4 ) t k 1 24 v ( 4 ) t k + 2 + v ( 4 ) t k + 2 = o ( τ 4 ) .
Proof. 
Using Taylor’s formula, we have the following two formulas
ν ( t k + 1 ) + ν ( t k 1 ) = 2 v t k + 2 v t k τ 2 2 ! + 2 v 4 t k τ 4 4 ! + 2 v 6 t k τ 6 6 ! + o ( τ 8 ) ,
ν ( t k + 2 ) + ν ( t k 2 ) = 2 v t k + 2 v t k 4 τ 2 2 ! + 2 v 4 t k 16 τ 4 4 ! + 2 v 6 t k 64 τ 6 6 ! + o ( τ 8 ) .
From these formulas, it follows that
τ 4 ( ν ( t k + 2 ) 4 ν ( t k + 1 ) + 6 ν ( t k ) 4 ν ( t k 1 ) + ν ( t k 2 ) )
= v 4 t k + v 6 t k τ 2 6 + o ( τ 4 ) .
Now, we will obtain α , β such that
τ 4 ( ν ( t k + 2 ) 4 ν ( t k + 1 ) + 6 ν ( t k ) 4 ν ( t k 1 ) + ν ( t k 2 ) )
α ν ( 4 ) ( t k ) β ( ν ( 4 ) ( t k + 1 ) + ν ( 4 ) ( t k 1 ) ) = o ( τ 4 ) .
We have that
ν ( 4 ) ( t k + 1 ) + ν ( 4 ) ( t k 1 ) = 2 v 4 t k + 2 v 6 t k τ 2 2 ! + o ( τ 4 ) .
Using Formula (8) and the last formula, we get
v 4 t k + v 6 t k τ 2 6 α ν ( 4 ) ( t k ) β ( 2 v 4 t k + 2 v 6 t k τ 2 2 ! ) + o ( τ 4 )
= 1 α + 2 β v ( 4 ) ( t k ) + 1 6 β v 6 t k τ 2 + o ( τ 4 ) = 0 .
The system of equations is then obtained by equating the coefficients of the lowest power of τ in the formula above to zero.
1 α + 2 β = 0 , 1 6 β = 0 .
Solving this system of equations, we can obtain α = 2 3 , β = 1 6 . So, relation (6) is proved. Similarly, we can prove relation (7). Theorem 1 is proved.
Let us consider boundary value problem (1). Taylor decomposition’s on five points (6) and (7), as well as the fourth order of approximation for v ( 0 ) and v ( T ) , forms a basis for the construction of the fourth order of approximation for the approximate solution of problem (1). □
Theorem 2.
Let ν ( t ) be a function with a continuous fifth derivative on ( 0 t T ) . Then, the following is valid:
v ( 0 ) τ 1 25 12 v ( 0 ) + 4 v ( τ ) 3 v ( 2 τ ) + 4 3 v ( 3 τ ) 1 4 v ( 4 τ ) = o ( τ 4 ) ,
v ( T ) τ 1 25 12 v ( T ) 4 v ( T τ ) + 3 v ( T 2 τ ) 4 3 v ( T 3 τ ) + 1 4 v ( T 4 τ ) = o ( τ 4 ) .
Proof. 
Applying the undetermined coefficients method, we will seek
v 0 = α v 0 + β v τ + γ v 2 τ + d v 3 τ + p v 4 τ + o τ 4 .
Using Taylor’s formula, we have the following two formulas
v 0 = α v 0 + β v 0 + v 0 τ + v 0 τ 2 2 ! + v 0 τ 3 3 ! + v 4 0 τ 4 4 ! + o τ 5
+ γ v 0 + 2 v 0 τ + 4 v 0 τ 2 2 ! + 8 v 0 τ 3 3 ! + 16 v 4 0 τ 4 4 ! + o τ 5
+ d v 0 + 3 v 0 τ + 9 v 0 τ 2 2 ! + 27 v 0 τ 3 3 ! + 81 v 4 0 τ 4 4 ! + o τ 5
+ p v 0 + 4 v 0 τ + 4 2 v 0 τ 2 2 ! + 4 3 v 0 τ 3 3 ! + 4 4 v 4 0 τ 4 4 ! + o τ 5 + o τ 4 .
The system of equations is then obtained by equating the coefficients of the lowest power of τ in the formula above to zero.
α β γ d p = 0 , β + 2 γ + 3 d + 4 p = τ 1 , β + 4 γ + 9 d + 16 p = 0 , β + 8 γ + 27 d + 64 p = 0 , β + 16 γ + 81 d + 256 p = 0 .
Solving this system of equations, we can obtain α = 25 12 τ , β = 4 τ , γ = 3 3 τ , d = 4 3 τ , p = 11 4 τ . So, relation (9) is proved. Similarly, one can obtain relation (10). Theorem 7 is proved.
We obtain the fourth order of approximation difference schemes by applying Taylor decomposition on five points (6), Equation (1), and Formulas (9) and (10), and neglecting small terms.
1 τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 + 2 3 a ( t k ) u k + 1 6 a ( t k 1 ) u k 1 + a ( t k + 1 ) u k + 1 = 2 3 f ( t k ) + 1 6 f ( t k 1 ) + f ( t k + 1 ) , 2 k N 2 , u 0 = φ , τ 1 ( 25 12 u 0 + 4 u 1 3 u 2 + 4 3 u 3 1 4 u 4 ) = ψ , τ 1 ( 25 12 u N 4 u N 1 + 3 u N 2 4 3 u N 3 + 1 4 u N 4 ) = χ , u N = ω ,
and
1 τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 11 12 a ( t k ) u k 1 24 a ( t k 2 ) u k 2 + a ( t k + 2 ) u k + 2 = 11 12 f ( t k ) + 1 24 f ( t k 2 ) + f ( t k + 2 ) , 2 k N 2 , u 0 = φ , τ 1 ( 25 12 u 0 + 4 u 1 3 u 2 + 4 3 u 3 1 4 u 4 ) = ψ , τ 1 ( 25 12 u N 4 u N 1 + 3 u N 2 4 3 u N 3 + 1 4 u N 4 ) = χ , u N = ω
for the boundary value problem’s numerical solution (1). In Section 2, note that there are two difference schemes for the numerical solutions of boundary value problems (1) and (2). We consider the boundary value problem in numerical analysis
d 4 u ( t ) d t 4 + u ( t ) = 4 ! 4 · 5 ! t + 6 · 6 ! 2 ! t 2 4 · 7 ! 3 ! t 3 + 8 ! 4 ! t 4 + t 4 1 t 4 , 0 < t < 1 , u ( 0 ) = u ( 1 ) = u ( 0 ) = u ( 1 ) = 0
with the exact solution
u ( t ) = t 4 1 t 4 .
Note that we utilised the fourth order of approximation difference schemes (12) and (13) for the approximate solution of problem (14) with different values of τ , namely τ = 1 80 , 1 160 , 1 320 . □
Remark 2.
Note that (see Table 2). It is observed that for difference schemes (12) and (13), the value of errors between the exact solution and approximate solution decreases by a factor of about 1 / 16 if N is doubled. Thus, these difference schemes have an accuracy order of 4.
We now consider the approximation difference schemes of the sixth order for the approximate solution of problem (1). It was observed that the approximate solution to problem (1) requires a sixth-order approximation difference scheme.
1 τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 + 237 360 a ( t k ) u k + 31 180 a ( t k 1 ) u k 1 + a ( t k + 1 ) u k + 1 1 720 a ( t k 2 ) u k 2 + a ( t k + 2 ) u k + 2 = 237 360 f ( t k ) + 31 180 f ( t k 1 ) + f ( t k + 1 ) 1 720 f ( t k 2 ) + f ( t k + 2 ) , 2 k N 2 , u 0 = φ , u N = ω , τ 1 11 + 1 20 τ 4 u 0 + 18 + 11 10 τ 4 u 1 + 9 + 7 20 τ 4 u 2 + 2 u 3 = ψ , τ 1 11 1 20 τ 4 u N 18 + 11 10 τ 4 u N 1 + 9 7 20 τ 4 u N 2 2 u N 3 = χ .
was discussed in the research paper [13]. We now consider the sixth-order approximation formulas for v ( 0 ) and v ( T ) , and Taylor decomposition on five points forms the basis for difference scheme (2)’s construction.
Theorem 3
([13]). Let ν ( t ) be a function with a continuous tenth derivative on ( 0 t T ) . Then, the following holds:
τ 4 ( ν ( t k + 2 ) 4 ν ( t k + 1 ) + 6 ν ( t k ) 4 ν ( t k 1 ) + ν ( t k 2 ) )
237 360 ν ( 4 ) ( t k ) 31 180 ( ν ( 4 ) ( t k + 1 ) + ν ( 4 ) ( t k 1 ) ) + 1 720 ( ν ( 4 ) ( t k + 2 ) + ν ( 4 ) ( t k 2 ) ) = o ( τ 6 ) .
Theorem 4
([13]). Let ν ( t ) be the function with a continuous seventh derivative ( 0 t T ) . The relation that follows thus holds:
v ( 0 ) τ 1 ( 11 6 v ( 0 ) + 3 v ( τ ) 3 2 v ( 2 τ ) + 1 3 v ( 3 τ ) )
+ τ 3 1 120 v ( 4 ) ( 0 ) + 11 60 v ( 4 ) ( τ ) + 7 120 v ( 4 ) ( 2 τ ) = o ( τ 6 ) ,
v ( T ) τ 1 ( 11 6 v ( T ) 3 v ( T τ ) + 3 2 v ( T 2 τ ) 1 3 v ( T 3 τ ) )
+ τ 3 1 120 v ( 4 ) ( T ) 11 60 v ( 4 ) ( T τ ) 7 120 v ( 4 ) ( T 2 τ ) = o ( τ 6 ) .
We used the sixth-order approximation difference scheme (2) to estimate the solution of problem (14) with different values of τ, namely τ = 1 40 , 1 80 , 1 160 .
Remark 3.
Note that (see Table 3). It is observed that for the difference scheme (2), the value of errors between the exact solution and approximate solution decreases by a factor of about 1 / 8 if N is doubled. Thus, these difference schemes have an accuracy order of 3.
We obtain new sixth-order approximation formulas for v ( 0 ) and v ( T ) in the present paper.
Theorem 5.
Let ν ( t ) be the function with a seventh continuous derivative ( 0 t T ) . The relation that follows thus holds:
v ( 0 ) τ 1 49 20 v ( 0 ) + 6 v ( τ ) 15 2 v ( 2 τ ) + 20 3 v ( 3 τ )
15 4 v ( 4 τ ) + 6 5 v ( 5 τ ) 1 6 v ( 6 τ ) = o ( τ 6 ) ,
v ( T ) τ 1 49 20 v ( T ) 6 v ( T τ ) + 15 2 v ( T 2 τ ) 20 3 v ( T 3 τ )
+ 15 4 v ( T 4 τ ) 6 5 v ( T 5 τ ) + 1 6 v ( T 6 τ ) = o ( τ 6 ) .
Proof. 
Applying the undetermined coefficients method, we will seek
v 0 = α v 0 + β v τ + γ v 2 τ + d v 3 τ
+ p v 4 τ + q v 5 τ + m v 6 τ + o τ 6
It can be written using Taylor’s formula that
v 0 = α v 0 + β v 0 + v 0 τ + v 0 τ 2 2 ! + v 0 τ 3 3 ! + v 4 0 τ 4 4 ! + v 5 0 τ 5 5 !
+ v 6 0 τ 6 6 ! + o τ 7
+ γ v 0 + 2 v 0 τ + 4 v 0 τ 2 2 ! + 8 v 0 τ 3 3 ! + 16 v 4 0 τ 4 4 ! + 32 v 5 0 τ 5 5 !
+ 64 v 6 0 τ 6 6 ! + o τ 7
+ d v 0 + 3 v 0 τ + 9 v 0 τ 2 2 ! + 27 v 0 τ 3 3 ! + 81 v 4 0 τ 4 4 ! + 243 v 5 0 τ 5 5 !
+ 729 v 6 0 τ 6 6 ! + o τ 7
+ p v 0 + 4 v 0 τ + 4 2 v 0 τ 2 2 ! + 4 3 v 0 τ 3 3 ! + 4 4 v 4 0 τ 4 4 ! + 4 5 v 5 0 τ 5 5 !
+ 4 6 v 6 0 τ 6 6 ! + o τ 7
+ q v 0 + 5 v 0 τ + 5 2 v 0 τ 2 2 ! + 5 3 v 0 τ 3 3 ! + 5 4 v 4 0 τ 4 4 ! + 5 5 v 5 0 τ 5 5 !
+ 5 6 v 6 0 τ 6 6 ! + o τ 7
+ m v 0 + 6 v 0 τ + 6 2 v 0 τ 2 2 ! + 6 3 v 0 τ 3 3 ! + 6 4 v 4 0 τ 4 4 ! + 6 5 v 5 0 τ 5 5 !
+ 6 6 v 6 0 τ 6 6 ! + o τ 7 + o τ 6 .
A system of equations is then obtained by equating the coefficients of the lowest power of τ in the formula above to zero.
α β γ d p q m = 0 , β + 2 γ + 3 d + 4 p + 5 q + 6 m = τ 1 , 1 2 ! β + 4 2 ! γ + 9 2 ! d + 4 2 2 ! p + 5 2 2 ! q + 6 2 2 ! m = 0 , 1 3 ! β + 8 3 ! γ + 27 3 ! d + 4 3 3 ! p + 5 3 3 ! q + 6 3 3 ! m = 0 , 1 4 ! β + 16 4 ! γ + 81 4 ! d + 4 4 4 ! p + 5 4 4 ! q + 6 4 4 ! m = 0 , 1 5 ! β + 32 5 ! γ + 243 5 ! d + 4 5 5 ! p + 5 5 5 ! q + 6 5 5 ! m = 0 , 1 6 ! β + 64 6 ! γ + 729 6 ! d + 4 6 6 ! p + 5 6 6 ! q + 6 6 6 ! m = 0 .
Solving this system of equations, we can obtain α = 49 20 τ , β = 6 τ , γ = 15 2 τ , d = 20 3 τ , p = 15 4 τ , q = 6 5 τ , m = 1 6 τ . So, relation (18) is proved. Similarly, relation (19) can be proved. Theorem 5 is proved.
We obtain the fourth order of approximation difference schemes by applying Taylor decomposition on five points (15), Equation (1), and Formulas (18) and (19), and neglecting small terms.
1 τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 + 237 360 a ( t k ) u k + 31 180 a ( t k 1 ) u k 1 + a ( t k + 1 ) u k + 1 1 720 a ( t k 2 ) u k 2 + a ( t k + 2 ) u k + 2 = 237 360 f ( t k ) + 31 180 f ( t k 1 ) + f ( t k + 1 ) 1 720 f ( t k 2 ) + f ( t k + 2 ) , 2 k N 2 , u 0 = φ , τ 1 ( 49 20 u 0 + 6 u 1 15 2 u 2 + 20 3 u 3 15 4 u 4 + 6 5 u 5 1 6 u 6 ) = ψ , τ 1 ( 49 20 u N 6 u N 1 + 15 2 u N 2 20 3 u N 3 + 15 4 u N 4 6 5 u N 5 + 1 6 u N 6 ) = χ , u N = ω
for the numerical solution of the boundary value problem (1). It can be seen that for the approximate solution of problem (14), the accuracy order of this difference method is 6. We used the sixth order of approximation difference scheme (21) with different values of τ , namely τ = 1 40 , 1 80 , 1 160 . □
Remark 4.
Note that (see Table 4). It is observed that for difference schemes (21), the value of errors between the exact solution and approximate solution decreases by a factor of about 1 / 64 if N is doubled. Thus, these difference schemes have an accuracy order of 6.

3. Local Boundary Value Problem (2)

We consider the boundary value problem (2). Theorem 3 and the fourth-order approximation formulas for v ( 0 ) and v ( T ) form the basis for the construction of the difference schemes of the fourth order of approximation for the approximate solution of problem (2).
Theorem 6.
Let ν ( t ) be a function with a continuous sixth derivative on ( 0 t T ) . Then, the following holds:
v ( 0 ) τ 2 15 4 v 0 77 6 v τ + 107 6 v 2 τ 13 v 3 τ
+ 61 12 v 4 τ 5 6 v 5 τ = o ( τ 4 ) ,
v ( T ) τ 2 15 4 v T 77 6 v T τ + 107 6 v T 2 τ 13 v T 3 τ
+ 61 12 v T 4 τ 5 6 v T 5 τ = o ( τ 4 ) .
Proof. 
Applying the undetermined coefficients method, we will seek
v 0 α v 0 + β v τ + γ v 2 τ + d v 3 τ + p v 4 τ + q v 5 τ + o τ 4 .
It can be written using Taylor’s formula that
v 0 τ 2 = α v 0 + β v 0 + v 0 τ + v 0 τ 2 2 ! + v 0 τ 3 3 ! + v 4 0 τ 4 4 ! + v 5 0 τ 5 5 ! + o ( τ 6 )
+ γ v 0 + 2 v 0 τ + 4 v 0 τ 2 2 ! + 8 v 0 τ 3 3 ! + 16 v 4 0 τ 4 4 ! + 32 v 5 0 τ 5 5 ! + o ( τ 6 )
+ d v 0 + 3 v 0 τ + 9 v 0 τ 2 2 ! + 27 v 0 τ 3 3 ! + 81 v 4 0 τ 4 4 ! + 243 v 5 0 τ 5 5 ! + o ( τ 6 )
+ p v 0 + 4 v 0 τ + 4 2 v 0 τ 2 2 ! + 4 3 v 0 τ 3 3 ! + 4 4 v 4 0 τ 4 4 ! + 4 5 v 5 0 τ 5 5 ! + o ( τ 6 )
+ q v 0 + 5 v 0 τ + 5 2 v 0 τ 2 2 ! + 5 3 v 0 τ 3 3 ! + 5 4 v 4 0 τ 4 4 ! + 5 5 v 5 0 τ 5 5 ! + o ( τ 6 )
+ o ( τ 4 ) .
The system of equations is then obtained by equating the coefficients of the lowest power of τ in the formula above to zero.
α β γ d p q = 0 , β + 2 γ + 3 d + 4 p + 5 q = 0 , 1 2 ! β + 4 2 ! γ + 9 2 ! d + 4 2 2 ! p + 5 2 2 ! q = τ 2 , 1 3 ! β + 8 3 ! γ + 27 3 ! d + 4 3 3 ! p + 5 3 3 ! q + 6 3 3 ! m + 7 3 3 ! n = 0 , 1 4 ! β + 16 4 ! γ + 81 4 ! d + 4 4 4 ! p + 5 4 4 ! q = 0 , 1 5 ! β + 32 5 ! γ + 243 5 ! d + 4 5 5 ! p + 5 5 5 ! q = 0 .
Solving this system of equations, we can obtain α = 15 4 τ 2 , β = 77 6 τ 2 , γ = 107 6 τ 2 , d = 13 τ 2 , p = 61 12 τ 2 , q = 5 6 τ 2 . So, relation (22) is proved. Likewise, one can prove relation (23). This is the end of the proof of Theorem 6.
We now have the fourth order of approximation difference schemes by applying Taylor decomposition on five points (6), Equation (2), and Formulas (22) and (23), and neglecting small terms.
1 τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 + 2 3 a ( t k ) u k + 1 6 a ( t k 1 ) u k 1 + a ( t k + 1 ) u k + 1 = 2 3 f ( t k ) + 1 6 f ( t k 1 ) + f ( t k + 1 ) , 2 k N 2 , u 0 = φ , τ 2 ( 15 4 u 0 77 6 u 1 + 107 6 u 2 13 u 3 + 61 12 u 4 5 6 u 5 ) = y ( 0 ) , τ 2 ( 15 4 u N 77 6 u N 1 + 107 6 u N 2 13 u N 3 + 61 12 u N 4 5 6 u N 5 ) = y ( T ) , u N = ω
and
1 τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 + 11 12 a ( t k ) u k + 1 24 a ( t k 2 ) u k 2 + a ( t k + 2 ) u k + 2 = 11 12 f ( t k ) + 1 24 f ( t k 2 ) + f ( t k + 2 ) , 2 k N 2 , u 0 = φ , τ 2 ( 15 4 u 0 77 6 u 1 + 107 6 u 2 13 u 3 + 61 12 u 4 5 6 u 5 ) = y ( 0 ) , u 0 = φ , τ 2 ( 15 4 u 0 77 6 u 1 + 107 6 u 2 13 u 3 + 61 12 u 4 5 6 u 5 ) = y ( 0 ) , τ 2 ( 15 4 u N 77 6 u N 1 + 107 6 u N 2 13 u N 3 + 61 12 u N 4 5 6 u N 5 ) = y ( T ) , u N = ω
for boundary value problem (2)’s numerical solution. In Section 3, we consider the boundary value problem in numerical analysis
d 4 u ( t ) d t 4 + u ( t ) = 4 ! 4 · 5 ! t + 6 · 6 ! 2 ! t 2 4 · 7 ! 3 ! t 3 + 8 ! 4 ! t 4 + t 4 1 t 4 , 0 < t < 1 , u ( 0 ) = u ( 1 ) = u ( 0 ) = u ( 1 ) = 0 ,
with the exact solution
u ( t ) = t 4 1 t 4 .
Note that we utilised the fourth order of approximation difference schemes (25) and (26) for the approximate solution of this problem (14) with different values of τ , namely τ = 1 80 , 1 160 , 1 320 . □
Remark 5.
Note that (see Table 5). It is observed that for difference schemes (25) and (26), the value of errors between the exact solution and approximate solution decreases by a factor of about 1 / 16 if N is doubled. Thus, these difference schemes have an accuracy order of 4.
The approximation difference scheme of the sixth order is now under consideration for the approximate solution of problem (2). Theorem 3 and the sixth-order approximation formulas for v ( 0 ) and v ( T ) form the basis for the construction of the sixth-order approximation for the approximate solution of problem (1).
Theorem 7.
Let ν ( t ) be a function with a continuous eighth derivative on ( 0 t T ) . Then, the following holds:
v ( 0 ) τ 2 469 90 v 0 223 10 v τ + 879 20 v 2 τ 949 18 v 3 τ
+ 41 v 4 τ 201 10 v 5 τ + 1019 180 v 6 τ 7 10 v 7 τ = o ( τ 6 ) ,
v ( T ) τ 2 469 90 v T 223 10 v T τ + 879 20 v T 2 τ 949 18 v T 3 τ
+ 41 v T 4 τ 201 10 v T 5 τ + 1019 180 v T 6 τ 7 10 v T 7 τ = o ( τ 6 ) .
Proof. 
Applying the undetermined coefficients method, we will seek
v 0 τ 2 = α v 0 + β v τ + γ v 2 τ + d v 3 τ + p v 4 τ + q v 5 τ + m v 6 τ + n v 7 τ + o τ 6 .
Using Taylor’s formula, we get
v 0 τ 2 = α v 0 + β v 0 + v 0 τ + v 0 τ 2 2 ! + v 0 τ 3 3 ! + v 4 0 τ 4 4 ! + v 5 0 τ 5 5 !
+ v 6 0 τ 6 6 ! + v 7 0 τ 7 7 ! + o τ 8
+ γ v 0 + 2 v 0 τ + 4 v 0 τ 2 2 ! + 8 v 0 τ 3 3 ! + 16 v 4 0 τ 4 4 ! + 32 v 5 0 τ 5 5 !
+ 64 v 6 0 τ 6 6 ! + 128 v 7 0 τ 7 7 ! + o τ 8
+ d v 0 + 3 v 0 τ + 9 v 0 τ 2 2 ! + 27 v 0 τ 3 3 ! + 81 v 4 0 τ 4 4 ! + 243 v 5 0 τ 5 5 !
+ 729 v 6 0 τ 6 6 ! + 2187 v 7 0 τ 7 7 ! + o τ 8
+ p v 0 + 4 v 0 τ + 4 2 v 0 τ 2 2 ! + 4 3 v 0 τ 3 3 ! + 4 4 v 4 0 τ 4 4 !
+ 4 5 v 5 0 τ 5 5 ! + 4 6 v 6 0 τ 6 6 ! + 4 7 v 7 0 τ 7 7 ! + o τ 8
+ q v 0 + 5 v 0 τ + 5 2 v 0 τ 2 2 ! + 5 3 v 0 τ 3 3 ! + 5 4 v 4 0 τ 4 4 !
+ 5 5 v 5 0 τ 5 5 ! + 5 6 v 6 0 τ 6 6 ! + 5 7 v 7 0 τ 7 7 ! + o τ 8
+ m v 0 + 6 v 0 τ + 6 2 v 0 τ 2 2 ! + 6 3 v 0 τ 3 3 ! + 6 4 v 4 0 τ 4 4 !
+ 6 5 v 5 0 τ 5 5 ! + 6 6 v 6 0 τ 6 6 ! + 6 7 v 7 0 τ 7 7 ! + o τ 8
+ n v 0 + 7 v 0 τ + 7 2 v 0 τ 2 2 ! + 7 3 v 0 τ 3 3 ! + 7 4 v 4 0 τ 4 4 !
+ 7 5 v 5 0 τ 5 5 ! + 7 6 v 6 0 τ 6 6 ! + 7 7 v 7 0 τ 7 7 ! + o τ 8 + o τ 6 .
Equating the coefficients of the lowest power of τ in the last formula to zero, we obtain the system of equations
α β γ d p q m n = 0 , β + 2 γ + 3 d + 4 p + 5 q + 6 m + 7 n = 0 , 1 2 ! β + 4 2 ! γ + 9 2 ! d + 4 2 2 ! p + 5 2 2 ! q + 6 2 2 ! m + 7 2 2 ! n = τ 2 , 1 3 ! β + 8 3 ! γ + 27 3 ! d + 4 3 3 ! p + 5 3 3 ! q + 6 3 3 ! m + 7 3 3 ! n = 0 , 1 4 ! β + 16 4 ! γ + 81 4 ! d + 4 4 4 ! p + 5 4 4 ! q + 6 4 4 ! m + 7 4 4 ! n = 0 , 1 5 ! β + 32 5 ! γ + 243 5 ! d + 4 5 5 ! p + 5 5 5 ! q + 6 5 5 ! m + 7 5 5 ! n = 0 , 1 6 ! β + 64 6 ! γ + 729 6 ! d + 4 6 6 ! p + 5 6 6 ! q + 6 6 6 ! m + 7 6 6 ! n = 0 , 1 7 ! β + 2 7 7 ! γ + 3 7 7 ! d + 4 7 7 ! p + 5 7 7 ! q + 6 7 7 ! m + 7 7 7 ! n = 0 .
Solving this system of equations, we can obtain α = 469 90 τ 2 , β = 223 10 τ 2 , γ = 879 20 τ 2 , d = 949 18 τ 2 , p = 41 τ 2 , q = 201 10 τ 2 , m = 1019 180 τ 2 , n = 7 10 τ 2 . So, relation (28) is proved. Similarly, one can prove relation (29). Theorem 7 is proved.
Applying Taylor’s decomposition on five points (15), Equation (2), and Formulas (28) and (29) and neglecting small terms, we get the sixth-order approximation difference scheme.
We obtain the sixth order of approximation difference schemes by applying Taylor decomposition on five points (15), Equation (2), and Formulas (28) and (29), and neglecting small terms.
1 τ 4 u k + 2 4 u k + 1 + 6 u k 4 u k 1 + u k 2 + 237 360 a ( t k ) u k + 31 180 a ( t k 1 ) u k 1 + a ( t k + 1 ) u k + 1 1 720 a ( t k 2 ) u k 2 + a ( t k + 2 ) u k + 2 = 237 360 f ( t k ) + 31 180 f ( t k 1 ) + f ( t k + 1 ) 1 720 f ( t k 2 ) + f ( t k + 2 ) , 2 k N 2 , u 0 = φ , u N = ω , τ 2 ( 469 90 u 0 223 10 u 1 + 879 20 u 2 949 18 u 3 + 41 u 4 201 10 u 5 + 1019 180 u 6 7 10 u 7 ) = y ( 0 ) , τ 2 ( 469 90 u N 223 10 u N 1 + 879 20 u N 2 949 18 u N 3 + 41 u N 4 201 10 u N 5 + 1019 180 u N 6 7 10 u N 7 ) = y ( T )
for the numerical solution of boundary value problem (2). It can be seen that, for the approximate solution of problem (27), the accuracy order of this difference method is 6. We used the sixth order of approximation difference scheme (31) with different values of τ , namely τ = 1 40 , 1 80 , 1 160 . □
Remark 6.
Note that (see Table 6). It is observed that for difference schemes (31), the value of errors between the exact solution and approximate solution decreases by a factor of about 1 / 64 if N is doubled. Thus, these difference schemes have an accuracy order of 6.

4. Conclusions and Our Future Plans

1. Two boundary value problems for fourth-order differential equations with dependent coefficients are investigated in this article. To solve these problems, the fourth- and sixth-order approximation finite difference schemes generated by Taylor’s decomposition on five points are constructed and investigated. The results of numerical experiments support the numerical results. Our results and methods can be utilised to extend nonlinear and partial differential equations in the future.
2. We established and investigated highly accurate four-step difference schemes for the numerical solution of boundary value problems related to general differential equations of the fourth order.
d 4 u ( t ) d t 4 + d ( t ) d 3 u ( t ) d t 3 + c ( t ) d 2 u ( t ) d t 2 + b ( t ) d u ( t ) d t + a ( t ) u ( t ) = f ( t ) , 0 < t < T .
Here, a ( t ) , b ( t ) , c ( t ) , d ( t ) , and f ( t ) are given smooth functions defined on [ 0 , T ] .
Here, we have smooth given functions a ( t ) , b ( t ) , c ( t ) , d ( t ) , and f ( t ) defined on [ 0 , T ] .
3. We developed and investigated highly accurate four-step difference schemes for the numerical solution of both local and non-local problems related to abstract fourth-order elliptic differential equations:
d 4 u ( t ) d t 4 + A ( t ) u ( t ) = f ( t ) , 0 < t < T
given the self-adjoint positive definite operators A ( t ) in a Hilbert space H. Note that we will be able to determine the stability of these difference schemes via the operator approach in [16].

Author Contributions

All authors contributed equally to this work. A.A. and I.M.I. wrote the main text of the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The publication was prepared with the support of the “RUDN University Program 5-100” and published under target program BR05236656 of the Science Committee of the Ministry of Education and Science of the Republic of Kazakhstan.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
IBVPInitial Boundary Value Problem
IVPInitial Value Problem
BSBounded Solution
ODESOrdinary Differential Equation
PDESPartial Differential Equation
DEDifferential Equation
FSADSsFirst- and Second-Order Accuracy Difference Schemes
ESExact Solution
FADSFirst-Order Accuracy Difference Scheme
SADSSecond-Order Accuracy Difference Scheme
ASApproximate Solution
SESystem of Equations
SLEsSystem of Linear Equations
DSDifference Scheme

References

  1. Ashyralyev, A.; Sobolevskii, P.E. On the two new approaches for the construction of the high order approximation difference schemes for the second-order differential equations. Funct. Differ. Equ. 2003, 10, 333–405. [Google Scholar]
  2. Ashyralyev, A.; Sobolevskii, P.E. On the two-step the High-order approximation difference schemes for the second-order differential equations. Proc. Dyn. Syst. Appl. 2004, 4, 528–535. [Google Scholar]
  3. Ashyralyev, A.; Sobolevskii, P.E. New Difference Schemes for Partial Differential Equations; Birkhauser Verlag: Basel, Switzerland; Boston, MA, USA; Berlin, Germany, 2004. [Google Scholar]
  4. Boureghda, A. Numerical solution of the oxygen diffusion in absorbing tissue with a moving boundary. Commun. Numer. Methods Eng. 2006, 22, 933–942. [Google Scholar] [CrossRef]
  5. Boureghda, A.; Djellab, N. Du Fort-Frankel Finite difference scheme for solving of oxygen diffusion problem inside one cell. J. Comput. Theor. Transp. 2023, 52, 363–373. [Google Scholar] [CrossRef]
  6. Ashyralyev, A.; Arjmand, D. A note on the Taylor’s decomposition on four points for a third-order differential equation. Appl. Math. Comput. 2007, 188, 1483–1490. [Google Scholar] [CrossRef]
  7. Ashyralyev, A.; Arjmand, D.; Koksal, M. Taylor’s decomposition on four points for solving third-order linear time-varying systems. J. Frankl. Inst. Eng. Appl. Math. 2009, 346, 651–662. [Google Scholar] [CrossRef]
  8. Arjmand, D. Highly Accurate Difference Schemes for the Numerical Solution of Third-Order Ordinary and Partial Differential Equations. Master’s Thesis, KTH Royal Institute of Technology, Stockholm, Sweden, 2010. [Google Scholar]
  9. Ashyralyeva, M.A. A note on the Taylor’s decomposition on five points and its applications to differential equations. Funct. Differ. Equ. 2006, 13, 357–370. [Google Scholar]
  10. Timoshenko, S.P. Theory of Elastic Stability; McGraw-Hill: New York, NY, USA, 1961. [Google Scholar]
  11. Soedel, W. Vibrations of Shells and Plates; Dekker: New York, NY, USA, 1993. [Google Scholar]
  12. Dulácska, E. Soil settlement effects on buildings. In Developments in Geotechnical Engineering; Elsevier: Amsterdam, The Netherlands, 1992; Volume 69. [Google Scholar]
  13. Anderson, D.R.; Davis, J.M. Multiple solutions and eigenvalues for third-order right focal boundary value problem. J. Math. Anal. Appl. 2002, 267, 135–157. [Google Scholar] [CrossRef]
  14. Baxley, J.; Haywood, L.J. Nonlinear boundary value problems with multiple solutions. Nonlinear Anal. 2001, 47, 1187–1198. [Google Scholar] [CrossRef]
  15. Hao, Z.; Liu, L. A necessary and sufficient condition for the existence of positive solution of fourth-order singular boundary value problems. Appl. Math. Lett. 2003, 16, 279–285. [Google Scholar] [CrossRef]
  16. Agarwal, R.P. Focal Boundary Value Problems for Differential and Difference Equations; Kluwer Academic: Dordrecht, The Netherlands, 1998. [Google Scholar]
  17. Agarwal, R.P.; O’Regan, O.; Wong, P.J.Y. Positive Solutions of Differential, Difference, and Integral Equations; Kluwer Academic: Dordrecht, The Netherlands, 1998. [Google Scholar]
  18. Zill, D.G.; Cullen, M.R. Differential Equations with Boundary-Value Problems, 5th ed.; Brooks/Cole: Pacific Grove, CA, USA, 2001. [Google Scholar]
  19. Wong, P.J.Y. Triple positive solutions of conjugate boundary value problems. Comput. Math. Appl. 1998, 36, 19–35. [Google Scholar] [CrossRef]
  20. Leray, J.; Schauder, J. Topologie et Equations Fonctionels. Ann. Sci. École Norm. Sup. 1934, 51, 45–78. [Google Scholar] [CrossRef]
  21. Graef, J.R.; Yang, B. On a nonlinear boundary value problem for fourth order equations. Appl. Anal. 1999, 72, 439–448. [Google Scholar] [CrossRef]
  22. Hibbeler, R.C.; Nolan, G. Structural Analysis; Prentice Hall: Upper Saddle River, NJ, USA, 1997. [Google Scholar]
Table 1. Errors of difference schemes (3) and (4).
Table 1. Errors of difference schemes (3) and (4).
τ = 1 N N = 80 N = 160 N = 320
Difference Scheme (3)6.4210 × 10−61.6149 × 10−64.0506 × 10−7
Difference Scheme (4)1.2318 × 10−53.0893 × 10−67.7417 × 10−7
Table 2. Errors of difference schemes (12) and (13).
Table 2. Errors of difference schemes (12) and (13).
τ = 1 N N = 80 N = 160 N = 320
Difference Scheme (12)4.7729 × 10−73.2983 × 10−82.1517 × 10−9
Difference Scheme (13)3.7069 × 10−72.6319 × 10−81.7380 × 10−9
Table 3. Errors of difference schemes (2).
Table 3. Errors of difference schemes (2).
τ = 1 N N = 40 N = 80 N = 160
Difference Scheme (2)5.6162 × 10−71.8675 × 10−73.2178 × 10−8
Table 4. Errors of difference schemes (21).
Table 4. Errors of difference schemes (21).
τ = 1 N N = 40 N = 80 N = 160
Difference Scheme (21)1.5237 × 10−72.5606 × 10−94.0844 × 10−11
Table 5. Errors of difference schemes (25) and (26).
Table 5. Errors of difference schemes (25) and (26).
τ = 1 N N = 80 N = 160 N = 320
Difference Scheme (25)8.7410 × 10−65.8235 × 10−73.7504 × 10−8
Difference Scheme (26)8.2124 × 10−65.4930 × 10−73.5437 × 10−8
Table 6. Errors of difference scheme (31).
Table 6. Errors of difference scheme (31).
τ = 1 N N = 40 N = 180 N = 160
Difference Scheme (31)7.8925 × 10−71.2332 × 10−81.8981× 10−10
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

Ashyralyev, A.; Ibrahım, I.M. High-Order, Accurate Finite Difference Schemes for Fourth-Order Differential Equations. Axioms 2024, 13, 90. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms13020090

AMA Style

Ashyralyev A, Ibrahım IM. High-Order, Accurate Finite Difference Schemes for Fourth-Order Differential Equations. Axioms. 2024; 13(2):90. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms13020090

Chicago/Turabian Style

Ashyralyev, Allaberen, and Ibrahim Mohammed Ibrahım. 2024. "High-Order, Accurate Finite Difference Schemes for Fourth-Order Differential Equations" Axioms 13, no. 2: 90. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms13020090

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