ALL Metrics
-
Views
-
Downloads
Get PDF
Get XML
Cite
Export
Track
Research Article

Advanced Numerical Methods for the Fisher-Kolmogorov Reaction-Diffusion Equation: A Quintic Hermite Splines Approach with Richardson Extrapolation

[version 1; peer review: awaiting peer review]
PUBLISHED 24 Oct 2025
Author details Author details
OPEN PEER REVIEW
REVIEWER STATUS AWAITING PEER REVIEW

Abstract

This study introduces a robust numerical method for addressing the fourth-order Fisher-Kolmogorov reaction-diffusion equation, employing a combination of quintic Hermite splines and Richardson extrapolation. The proposed technique effectively transformed the original equation into a system of linear and nonlinear equations, achieving sixth-order convergence in space and fourth-order convergence in time. A thorough stability analysis confirmed the unconditional stability of the method, ensuring that the numerical solutions remained accurate throughout various perturbation scenarios. Extensive numerical experiments validated the performance of the method, revealing significant improvements in accuracy compared to existing approaches. The findings underscore the applicability of the method in mathematical biology and related fields, where the precise modelling of dynamic processes is crucial. Overall, this study contributes to the advancement of numerical techniques for complex differential equations, demonstrating enhanced reliability and precision in computational simulations.

Keywords

Fisher-Kolmogorov Reaction-Diffusion Equation, Quintic Hermite Splines, Richardson Extrapolation, Stability and Convergence of the Method.

1. Introduction

Various types of non-linear partial differential equations (PDEs) are employed to analyze phenomena in real-life applications, with non-linear advection-diffusion20 and reaction-diffusion equations receiving significant attention (see20,21,47). These equations have been studied using a variety of numerical methods; however, these techniques often encounter challenges. For instance, Rajan and Reddy1 proposed a generalized regularization approach to address singularly perturbed parabolic PDEs, which exhibit complex behavior owing to their small perturbation factors. They discussed the characteristics of singular perturbations in parabolic PDEs and the associated numerical challenges, such as boundary layers and steep gradients. Furthermore, the behavior of small solutions in a reaction-diffusion model problem was studied near a co-dimension 2 point in.2 The focus on co-dimension 2 points may oversimplify the complex dynamics present in reaction-diffusion models. This could limit the understanding of small solutions and their behaviors in more general contexts. Building on these insights, we introduced a novel regularization strategy aimed at enhancing the solution stability and accuracy by modifying the original PDE to mitigate the effects of singular perturbations.

In addition, numerous researchers have explored various non-linear PDEs using distinct numerical techniques. For example,3 enhanced the numerical analysis of non-linear PDEs, particularly in the context of porous media. Dahab et al.4 investigated the behavior of the Casson nanofluid flow over a nonlinearly heated porous medium influenced by magnetic fields (MHD), shedding light on the effects of an extended surface with suction/injection. The numerical solutions for higher-order PDEs in two-dimensional coupled systems were examined using finite difference and finite element methods.5 Furthermore, Mebarek6 explored the convective heat-transfer properties of titanium nanofluids using various base fluids in a cylindrical annulus with discrete heat sources. Clark and Meyer7 focused on two-signed solutions for a specific class of second-order semi-linear parabolic PDEs with non-Lipschitz nonlinearities. Despite these advancements, numerical approaches for solving non-linear PDEs can yield unreliable results owing to their heavy reliance on the initial conditions. Additionally, the complexities of the boundary conditions and high computational demands may restrict their practical applications, highlighting the need for innovative solutions, such as the one we propose.

Building on the highlighted challenges, the application of numerical methods extends to fuzzy nonlinear equations. For instance, Abbasbandy and Asady8 presented a variation of Newton’s method tailored for these equations, which is relevant for uncertain systems and decision-making processes. Furthermore, Arora et al.9 introduced a stable variable mesh approach for one-dimensional nonlinear parabolic PDEs, and Dehghan et al.10 developed a numerical simulation technique that integrates the finite element method with proper orthogonal decomposition (POD) to model and mitigate groundwater contamination. Their work emphasized the complexities involved in accurately simulating contamination processes, underscoring how various factors, such as source strength and hydrodynamic conditions, can influence transport dynamics.

In addition to these innovative methodologies, the significance of reaction-diffusion equations is underscored in the work of,11 which provides an overview of the extended Fisher-Kolmogorov equation, particularly relevant in mathematical biology for modeling population dynamics and spreading processes. Further contributions include Samir et al.,12 who derived exact wave solutions for a fourth-order nonlinear PDE describing the dynamics of optical fiber pulses, thereby revealing implications for optical communication technologies. Knibb and Scraton13 presented a collocation method designed for nonlinear parabolic PDEs, which demonstrated advantages over traditional techniques in terms of flexibility and accuracy. Moreover, Abbasbandy14 demonstrated the effectiveness of the variational iteration method for solving nonlinear Klein-Gordon equations, highlighting its broader potential despite the challenges in convergence and stability when applied to more complex equations.

Continuing this discourse, Gavete et al.15 discussed an efficient numerical method for second-order nonlinear elliptic PDEs, while Mansour16 investigated traveling wave solutions for nonlinear reaction-diffusion equations, which are crucial for understanding spatial phenomena across scientific disciplines. Their numerical simulations elucidated how varying parameters influence the behavior of traveling waves, providing insights applicable to population dynamics, chemical reactions, and ecological models. Zhou et al.17 further explored exact solitary wave solutions for the generalized Fisher equation, which is essential for modeling population dynamics and chemical reactions.

Beitia et al.18 developed and analyzed effective particle methods for solving Fisher-Kolmogorov equations, which are vital for modeling biological invasion and brain tumor dynamics. Their particle-based numerical method enables the simulation of complex dynamics, emphasizing computational efficiency and flexibility, and yielding insights into tumor growth mechanisms with potential implications for treatment strategies.

However, despite the promising advancements in these studies, we recognize challenges in accurately obtaining solutions for various types of nonlinear reaction-diffusion parabolic equations. Each equation exhibits distinct characteristics that reveal different aspects of biological and physical phenomena. However issues such as the boundary layers, associated perturbation parameters, and nonlinearities complicate the solution process. This underscores the necessity for more effective methods to enhance the solution reliability. In light of these considerations, this study focuses on examining the solutions of a fourth-order nonlinear reaction-diffusion parabolic PDE, known as the Fisher-Kolmogorov equation, with the objective of developing strategies to improve stability and accuracy in the presence of singular perturbations. The fourth-order Fisher-Kolmogorov equation discussed in this paper is presented in the following form:

(1)
ut+βuxxxxuxx+h(u)=0,(x,t)(a,b)×(0,T)
where β>0 and nonlinear source function h(u)=uu3 subjected to the initial and boundary conditions, respectively, is defined as
(2)
u(x,0)=u0(x),x(a,b);u(a,t)=g1(t),u(b,t)=g2(t);uxx(a,t)=g3(t),uxx(b,t)=g4(t).

According to,19 when 0<β1 , Eq. (1) is called the extended Fisher-Kolmogorov equation: When β=0 , Eq. (1) is termed the standard Fisher-Kolmogorov equation and was developed by Fisher and Kolmogorov to model complex biological processes (see20,21). According to the investigation in,22 the requirement β>0 was chosen for the stability of this equation at short wavelengths. These findings indicate that the various physical phenomena described by this equation are governed by the perturbation parameter.

Building on this foundational understanding, various physical phenomena, including pattern formation owing to propagating fronts,23 spatial-temporal chaos in bistable systems,24 chemical waves,25 phase transitions,26 front propagation near Lipschitz points,27 instabilities in liquid crystals,28 and propagating waves in reaction-diffusion systems,29 are described by the EFK equation. According to,30 this equation approaches critical amplitudes near certain degenerate points. Additionally, the transition from periodic patterns predicted by the Ginzburg–Landau equation to multi-bump solutions anticipated by the EFK equation was discussed in.31 Furthermore, different investigators have explored various behaviors associated with the EFK equation, such as periodicity,32 chaotic behavior,33 stationary states,34 solution uniqueness,35 kink existence,36 and traveling wave solutions.

To deepen our understanding of these phenomena, the solution of the EFK equation has been analyzed using variational methods to investigate saddle-focus equilibrium connections (see37,46). These techniques include a variety of approaches, including the topological shooting method for kink existence and property analysis,38 interpolating element-free Galerkin method,39 orthogonal cubic spline collocation method,40 quintic B-spline collocation method,41 mixed finite element method,11 quintic trigonometric differential quadrature method,42 finite element method,43 Galerkin approximation technique,44 and compact difference method.45 In addition quasi-exact solutions have been explored along with local radial basis functions and finite difference methods (see46,47), respectively.

Although the analysis of the EFK equation offers valuable insights, it is crucial to acknowledge the limitations of the employed methods. Techniques, such as variational methods and various collocation approaches, often struggle with complex phenomena, including chaotic behavior and traveling wave solutions. For example, mixed finite-element methods frequently encounter issues related to stability and accuracy, particularly near critical points or degenerate regions. Although variational methods provide insights into saddle-focus equilibria, they typically require significant computational resources and may not fully capture the complexities of multibump solutions. This reliance on specific numerical techniques can hinder the generalization of results across different scenarios, complicating the exploration of solution uniqueness and periodicity.

To address these challenges, this study introduces a novel approach that integrates quintic Hermite spline techniques with Richardson extrapolation, aiming to enhance the analysis solutions of the EFK equation. This combined framework seeks to deliver robust solutions that effectively address the complexities of various physical phenomena described by the EFK equation. Quintic Hermite spline methods have shown high-order convergence in solving nonlinear partial differential equations, as evidenced in previous studies (see48,49). For instance, Arora and Kaur50 presented an efficient scheme utilizing quintic Hermite interpolating polynomials for the Burgers equation, which significantly improved both computational accuracy and efficiency. Their subsequent work by Arora et al.48 further validated the robustness of quintic Hermite splines, demonstrating their applicability in a variety of fluid dynamics problems. Additionally, Jain et al.49 effectively employed collocation methods with quintic Hermite splines to address the Benjamin–Bona–Mahony–Burgers equation, demonstrating the versatility of these techniques in tackling nonlinear phenomena. Furthermore, Alba-Fernández et al.51 introduced a bootstrap algorithm using trigonometric Hermite spline interpolation, highlighting the utility of the Hermite spline methods in statistical analysis. Collectively, these contributions emphasize the effectiveness and versatility of Hermite spline techniques across both mathematical and applied domains.

Moreover, this work effectively utilizes Richardson extrapolation to enhance the accuracy of numerical solutions. This technique accelerates the accuracy of solutions for various differential equations, as documented in several studies. For instance, Merga and Chemeda52 presented a modified Crank-Nicolson scheme that incorporates Richardson extrapolation for the one-dimensional heat equation, significantly improving the solution accuracy and stability. Similarly, Siraj et al.53 applied a fourth-order stable central difference method with Richardson extrapolation to address second-order self-adjoint singularly perturbed boundary-value problems, demonstrating enhanced accuracy in challenging scenarios. Additionally, Chemeda et al.54 employed a compact finite-difference scheme with Richardson extrapolation for Fisher’s equation, demonstrating the effectiveness of the method in capturing critical dynamics. Together, these studies highlight the Richardson extrapolation as a powerful technique for enhancing the accuracy and reliability of numerical solutions in various mathematical and engineering contexts.

Based on these findings, the proposed method combines quintic Hermite spline techniques with Richardson extrapolation to offer superior accuracy and stability compared with previously discussed techniques. This approach leverages the smoothness and simplicity of quintic splines, achieving super-convergence and significantly enhancing solution precision. Furthermore, it improves the efficiency of the collocation technique by interpolating the function and its derivatives up to the second order at the nodal sites. Unlike traditional methods, which often struggle with stability and accuracy, this combined approach effectively reduces discretization errors through Richardson extrapolation, making it especially powerful for high-order nonlinear equations. This represents a significant advancement in the numerical analysis of these challenging problems.

This paper also discusses how this method enhances accuracy through a uniform mesh in the temporal direction and a non-uniform mesh in the spatial direction. In addition, it analyzes the traveling wave behavior of the solution using various parameter values and nonlinear source functions. To address these perspectives, the paper is structured as follows: Section 1 introduces the topic; Section 2 formulates the current method; Section 3 discusses the stability and convergence analysis; Section 4 outlines the criteria for measuring the accuracy and rate of convergence of the present method; Section 5 presents numerical experiments; Section 6 discusses and analyzes the findings; and Section 7 concludes the study.

2. Formulating of current numerical techniques

2.1 Quintic Hermit Splines

To address fourth-order non-linear equations, which involve a differential equation alongside four constraints, numerical techniques leverage these constraints to discretize the equation effectively. Specifically, the Quintic Hermite techniques we re employed. Quintic Hermite splines inherently include the discretized form of the differential equation at collocation points along with two boundary constraints for the interpolating polynomial. To obtain such a scheme, the fourth-order differential equation was split into a second-order form by introducing a twice continuously differentiable function, thereby reducing the constraints to two for each interpolating polynomial. To execute this, the following theorem is considered a necessary part of implementing the proposed technique:

Theorem 1:

The Hermite interpolation problem of order nN is applicable to two-point boundary value problems.19

Consider the non-linear EFK type Equation (1). To implement the proposed technique, we introduce a twice continuously differentiable function v(ζ,t) such that:-

v(ζ,t)=uζζ(ζ,t).

As investigated in,55 the induced coupled system of differential equations of our governing problem is given as

(3)
v+uζζ=0,
(4)
utβvζζ+v+f(u)=0,
where f(u)=uum for m, subject to the following initial and boundary conditions:
(5)
u(ζ,0)=u0(ζ),
(6)
u(a,t)=g1(t),u(b,t)=g2(t).
(7)
v(a,t)=0,v(b,t)=0.

These equations are the transformed forms of EFK into a system comprising one linear equation and one semi-linear equation that involves two functions, u and v.

2.2 The hybrid Quintic Hermite Spline collocation method

The hybrid technique employs semi-discretization methods to discretize both the time and spatial directions. This two-step approach was utilized for a second-order coupled system of singularly perturbed partial differential equations (PDEs):

a. Time discretization

For temporal discretization, we utilized the Crank-Nicolson scheme, a specific instance of the weighted finite difference method, as investigated in.56 This scheme takes advantage of the nearest neighboring points to maintain continuity in behavior, avoiding any time discontinuities (see57). To apply this technique to the reduced coupled system of the EFK equation, we define the following terms.

Let us consider that both vn+1 and un+1 are represent the approximating polynomial function at the current time, tn+1 . Also, let t=TN,N>0, for tn=nt for n=0,1,2,,N , be the cell of the time step, and N be the maximum of the sub-interval in the temporal direction. Since, for any function F, we have

(8)
Fn+12=Fn+1+Fn2

Hence, using the above condition, the semi-discretized forms of our coupled systems are given as

(9)
vn+12=uζζn+12un+1unt=βvζζn+12vn+12(unu)n+12
with the corresponding boundary conditions given in Eqs. (6) and (7), respectively.

b. Spatial discretization

Let a=ζ0<ζ1<ζ2<<ζM=b, where M is the maximum number of subintervals of I in the spatial direction. This indicates that we have a non-uniform grid spacing ζiI=[a,b] for which hi=ζi+1ζi . Hence, our subintervals are given by Ii=[ζi,ζi+1] . For each sub-interval, Ii , six collocation points were selected, including two boundary points. These collocation points are the roots of a shifted Legendre polynomial of order six, which is not equidistant from the mean. Details of these collocation points can be found in.58 In the spatial direction, we utilized the quintic Hermite interpolating polynomials pi(ζ) , pi¯(ζ) and pi̿(ζ) that introduced in19 to approximate the trial function within each partition Ii of the solution domain. The approximate function is defined as follows:

(10a)
u(ζ)=u(ζi)i=12Pi(ζ)+u(ζi)i=12pi¯(ζ)+u(ζi)i=12pi̿(ζ)
where pi(ζ) is the interpolated function u(ζ) at each nodal point of sub-interval Ii and pi¯(ζ) and pi̿(ζ) are the interpolated slope and curvature at the nodal points, respectively. As in,19 they are, respectively, given by
(10b)
pi(ζ)={6(ζi+1ζ)5(ζi+1ζi)515(ζi+1ζ)4(ζi+1ζi)4+10(ζi+1ζ)3(ζi+1ζi)3,ζiζζi+16(ζζi1)5(ζiζi1)515(ζζi1)4(ζiζi1)4+10(ζζi1)3(ζiζi1)3,ζi1ζζi0,otherwise;pi¯(ζ)={3(ζi+1ζ)5(ζi+1ζi)47(ζi+1ζ)4(ζi+1ζi)3+4(ζi+1ζ)3(ζi+1ζi)2,ζiζζi+13(ζζi1)5(ζiζi1)4+7(ζζi1)4(ζiζi1)34(ζζi1)3(ζiζi1)2,ζi1ζζi0,otherwise;pi̿(ζ)={2(ζi+1ζ)5(ζi+1ζi)3(ζi+1ζ)4(ζi+1ζi)2+2(ζi+1ζ)3(ζi+1ζi),ζiζζi+12(ζζi1)5(ζiζi1)3+(ζζi1)4(ζiζi1)3+2(ζζi1)3(ζiζi1)2,ζi1ζζi0,otherwise.

To apply orthogonal collocation within each subinterval Ii , a new variable ω is introduced, such that ω=ζζihi where ω varies from 0 to 1 as ζ varies from ζi to ζi+1 . This transformation reduces the polynomial structure in Eq. (10) into the tabular form shown in Table 1. The Quintic Hermit polynomials are presented in the interval [ζi,ζi+1] in Table 1, and the values of the Hermit splines and their derivatives are presented in Table 2 at ω={0,1} . Hence, using this idea, the approximating function at each time tn+1 in each subinterval is taken as

(11)
un+1(ω)=i=16cin+1Hi(ω)vn+1(ω)=i=16din+1Hi(ω)
where cin+1 and din+1 are constants of approximations.

Table 1. Presentation of quintic Hermit splines as defined in.19

i Hi Hi Hi
1 110ω3+15ω46ω5 30ω2+60ω330ω4 60ω+180ω2120ω3
2 h(ω6ω+8ω43ω5) h(118ω2+32ω315ω4) h(36ω+96ω260ω3)
3 h22(ω23ω3+3ω4ω5) h22(2ω9ω2+12ω35ω4) h22(218ω+36ω220ω3)
4 h22(ω32ω4+ω5) h22(3ω28ω3+5ω4) h22(6ω24ω2+20ω3)
5 10ω315ω4+6ω5 30ω260ω3+30ω4 60ω180ω2+120ω3
6 h(4ω3+7ω43ω5) h(12ω2+28ω315ω4) h(24ω+84ω260ω3)

Table 2. Value of quintic Hermite splines and corresponding first and second order derivatives at boundary points as evaluated in.19

i Hi Hi Hi
ω=0 ω=1 ω=0 ω=1 ω=0 ω=1
1 1 0 0 0 0 0
2 0 0 h 0 0 0
3 0 0 0 0 h2 0
4 0 0 0 0 0 h2
5 0 1 0 0 0 0
6 0 0 0 h 0 0

The process of selecting collocation points is crucial in the Hermit collocation methods. To obtain these colocation points, we use the zeros of the orthogonal polynomials called Jacobi polynomials. The Legendre and Chebyshev polynomials are special cases of Jacobi polynomials. Hence, in this study, we utilized the zeros of the shifted Legendre polynomials as collocation points.

However, at each of these collocation points, the semi-discretization of the aforementioned equation by substituting Eq. (8) into Eq. (9) in the coupled system, we obtain

(12)
vn+1+vn2=[uζζn+1+uζζn2]un+1un=βt[vζζn+1+vζζn2]t[vn+1+vn2]t2[fn+1(u)+fn(u)].

As investigated in,59 the quasi-linearization of f(u)=umu where m has been obtained using the Taylor series approximation, and it is given as

(13)
um(t+t)=um(t)+t(um)t+O(t)2=um(t)+tmum1ut+O(t)2

By using finite difference approximation of u(t+t) with order two, we have:

u(t+t)=u(t)+tut+O(t)2

Then, neglecting (t)2 , this equation gives us:

(14)
ut=u(t+t)u(t)t

Substituting Eq. (14) into Eq. (13), at t=tn , we obtain

um(tn+t)=um(tn)+mum1(u(tn+t)u(tn))+O(t)2=um(tn)+mum1u(tn+t)+mum(tn)+O(t)2.

By approximating the value of u(tn+1) from the above difference equation, we obtain:

(15)
u(tn+1)=um(tn)+mum1u(tn+t)+mum(tn)+O(t)2.

Using Eq. (15) in Eq. (12) after neglecting the second-order truncation term, we obtain

vn+1+uζζn+12=(vn+uζζn)2un+1un=βt(vζζn+1+vζζn2)t(vn+1+vn2)+t(un+1+un2)t2(mun+1(um1)n(m2)umn).

By rearranging the terms, we obtain the coupled system of equations given by:

(16)
vn+1+uζζn+1=vnuζζnun+1+t2(vn+1+mun+1(um1)nun+1βvζζn+1)=un+t2(βvζζn+(m2)umn+unvn)

Since, from Eq. (11), the discretization of both un+1 and vn+1 in the spatial direction for 0ω1 is given by un+1=i=16cinHi(ω) ;

(17)
vn+1=i=16dinHi(ω).

Since we know that The approximate solution lies in each subinterval Ii , where Hi(ω) are quintic Hermite splines defined over the interval [0, 1]. Therefore, using this concept and Eq. (17), the system of collocation equations obtained after discretization is explained as follows:

(18)
i=16{c4(r1)+in+1Kji+d4(r1)+in+1ηji}=i=16{c4(r1)+inνji+d4(r1)+inαji}
(19)
i=16{c4(r1)+in+1ρji+d4(r1)+in+1γji}=i=16{c4(r1)+inχji+d4(r1)+inλji}+(m2)Δt2[i=16c4(r1)+inHi(ω)]m
where r=1(1)M , j=1(1)4 , ci,&di are the unknown coefficients to be determined. The constant parameters are defined as in,19 and are given by
(20)
ρji=Hi(ωj)Δt2Hi(ωj)+mΔt2Hi(ωj)[i=16c4(r1)+inHi(ωj)]m;Kji=12h2Hi(ωj),ηji=12Hi(ωj),αji=12Hi(ωj);γji=βΔt2h2Hi(ωj)+Δt2Hi(ωj);λji=βΔt2h2Hi(ωj)Δt2Hi(ωj);χji=Hi(ωj)+Δt2Hi(ωj),νji=12h2Hi(ωj).

The total number of variables was 8M + 4, and the collocation equations were 8M. The additional four variables are computed from the boundary conditions of the system of equations. Therefore, by introducing a vector of unknown variables, the compact form of the system of difference equations is

(21)
[A]Yn+1=[B]Yn+fn

where A and B are 8M×8M diagonally dominated matrices with each block Ar and Br for r=2,,M1 of order 8×12 and they are given as:

Yn=[dn(i)cn(i)]8M×1,dn=[d1nd2nd4Mn]4M×1,cn=[c1nc2nc4Mn]4M×1,
A=[A1A2ArAM]8M×8M,B=[B1B2BrBN]8M×8M;
and the source term fn contains both the nonlinear term (m2)Δt2[i=16c4(r1)+inHi(ω)]m and the non-homogeneous boundary data points of the functional values. It is given by:
fn=[0(m2)Δt2[i=16cinHi(ωj)]m0(m2)Δt2[i=16c4(r1)+inHi(ωj)]m0(m2)Δt2[i=16c4(M1)+inHi(ωj)]m]

Each block matrix, Ar and Br also contained a sub-block matrix of order 2×2. The block matrices Ar and Br having the following structures:

Ar=[[ηjiKjiγjiρji]ij],Br=[[αjiνjiλjiχji]ij]
where i=1,2,3,4 and j=1,2,,6 except for the case of r = 1 and M due to known boundary data. This means that for known boundary constraints, all block matrixes ,A1 , AM,B1 , and Br have an order 8×10. Hence, from Eq. (21), Yn+1 is 8M×1 column vectors given by.
(22)
Yn+1=[A1B]Yn+[A1fn]

After determining the unknown parameters ci,&di from the coupled system of difference equations in Eq. (22), we can determine the discretized functional values un+1 and vn+1 in the spatial direction by applying Eq. (17).

However, in the numerical scheme above, the presence of a non-linear term may lead to error propagation during the iteration process to solve the problem. Therefore, we mitigated this issue by linearizing our coupled system of difference equations.

2.3 Linearization of discretized scheme

Let u be considered a locally constant value, denoted as μ, for quasi-linearization of the non-linear term. The implemented technique involves operators Ψ and Φ, which operate on u and v, given as Ψu,v and Φu,v respectively. This operator approximates two sets of values for each iteration at the selected collocation points for the two approximate solutions, ŭ and v˘ . This means that the iterative scheme at each time step approximates a function comprising two component functional values U={u,v} . To obtain this approximate function using the scheme, we employed the component Hermite interpolating polynomial, defined as follows: H={H1˘,H2˘} on C6[a,b] . Let u be the bounded functional value. The operators can then be linearized by considering: μ=maxm,n[u(tn)]m1 .

We assume that U˘={u˘,v˘} is an approximation of U={u,v} . As investigated in,19 we applied the Crank-Nicolson discretization scheme to our operators, which are given as follows:

(23a)
Ψu,v(ωi)=P1(uj(ωi),vj(ωi));Φu,v(ωi)=P2(uj(ωi),vj(ωi));
where Ψ(U(ωi))Ψu,v(ωi)=vj+1(ωi)+uζζj+1(ωi)
Φ(U(ωi)Φu,v(ωi))=uj+1(ωi)t2(βvζζj+1(ωi)vj+1(ωi)+(1)uj+1(ωi));
P1(uj(ωi),vj(ωi))vj(ωi)uζζj(ωi);
P2(uj(ωi),vj(ωi))uj(ωi)+t2(βvζζj(ωi)vj(ωi)+(1)uj(ωi))
j=0,1,2,,N&i=0,1,2,,M.

The matrix notation for the parameters and collocation equations can be expressed as follows:

(23b)
AYj+1=[Ψu,vΦu,v],BYj=[P1jP2j],Yj=[dijcij]
where Yj contains the coefficients of Hermite polynomials. In this approximation technique, both A and B are symmetrical and diagonally dominant. Consequently, every symmetric and diagonally dominant matrix is positive definite. Thus, by employing the Gauss-Seidel iterative method, we can determine the unknown coefficients of Hermite polynomials.

2.4 Order of the proposed method

Because, to discretize Eq. (1), the Crank-Nicolson scheme is applied to discretize the temporal derivative, which has a second-order accurate numerical technique, as indicated in Eq. (13). Subsequently, the quintic hermite spline collocation technique was employed in the spatial direction. The degree of the interpolated quintic hermite splines function on the collocation points is six. Thus, the numerical method resulting from this interpolation has 6th-order-accurate as shown in Eq. (10) in a specific direction. Therefore, by combining these cases, the method proposed in Eq. (16) exhibits a six-order accuracy in the spatial direction and a second-order accuracy in the temporal direction. This implies that the order of accuracy of the proposed method is O(h6+t2).

2.5 Application of Richardson Extrapolation

One advantage of the RE technique is that it enhances the accuracy of the approximate solutions for given differential equation (see52,60). It is also used to accelerate the convergence of the underlying method in solving the provided equation (see53).

However, the goal of this extrapolation is to apply the difference scheme to two consecutive grids and then combine the resulting solutions to achieve higher-order approximations (see54,61). To do this, let us consider a set containing consecutive grid points, which are called Ωhit coarser and Ωhit/2 finer points that are defined on the grid points of the temporal direction. Hence, at each and every one of these grid points, we can obtain a numerical solution of Eq. (1) using the following difference equations:

(24a)
uhit=um(tn)+mum1u(tn+t)+mum(tn)+Ct2+R(hi,t),(xi,tn)Ωhit.
(24b)
uhit/2=um(tn)+mum1u(tn+t)+mum(tn)+C2t2+R(hi,t/2),(xi,tn)Ωhit/2
where R(hi,t) and R(hi,t/2) are the remainders of order O(h6+t4) and C is a constant independent of h and t . To eliminate Ct2 , Eq. (24a) by 1/15 and Eq. (24b) by 16/15 and combining the results, we obtain a more accurate approximate solution using the formulas given by
(25a)
u(tn)=16uhit/2uhit15+O(h6+t4),(xi,tn)Ωhit

This can be extended to both v and u. Based on Eq. (16), we define the values of V and U as:

Vn=vn+uζζn
Un=un+t2(βvζζn+(m2)umn+unvn)

Now using Richardson Extrapolation Formula, we have:

V(tn)=2pVhin/2Vhin2p1+O(h6+tp)
U(tn)=2pUhin/2Uhin2p1+O(h6+tp)
where p is the order of convergence, t/2n/2 , V (tn) and U (tn) represent the extrapolated values of v and u at time tn , Vhin/2 and Uhin/2 are their approximations values using a smaller time step t/2 , Vhin and Uhin are the approximations using the original time step t respectively. In our case, the order of convergence for the time variable was =4. Using this and cutting off the truncation error, the extrapolation for V is given by
(25b)
V(tn)=16Vhin/2Vhin15

Again, by eliminating the truncation error, the extrapolation of U is given by

(25c)
U(tn)=16Uhin/2Uhin15
where V (tn) and U (tn) represent the improved approximations for velocity and displacement, respectively, based on the values computed at the original and halved time steps.

These schemes demonstrate that the order of accuracy of the proposed scheme increases by two in the temporal direction after applying the Richardson extrapolation process. This means that the accuracy of the present scheme improved to the sixth order in the spatial direction and fourth order in the temporal direction following the Richardson extrapolation. The order of accuracy can be expressed as O(h6+t4). This demonstrates that applying Richardson extrapolation doubles the convergence rate of the proposed scheme compared to that of the original scheme.

3. Stability and convergence analysis

For any numerical technique involving iterations for analyzing transient partial differential equations, stability is one of the most important concepts to be considered to ensure control over errors. Otherwise, the accumulation of errors in one stage may overwhelm the solution. Therefore, we must analyze the stability of our numerical method to determine its convergence.

However, the stability of the proposed hybrid numerical algorithm was completely stored in the component matrices of [A1B] which improved the initial solution at each iteration. Consequently, the component matrices A and B depend on the perturbation parameters, grid sizes toward both the spatial and time directions, and Hermite splines adopted for approximation. Therefore, to analyze the stability of the current method, we can identify the magnitude of the eigenvalue of matrix [A1B] in the side-unit circle.

Based on this idea, let us consider λ as the eigenvalue of the matrix [A1B] . So, we observe computationally, the magnitude of these eigenvalues must be bounded by unity. It means we must show the Lax–Richtmyer definition for stability criteria. (i.e |λ|1 ). To show this stability condition we use Lyapunov stability techniques. Another requirement of stability analysis techniques is Von Neumann stability analysis techniques. This technique requires the linearity of the difference equations (see62). So, due to this case, we use Lyapunov stability techniques to analyze the stability of the current numerical scheme. To do this, let us consider the following lemma and theorems given below.

Definition 1:

If the amplification factor associated with the eigenvalues of the coefficient matrices is bounded, this typically indicates that the system of equations is stable.

Lemma 1:

In the proposed difference scheme, given in Eq. (22), all the sequences of fn are bounded.

Proof:

Let us assume that the sequence Yn is bounded. This means that there exists a constant MY such that

YnMYforalln.

We know that A1 is a matrix that transforms vector Yn . If A is invertible, then A1 is bounded. Therefore, there exists a constant MA>0 such that

A1MA

This holds true, because A is a diagonally dominant matrix. Every diagonal dominant matrix is invertible.

Using the triangular inequality, the first term on the right-hand side can be bounded as follows: A1BYnA1BYnMABMY.

Let M1=MABMY . Thus, A1BYnM1 .

Now consider the second term in the right hand side, we have:

A1fnA1fnMAfn.

Combining both terms, we have:

Yn+1A1BYn+A1fnM1+MAfn.

Hence, if Yn is bounded, to prevent Yn+1 from becoming unbounded, fn must also be bounded. Therefore, for a unique constant MY , we have

M1+MAfnMY

Therefore, this show that fn is bounded as n.

Theorem 2:

If each amplification factor of the linear-difference equation in Eq. (22) is bounded, the system of difference equations is stable.

Proof:

To prove this theorem, we utilize Von Neumann’s stability criteria. We assume that the magnitudes of all eigenvalues of A1B and the sequence A1Gj are bounded, where fjGj at jth iterative value. Therefore, for ΖjYj , the system can be rewritten as a first-order difference equation of the form

(26)
Ζj+1=A1BΖj+A1Gj.
where j=0,1,2,,N. Assume that the solution to the difference equation in Eq. (26) can be expressed as a Fourier series expansion as follows:
(27)
Ζj=kΖkei2πkjN;
where i=1,Ζk are the Fourier coefficients, and N is maximum number of grid points in temporal direction. Then, substituting Eq. (26) into Eq. (27), we obtain
(28)
kΖkj+1ei2πkjN=A1BkΖkjei2πkjN+A1Gj;kΖkj+1ei2πkjN=kA1kjei2πkjN+A1Gj

By equating the coefficients of the exponential terms, we defined the amplification factor, denoted as Λk . This factor represents the ratio of the Fourier coefficients at two consecutive time steps, given by

(29)
Λk=Ζkj+1/Ζkj

Now, using Eq. (29) in Eq. (28) and simplifying the results, we obtain

(30)
Λk=A1B+A1Gj/Ζkj

By applying the triangular inequality on Eq. (30), we obtain:

Λk=A1B+A1GjΖkjA1B+A1GjΖkj

To show that Λk is bounded, we draw on the principles established in the proof of Lemma 1. Here, is structured argument.

Because A is a diagonally dominant matrix, A1B is bounded, which means that by Lemma 1, there exists a constant MA such that

A1MA

Consequently, we can assert that:

(i)
A1BA1BMAB

Hence, A1B is bounded. Again, by Lemma 1, assuming Ζkj is bounded and nonzero (to prevent division by zero), there exists a constant MZ such that

ΖkjMZ>0

Thus, we can write:

(ii)
A1GjΖkjA1GjMZ

From the properties of A1 :

A1GjA1GjMAGj

Therefore, combining this to (ii), we obtain:

(iii)
A1GjΖkjA1GjMZA1GjMZ<MAGjMZ

Substituting inequalities (i) and (ii) into the triangular inequalities above, we obtain:

Λk=A1B+A1GjΖkjA1B+A1GjΖkj<MAB+MAGjMZ

This shows that Λk is bounded for all k as long as B and Gj are bounded and Ζkj remains nonzero and bounded. This aligns with the findings of Lemma 1, where boundedness is established under the necessary conditions. Hence, according to Definition 1, the proposed system of difference equations is stable.

Theorem 3:

If the eigenvalues of A1B and sequence A1Gj are bounded, then the difference equation in Eq. (22) is asymptotically stable at all the equilibrium points within the solution domain.

Proof:

To prove this theorem, we use Lyapunov stability analysis techniques. Now, we express the difference equation as a first-order difference equation.

(31)
Ζj+1=A1BΖj+A1Gj

Let Ζj+1ΖjZe be an equilibrium point within the solution domain. From Eq. (31), at equilibrium, we have

(32)
Ze=[IA1B]1A1Gj
where I denotes an identity matrix. In this equation, it is assumed that ( IA1B ) is invertible and the equilibrium point Ze is well defined.

Choose a Lyapunov function L(Zj) that satisfies the following conditions:

L(Zj)=(ZjZe)T(ZjZe).

This function satisfies the conditions L(Zj)0 for all Zj , and L(Zj)=0 if and only if ΖjZe.

The difference between successive values of the Lyapunov function can then be expressed by expanding the results using Eq. (31), we obtain

L=L(Zj+1)L(Zj)=[(A1BZj+A1Gj)Ze]T[(A1BZj+A1Gj)Ze](ZjZe)T(ZjZe)

By Simplifying L , we obtain:

L=(Zj+1Ze)T(Zj+1Ze)(ZjZe)T(ZjZe)

This can be expressed as:

L=(Zj+1Ze)T(A1BI)(ZjZe)+2(ZjZe)TA1Gj

By Theorem 2, the eigenvalues of A1B are bounded. Thus, the matrix A1BI is also bounded. Again, from Lemma 1, all the sequences of Gj are bounded. Thus, the sequence A1Gj is bounded by the assumption.

Therefore, both terms in the expression for L are non-positive, leading to

L0forallZj

If the eigenvalues of A1BI are strictly negative, the first term in L will be negative and the second term will also be non-positive. This implies:

L<0forallZjZe

Hence, the equilibrium point Ze is asymptotically stable.

Lemma 2:

After applying Richardson extrapolation to the Crank–Nicolson scheme, the estimates for the local truncation error en+1 and the global truncation error En+1 are O(t)5 and (t)4 , respectively, as given by:

en+1C(t)5,andEn+1C(t)4.

Theorem 4:

Let U(ζ,t) be a function such that £U=0 and UC , C is an arbitrary constant; then, Ut is also bounded by some constant C (see19,63).

Lemma 3:

Let u(ζ,0) be the positive continuous initial solution of the non-linear reaction–diffusion equation with 0u(ζ,0)1 then, the bounds for solution u(ζ,t) remain constant with time (see19,64,65).

Theorem 5:

If any Hermite interpolation problem defined on at most two distinct points has a unique solution on Ω then any Hermite interpolation problem (regardless of the number of points) has a unique solution in Ω . Consequently, this implies that any Hermite interpolation problem has a unique solution in polynomial space Pn of degree n on I (see65).

Theorem 6:

The univariate Hermite interpolating polynomials are regular for any set of nodes. Moreover, Hermite interpolating polynomials are regular for any nodal set, as well as for any choice of derivatives to be interpolated (see65).

Theorem 7:

Let H˘ be the space of all Hermite interpolating polynomials of order five defined on [0, 1]. The Hermite splines of order five are then bounded with an upper bound of unity. Moreover i=16|Hi(ζ)|6 , for all 0 ≤ ζ ≤ 1 (see19,65).

Theorem 8:

Suppose HHζ2q(ζ) is the piecewise Hermite spline of degree 2q1 over the subinterval [ζi,ζi+1] approximating UC2q[a,b], then H(r)U(r)O(h2qr) , r=1,2,,q1 (see 19,65).

Proof:

Let us define a function

(33)
H˘(ζ)=j=12u(ζ)φj1(ζ)+j=12u(ζ)φj2(ζ)++j=12u(q1)(ζ)φjq(ζ)
(34)
H˘˘(ζ)=j=12v(ζ)j1(ζ)+j=12v(ζ)j2(ζ)++j=12v(q1)(ζ)jq(ζ)
where both sets {φji(ζ)} and {ji(ζ)} are 2q polynomial members, each of degree 2q1 satisfying
(35)
φji(i1)(ζk)=δjk,ji(i1)(ζk)=δjk
where ζk are the node points for k=1,2,3,4,,q and at each of these points, H(ζ) satisfies:
(36)
H(r)(ζ)U(r)(ζ)
for =0,1,2,,q1 , H(r)(ζi)={H˘(r)(ζi),H˘˘(r)(ζi)} and U(r)(ζ)={u(r)(ζ),v(r)(ζ)} with the conditions:
H˘(r)(ζi)=u(r)(ζ). and H˘˘(r)(ζi)=v(r)(ζ).

Considering Eq. (36) and Rolle’s theorem, the expression H(r)(ζ)U(r)(ζ) has r+2 roots in [ζ1,ζ2] , which are given as follows:

ζ1=σ1σ2σ3σr+1σr+2=ζ2

Let us define a function T(ζ)={T1(ζ),T2(ζ)} on the solution domain with collection σis s glued with Y, as its zeroes such that

T(ζ)=[H(r)(ζ)U(r)(ζ)][H(r)(Y)U(r)(Y)]Q(ζ)Q(Y)
where Q(ζ) is defined as a polynomial function of degree 2qr having σis as single zeroes except σ1 and σ2 of equal multiplicity, and Y is any arbitrary point in [ζ1,ζ2] differs from σis . For any r, T(ζ) has r+3 zeros and the degree of polynomial Q(ζ) decreases as r increases. Combine Eq. (35), Eq. (36) and Rolle’s theorem, we obtain (qr1)th derivative of T(ζ) with q+2 zeroes. Thus, assuming that there exists a real ξ[a,b] , such that
(37)
T(2q1)(ξ)=0U(2q)(ξ)U(r)(Y)H(r)(Y)Q(Y)(2q1)!=0U(r)(Y)H(r)(Y)=U(2q)(ξ)(2q1)!Q(Y)

Because, the maximum of |(ζζ1)(ζζ2)| is (ζ2ζ1)24 and Y is an arbitrary point in [ζ1,ζ2] , so, from Eq. (37), we obtain

H(r)(ζ)U(r)(ζ)Mrh2q1
where h=ζi+1ζi and Mr=U(2q)(ξ)22qr(2qr)!, r=0,1,2,.q1 and
r={r+1,ifrisoddr,otherwise.

Hence, for q = 3, the proof satisfies the error bounds for quintic Hermite splines.

Theorem 9:

Let U˘(ζ) be the approximate solution of the function U(ζ) defined in [a,b] such that U(ζ)C6[a,b] and H(ζ) be the quintic Hermite splines interpolating of U(ζ) . Then, the error estimate UU˘ is bounded and defined by

U(ζ)U˘(ζ)C(M0h6+max{h4(M2+M0h2),h4(εtM22+tM02h2+t(1μm)M02h2)})

Proof:

Let U1˘(ζ) and U˘2(ζ) be the appropriate approximating functions defined in theorem five, and U˘={U1˘,U˘2} . Let h be the step length between two successive grids in the spatial direction and H(ζ)={H¯(ζ),H̿(ζ)} is the quintic Hermite spline approximating to functions U(ζ)={u(ζ),v(ζ)}, (i.e. H¯(ζ) is the quintic hermite spline of u(ζ) and H̿(ζ) is the quintic Hermite spline of v(ζ) ). Now, using the operator in this approximation with the maximum norm, we have

ΨU(ζI)ΨH(ζi)=v(ζi)H̿(ζi)+u(ζi)H¯(ζi)
ΦU(ζI)ΦH(ζi)=(u(ζi)H¯(ζi))εt2(v(ζi)H̿(ζi))+t2(v(ζi)H̿(ζi))t(1μm)2(u(ζi)H¯(ζi))

Applying theorem 8 on the above equation, we obtain:

(38)
ΨU(ζI)ΨH(ζi)Ch6+Ch4Ch4(1h2)ΦU(ζI)ΦH(ζi)C(h6+εt2h4+t2h6+t(1μm)2h6)Ch4(εt2+(2+t(2μm)2)h2)

Now, assuming that both ΨH(ζi)=P1(ζi) and ΦH(ζi)=P2(ζi) are fully discretized explicit forms of the differential problem mentioned in Eq.(23a). Then, from Eq. (38), we obtain

ΨH(ζi)ΨU˘(ζi)=P1(ζi)ΨU˘(ζi);
ΦH(ζi)ΦU˘(ζi)=P2(ζi)ΦU˘(ζi);

This implies:

(39)
ΨH(ζi)ΨU˘(ζi)ΨU(ζi)ΨU˘(ζi)Ch4(1h2)ΦH(ζI)ΦU˘(ζI)ΦH(ζI)ΦU˘(ζI)C(h6+εt2h4+t2h6+t(1μm)2h6)Ch4(εt2+(2+t(2μm)2)h2)

Let ΨU˘(ζi)=P1(ζi) and ΦU˘(ζI)=P2(ζi) . Then, the compact matrix form of the proposed scheme becomes

(40)
AYn+1=BYn+fn

By subtracting Eq. (40) from Eq. (21), we obtain

A(Yn+1Yn+1)=B(YnYn)
(Yn+1Yn+1)=A1B(YnYn)

Now, by theorem 2 and theorem 3, A1B where C is some arbitrary constant. Therefore, using this idea and Eq. (39), from the above expressions, we obtain

(41)
Yn+1Yn+1YnYnmax{|P1(ζi)P1(ζi)|,|P2(ζi)P2(ζi)|}max{|ΨH(ζi)ΨU˘(ζi)|,|ΦH(ζI)ΦU˘(ζI)|}Cmax{h4(1h2),h4(εt2+(2+t(2μm)2)h2)}

This demonstrates that the sequences of errors generated in approximation Yn+1 at every grid point are bounded. Additionally, in Hermite interpolation approximations, the error sequence between the two approximation constants must remain bounded. To establish this, the difference between (H˘(ζ),H˘˘(ζ)) and (u(ζ),v(ζ)) must be bounded, as given by:

(42)
H˘˘(ζ)v(ζ)=i=16(di(t)d˘i(t))Hi(ζ)i=16|Hi(ζ)|di(t)d˘i(t)Ch4(M2+M0h2)

Similarly we have:

(43)
H˘(ζ)u(ζ)=i=16(ci(t)c˘i(t))Hi(ζ)i=16|Hi(ζ)|ci(t)c˘i(t)h4(εtM22+(2+t(2μm)2)M0h2)

From the successive application of Eqs. (42) and (43), we obtain

(44)
H(ζ)U(ζ)Cmax{h4(M2+M0h2),h4(εtM22+(2+t(2μm)2)M0h2)}

Because H(ζ) is an approximation of U(ζ) using Hermite interpolation, we can apply the triangle inequality to obtain

U(ζ)U(ζU(ζ)H(ζ+H(ζ)U(ζ

Thus, by applying Theorem 8 and Eq. (44) to the inequality above, we obtain

(45)
U(ζ)U(ζ)CM0h6+Cmax{h4(M2+M0h2),h4(εtM22+(2+t(2μm)2)M0h2)}C{M0h6+Cmax{h4(M2+M0h2),h4(εtM22+(2+t(2μm)2)M0h2)}}

Theorem 10:

Let U(ζ,t) be the approximate solution of the function U(ζ,t)C6[a,b] obtained through Richardson extrapolation on the domain [a,b]×(0,T]. Let H(ζ) Quintic Hermite spline interpolation of U(ζ,t) . Then, the error UU is bounded and is given by

UUC{(t4)+M0h6+Cmax{h4(M2+M0h2),h4(εtM22+(2+t(2μm)2)M0h2)}}

Proof:

Let U(ζ,t) be the exact solution defined in domain. We denote U(ζ,t) as the approximate solution obtained through Richardson extrapolation and H(ζ) as its quintic Hermite spline interpolation.

We first consider the error E(ζ,t)=U(ζ,t)U(ζ,t) . Based on the properties of Richardson extrapolation, we know that the error is reduced significantly. Specifically, we can express the error in terms of the time step t and the spatial step h. Based on the approximation properties and smoothness of U(ζ,t) , we have

UUC1Δt4+C2h6()
where C1 and C2 are constants that depend on the derivatives of U(ζ,t) . Again, using Lemmas 2 and 9, the error introduced by the quintic Hermite spline interpolation can also be bounded. The interpolation error can be represented as
EH(ζ,t)=U(ζ,t)H(ζ)

This error can be expressed as:

EH(ζ,t)=C3max{h4(M2+M0h2),h4(εtM22+2+t(2μm)2M0h2)}()
where M0 and M2 are constants related to the derivatives of U , and ε is a small parameter related to stability. By combining the bounds established in (*) and (**), we obtain
UUC1Δt4+C2h6+C3max{h4(M2+M0h2),h4(εtM22+2+t(2μm)2M0h2)}

This implies:

UUC{Δt4+M0h6+max{h4(M2+M0h2),h4(εtM22+2+t(2μm)2M0h2)}}
for some constant C. Hence, the proposed theorem holds true.

4. Measuring accuracy and rate of convergence

To assess both the accuracy and convergence of the approximated solution, we utilized the following error calculations and norms:

As stated in,19 if the exact solution is unknown, we estimate the error at each nodal point using

eε6MN(i,n)=|UεMN(i,n)UεM2N(i,n)|.

The pointwise maximum absolute error has been calculated by:

EεMN=maxi|eε6MN(i,n)|.

The ε uniform maximum absolute error has been calculated by:

EM,N=maxiEεM,N.

The rate of convergence was evaluated using the double mesh principle and is given as

Rn=Log(EεM,N)Log(EM,2N)Log(2)

As stated in,19 the root mean square error ( L2 ), maximum absolute error ( L ), and global relative error (GRE) are computed using the following formulas:

L2=hi2j=1M|u(ζi,t)|2,L=max1iM|u(ζi,t)|,GRE=i=1M|u(ζi,t)u˘(ζi,t)||u(ζi,t)|.
where u(ζi,t) numerical solutions and u˘(ζi,t) is assumed as the exact solution.

5. Numerical experiments

The following six model issues were examined to gauge the accuracy and validity of the proposed technique.

Example 1:

Consider the EFK equation along with defined initial and boundary conditions.

u(ζ,0)=sin(πζ),4x4;
u(4,t)=0,u(4,t)=0,uζζ(4,t)=0,uζζ(4,t)=0,0tT.

For the perturbation parameter β=1 , this problem has been investigated in two phases: initially, with a homogeneous equation, and later, with a non-homogeneous aspect characterized by source functions outlined as

f(ζ,t)=etsin(πζ)(e2tsin2(πζ)+4+π22).

Example 2:

Evaluate the EFK equation with a Gaussian-shaped initial condition given as

  • i. u(ζ,0)=10eζaxa;

u(a,t)=1,u(a,t)=1,uζζ(a,t)=0,uζζ(4,t)=0,0tT.
  • ii. u(ζ,0)=10eζaxa;

u(a,t)=1,u(a,t)=1,uζζ(a,t)=0,uζζ(4,t)=0,0tT.

Example 3:

Examine the characteristics of the non-linear Fisher’s reaction-diffusion equation:

ut+βuζζζζuζζ+u2u=0,(ζ,t)(4,4)×(0,T);
u(ζ,0)=(1+eζ6)2,4ζ4;
u(4,t)=(1+e45t6)2,u(4,0)=(1+e45t6)2,uζζ(4,t)=0,uζζ(4,t)=0,0tT.

Example 4:

Explore the EFK equation of the form:

ut+βuζζζζuζζ+u3u=0,(ζ,t)(1,1)×(0,T);
  • i) u(ζ,0)=ζ2(1ζ)2, ii) u(ζ,0)=ζ3(1ζ)3,1ζ1 ;

  • ii) u(1,t)=0,u(1,0)=0,uζζ(1,t)=0,uζζ(1,t)=0,0tT.

Example 5:

Evaluate the EFK equation of the form:

ut+βuζζζζuζζ=24u52u32u2(ζ,t)(a,b)×(0,T);
with its exact form of solution is: u(ζ,t)=1ζ+2t .

Example 6:

Evaluate the fourth-order bistable cubic non-linear PDE, represented as:

ut+βuζζζζuζζ=u(uα)(1u)(ζ,t)(a,b)×(0,T);
u(ζ,0)=12+12tanh(2ζ4);
u(a,t)=12+12tanh(2a+(12α)t4),u(b,0)=12+12tanh(2b+(12α)t4).

6. Discussions

In this section, we present a comprehensive analysis of the solutions for various EFK-type equations characterized by different nonlinear functions f(u) using the quintic Hermite spline method combined with Richardson extrapolation. This approach aims to address the complexities associated with the EFK equation and enhance solution accuracy. The numerical results for each model example are presented in graphs and tables to demonstrate the effectiveness of the proposed technique.

Example 1 focuses on solving the EFK equation under well-defined initial and boundary conditions: The initial condition u(ζ,0)=sin(πζ) establishes a foundational profile, whereas the boundary conditions ensure stability within the spatial domain. The analysis unfolds into two phases: addressing a homogeneous equation and subsequently incorporating a non-homogeneous equation with an exact solution u(ζ,t)=exp(t)sin(πζ) . The results, summarized in Table 3, illustrate a notable improvement in the accuracy of our method compared with.19 For instance, if N=128 , the L2 and L norms are 2.003E06 and 1.1658E03 , respectively, confirming the precision achieved through the application of Richardson extrapolation.

Table 3. Comparisons of parameter uniform convergence rate up to T=0.2 , for example, one.

Method β N=16 N=32 N=64 N=128
Result obtained by present method 23 3.113E6 2.9925E6 2.4103E6 2.003E6
25 3.811e6 2.9987E6 2.4803E6 6.4306E4
27 4.834E6 2.8023E6 6.2097E6 1.0053E3
29 4.835E5 8.1703E6 3.40257E5 1.1236E3
212 5.837E5 1.6629E5 3.77910E5 1.1606E3
217 5.8467E5 4.0241E5 4.78294E5 1.1658E3
EN 7.3415E4 8.9243E5 8.33490E5 1.1658E3
RN 1.6113E3 1.1375E3 8.71131E3 2.012E3
Versus
Results obtained by method in19 23 8.316E4 4.203E4 2.1104E4 1.0558E4
25 5.066e3 2.564E3 1.2853E3 6.4306E4
27 7.891E3 4.007E3 2.0095E3 1.0053E3
29 8.795E3 4.475E3 2.2458E3 1.1236E3
211 9.076E3 4.620E3 2.3192E3 1.1606E3
217 9.1167E3 4.640E3 2.3294E3 1.1658E3
EN 9.1167E3 4.640E3 2.3294E3 1.1658E3
RN 9.7429E2 9.9425E1 9.98631E1

Figures 1 and 2 depict the wave solutions u(ζ,t) and v(ζ,t) , showing stable profiles across varying perturbation parameter β . The convergence of these profiles is consistent with the findings in Table 4, where the L2 , L , and Global Relative Error (GRE) values are reported at multiple time levels. Importantly, the numerical solutions approached zero by the 40th time step with a time step size of Δt=0.01 , indicating convergence toward the expected behavior.

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure1.gif

Figure 1. Geometric representation of the behavior of wave solution u(ζ,t) and v(ζ,t) with M=50 and t=0.01 for evaluating example one for linear case with β=0.002 .

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure2.gif

Figure 2. Geometrical representation of surface of wave solution u(ζ,t) and v(ζ,t) with M = 50 and t=0.01 for Example one for linear case with β=0.002 .

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure3.gif

Figure 3. Geometrical representations of behaviors of wave solutions of example one with β=101, t=0.01 and M=64 for linear case.

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure4.gif

Figure 4. Geometrical representations of the surface of the wave solution for example one with β=101, t=0.01 and M=64 for linear case.

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure5.gif

Figure 5. Geometrical representation of behavior of wave solution u(ζ,t),v(ζ,t) and Surface of error of solution u(ζ,t), for example one with =104 , t=0.1 and M=64 .

Table 4. The Comparisons of L2 , L and GRE norm for t=0.01 and t=0.001 for Example one with M=64 for linear case.

MethodTime t=0.01 t=0.001
L2 L GRN L2 L GRN
Result obtained by present method 0.0 0.000.000.000.000.000.00
0.5 2.14516E−086.37461E−078.91491E−065.47251E−094.81836E−076.88431E−08
1.0 4.27712E−075.81319E−068.07116E−065.11306E−096.48513E−075.13658E−08
1.5 5.244112−075.14934E−067.54718E−065.10041E−098.11012E−075.72458E−08
2.0 5.12876E−075.01354E−066.93307E−064.76766E−097.46671E−076.53671E−08
2.5 6.20911E−074.34211E−066.33144E−064.00192E−094.77169E−076.24611E−08
3.0 5.11237E−084.27273E−074.19635E−062.83173E−095.92380E−076.52783E−07
3.5 7.01785E−084.11505E−074.00201E−062.80059E−099.16101E−068.59178E−07
4.0 5.26528E−083.98151E−073.71123E−062.29851E−098.62193E−069.46140E−06
Versus
Results obtained by method in19 0.0 1.42874E−178.88178E−163.56768E−091.42874E−178.88178E−163.56768E−09
0.5 8.24109E−053.12068E−035.01495E−036.17258E−063.92776E−045.14833E−04
1.0 4.84202E−051.99664E−035.05022E−032.17706E−063.42516E−046.00652E−04
1.5 2.76149E−051.34984E−035.14661E−034.41442E−073.47012E−041.23549E−03
2.0 1.46576E−051.01352E−035.53307E−032.36769E−064.06579E−043.32529E−03
2.5 6.26190E−069.56217E−049.09238E−034.07361E−065.87362E−048.69122E−03
3.0 3.44444E−071.17377E−032.22965E−025.93443E−069.52380E−042.23252E−02
3.5 4.49788E−061.65753E−035.66291E−028.31754E−01.53108E−035.67165E−02
4.0 9.32854E−062.48154E−031.42831E−011.16591E−052.42139E−031.43048E−01

Further assessment of spatial discretization is presented in Table 5, demonstrating that reducing the spatial discretization parameter h enhances accuracy, aligning with the theoretical expectations. This confirms that finer discretization contributes to improved precision in numerical solutions across both Δt=0.01 and Δt=0.001 .

Table 5. Comparisons of L2 -norm L -norm and GRE for different partitions of the domain of spatial variables and at specified time in the evaluating example one for T = 2 and M = 80.

Time-steps Norm of errorResults obtained by method in19Results obtained by present method
M = 20M = 40M = 60M = 80M = 20M = 40M = 60 M = 80
t=0.1 L2 1.37406E−034.45938E−042.08576E−041.19453E−042.4581E−065.458E−064.0857E−077.59836E−08
L 8.74229E−037.47418E−037.10195E−036.94779E−035.4721E−053.748E−066.1619E−066.94779E−07
GRE 5.28462E−025.12724E−024.99799E−024.99747E−026.3846E−046.197E−066.8478E−065.6752E−07
t=0.01 L2 1.41692E−042.13303E−051.60035E−057.28243E−057.41892E−074.634E−066.9003E−087.28246E−08
L 2.89695E−031.47745E−031.05749E−034.13368E−036.89613E−064.377E−068.2546E−075.13368E−07
GRE 1.90780E−028.24560E−035.62795E−035.00313E−034.90789E−056.945E−058.12765E−066.00318E−06
t=0.001 L2 1.39713E−042.12319E−053.32691E−065.62754E−074.97911E−087.126E−055.62676E−087.67758E−09
L 6.28584E−048.76524E−044.51042E−042.87972E−047.68685E−079.452E−056.51042E−068.87997E−09
GRE 5.35450E−047.92931E−033.71863E−032.16258E−036.81454E−069.829E−058.71863E−065.56257E−07

The results presented in Table 6 highlight the superior performance of the current method in solving the EFK equation, particularly regarding L -norms. Across all time steps and spatial discretizations, the method consistently yields lower error values compared with both approaches in19 and.39 For instance, with a step size of Δt=0.001 and h=1/10 , the current method achieved an L -norm of 1.4193E07 . This significant improvement in accuracy underscores the effectiveness of the quintic Hermite spline method when paired with Richardson extrapolation, particularly in managing the complexities of boundary value problems.

Table 6. Comparison L ∞-norm of example one at specified time with different step lengths.

Values of T Step sizeBy method in39By Method in19By present method
L L L
t=0.01 t=0.001 t=0.01 t=0.001 t=0.01 t=0.001
T = 1h = 1/107.7195E−22.1542E−22.5716E−039.59093E−043.6717E−061.4193E−07
h = 1/202.1536R−25.8138E−32.57163E−035.45979E−043.6716E−056.7596E−07
h = 1/405.8078E−31.4625E−32.01533E−033.62735E−044.51317E−56.0271E−07
h = 1/801.4567E−33.6573E−41.94303E−032.88109E−045.44673E−055.1826E−08
T = 2h = 1/22.8445E−22.8442E−32.89695E−036.28584E−045.31696E−066.2837E−07
h = 1/57.9425E−37.9380E−41.47745E−038.76524E−047.46142E−063.16614E−07
h= 1/7.52.1437E−32.1386E−41.05749E−034.51042E−042.85711E−065.58191E−07
h = 1/105.3904E−45.3377E−54.13368E−032.87972E−043.13364E−061.67976E−07

Table 7 further emphasizes the advantages of the current method by comparing absolute errors at various spatial points (ζ). The errors obtained using this method are consistently lower than those from method,19 particularly at t=0.5 , where the present method yields an error of 1.12575E06 versus 1.88514E04 from method.19 This demonstrates the method’s robustness in maintaining precision across different spatial coordinates. Furthermore, as demonstrated in Figures 3-4 and 5(f ), the solution for Example 1 is accurately approximated, with Figure 5(e) illustrating the stability of our method at the specified grid points and confirming this accuracy. Overall, the results reinforce the current method’s effectiveness in capturing the dynamics of the EFK equation, showcasing its capability to achieve high accuracy and stability in complex simulations.

Table 7. Comparison of absolute error at different values of ζ in solving example one with t=0.01 and M = 64.

By present method
t ζ = −3 ζ = −2 ζ = −1 ζ = 0 ζ = 1 ζ = 2 ζ = 3
0.51.94262E−052.98467E−056.88514E−061.12575E−062.13925E−053.30463E−052.30463E−05
1.54.79342E−065.33524E−062.51033E−065.79580E−067.54182E−051.00450E−068.00550E−05
2.57.41854E−053.64116E−062.05935E−066.13465E−051.13573E−056.25200E−061.25400E−05
3.05.54962E−057.60480E−065.51924E−065.79554E−054.40134E−058.21818E−066.21814E−06
By method in19
0.52.13925E−033.11837E−032.30463E−031.88514E−041.98467E−032.94162E−032.12575E−03
1.58.54182E−041.26644E−031.00450E−032.51032E−045.33624E−048.79348E−045.79580E−04
2.54.13573E−046.50847E−046.25200E−044.05935E−041.64116E−047.41854E−052.13465E−04
3.03.40134E−045.65588E−046.21818E−045.51928E−044.60480E−044.53962E−045.79854E−04

Example 2 examines the numerical results from two cases: (i) with parameters Δt=0.01,N=50 , and β=0.0001 , and (ii) with Δt=0.01,N=64 , and β=0.01 . Table 8 reveals that our method consistently achieves lower error values than those in.19 For instance, at t=5 in the domain [4,4], the L2 -norm for our method is 3.6693E03 , which is significantly better than 1.34938E01 from the previous method. This illustrates the effectiveness of our approach in capturing the solution behavior and convergence toward a stable boundary value of 1. Additionally, the results in Table 9 show that in case (ii), our proposed method consistently produces lower error norms compared to,19 with the L2-norm at t = 5 in [-4,4] being 3.6695E−03, much better than 1.3494E−01. The graphical representations in Figures 6 and 7 further elucidate this behavior, showing the evolution of solutions over time and a smooth transition toward stability. Also, Figure 8 further confirms that the solution for Example 2 in case (ii) is well-approximated, suggesting that our approach is more accurate than existing methods.

Table 8. Comparisons of the effects of the current method using the norms in the specified domain for solving example two (i) with t=0.01 and M = 50 and β=0.0001 .

By method in19By present method
t Ω=[4,4] Ω=[10,10] Ω=[4,4] Ω=[10,10]
L2 L L2 L L2 L L2 L
05.62590E−029.96992E−011.40648E−019.96992E−015.1668E−047.96992E−034.96992E−037.62590E−03
11.28174E−019.55642E−012.93265E−018.68283E−014.9364E−048.68283E−035.35647E−036.28774E−03
21.32535E−019.80254E−013.21779E−019.51480E−014.21779E−046.51481E−032.80254E−037.32598E−03
31.34241E−019.93923E−013.32150E−019.82345E−014.36150E−034.86345E−035.93926E−027.34649E−03
41.34822E−019.98877E−013.35790E−019.94613E−015.75790E−038.96616E−035.98177E−025.34822E−02
51.34938E−019.99848E−013.36935E−019.98470E−013.66935E−031.97470E−025.99547E−026.34936E−02

Table 9. Comparisons of the effects of the current method using the norms in the specified domain for solving example two (ii) with t=0.01 and M = 64 and β=0.01 .

By method in19By present method
t Ω=[4,4] Ω=[10,10] Ω=[4,4] Ω=[10,10]
L2 L L2 L L2 L L2 L
04.39524E−029.96992E−011.09881E−019.96992E−019.59093E−044.634E−032.4581E−055.1668E−04
11.03420E−019.48203E−012.38273E−019.27997E−015.45979E−044.377E−035.4721E−054.9364E−04
21.03640E−019.81968E−012.55112E−019.85379E−013.62735E−046.945E−036.3846E−044.21779E−04
31.04187E−011.00231E+002.60960E−019.98986E−012.88109E−047.126E−037.4189E−044.36150E−03
41.04572E−011.00737E+002.62897E−011.00066E+006.28584E−049.452E−036.8961E−045.75790E−03
51.04813E−011.00650E+002.63448E−019.99607E−018.76524E−049.829E−034.9789E−043.66935E−03
b28f6441-bee1-40b4-a019-b6cda20d6e28_figure6.gif

Figure 6. Geometrical representations of behavior of solution u(ζ,t) , v(ζ,t) of example two (i) with Gaussian initial function, t =0.01 and M=50 and β=101 .

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure7.gif

Figure 7. Geometrical representations of behavior surface of solution u(ζ,t) , v(ζ,t) of example two (i) with Gaussian initial function, t =0.01 and M=50 and β=101.

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure8.gif

Figure 8. Geometrical representations of behavior of solution u(ζ,t) and its surface of example two (ii) with t=0.01 and M = 64 and β=0.01 .

Example 3 reinforces the accuracy of the proposed method, as indicated in Table 10, where the L2 norm at t=1 for the domain [4,4] is 6.37461E05 , which is markedly lower than 3.50404E02 from.19 This method also demonstrates consistently low error values across a larger domain [10,10] indicating robust performance in capturing solution dynamics. Figure 9 visually represents the stability and smoothness of the profiles generated by the proposed method, reinforcing the numerical findings.

Table 10. Comparisons of L2 -norm and L -norm in the evaluating example three with t=0.01 and M=64 and β=0.01 .

By present method
t Ω=[4,4] Ω=[10,10] Ω=[10,10]
L2 L L2 L L2 L
16.37461E−052.31652E−043.76798E−051.39465E−045.78486E−045.039981E−03
25.81319E−053.86613E−046.66779E−045.67131E−046.186164E−045.32188E−03
35.14934E−043.87335E−046.86142E−046.77863E−046.70266E−045.43851E−03
45.01354E−043.98226E−047.87916E−047.985288E−46.984334E−44.7219E−03
54.34211E−044. 2354E−045.65871E−044.88919E−037.02551E−043.6421E−03
By method in19
13.50404E−029.31452E−012.32795E−039.89406E−013.48395E−109.99968E−01
28.60787E−029.84613E−014.66779E−029.96130E−011.37028E−089.99973E−01
31.01901E−019.95334E−011.74040E−019.97860E−017.79145E−079.99982E−01
41.04762E−019.98226E−012.37816E−019.98421E−04.49760E−059.99989E−01
51.05277E−019.99239E−012.55671E−019.98918E−012.25922E−039.99993E−01
b28f6441-bee1-40b4-a019-b6cda20d6e28_figure9.gif

Figure 9. Geometrical representation of the behavior of the solutions u(ζ,t) and v(ζ,t) of Example three for β=1 in different domains with different step-lengths h.

Example 4 presents the results in Table 11, which highlight the significant accuracy improvements with our method. For t=0.03 and β=1 , the L2 norm is 9.1479E07 , which is significantly lower than the 1.02705E−05 from.19 The convergence characteristics are further illustrated in Table 12, which reveal superior convergence rates, particularly for finer discretizations. Figures 10 and 11 visually reinforce these numerical findings, displaying the wave solutions u(ζ,t) for different perturbation parameters.

Table 11. Comparisons of L2 -norm and L -norm with t=0.01 and M = 50 in the evacuating example 4 (i) with different perturbation parameter β.

By present method
t β=1 β=0.001
L2 L L2 L
0.039.1479E−077.1099E−051.63437E−095.3561E−07
0.072.2991E−083.1731E−063.59855E−092.76467E−07
0.36.861E−086.1450E−064.30266E−092.99239E−07
0.77.1123E−084.8100E−064.84632E−093.65787E−07
0.92.4923E−085.3651E−065.00983E−104.12116E−08
By method in19
0.031.02705E−054.03076E−038.83277E−061.08170E−02
0.079.69180E−062.67816E−037.19451E−067.26425E−03
0.34.11284E−069.31101E−048.30286E−078.42396E−04
0.71.81930E−063.07393E−041.54302E−082.32675E−05
0.91.49806E−062.36168E−042.60093E−093.86667E−06

Table 12. Comparisons of parametric-uniform maximum absolute errors and its rate of convergence for T=0.04 in the evaluating example four in case (ii) for Δt=103.

β By method in19By present method
M = 8M = 16M = 32M = 64M = 8M = 16M = 32 M = 64
20 6.41841E−063.22272E−061.60909E−068.03679E−071.4684E−065.458E−063.0857E−079.59836E−08
21 1.80796E−058.98549E−064.68089E−062.34057E−063.4728E−063.748E−066.1619E−068.94779E−07
22 0.000104120.000055012.78666E−051.39476E−056.3846E−056.197E−066.7328E−063.6752E−07
23 6.41841E−063.22272E−061.60909E−068.05E−076.41892E−054.634E−067.9003E−064.9441E−07
24 8.66285E−054.60583E−052.31932E−051.15962E−056.89613E−054.377E−068.1546E−069.13368E−07
26 0.000104120.000055012.78666E−051.39476E−057.90789E−056.945E−058.12765E−064.11315E−06
28 0.000104120.000055012.78666E−051.39476E−057.97911E−057.126E−053.12674E−055.17758E−06
EN 0.000104120.000055012.78666E−051.39476E−058.68685E−059.452E−054.51042E−059.87997E−06
RN 0.9204814090.9811569130.998520095-8.81454E−059.829E−054.75863E−061.56257E−03

Table 13. Comparisons of L2 -norm and L -norm of error in the evaluating example five for both t=0.01 , t=0.001 and M=64 .

tBy method in19By present method
Time step b28f6441-bee1-40b4-a019-b6cda20d6e28_figure17.gif t=0.01 t=0.001 t=0.01 t=0.001
L2 L L2 L L2 L L2 L
0.18.56447E−061.06174E−038.33926E−061.14140E−034.59093E−075.634E−058.4581E−079.1668E−06
0.21.13259E−051.80386E−031.11443E−051.87280E−038.45979E−076.377E−059.8721E−072.9364E−06
0.41.54954E−053.07668E−031.54042E−053.13596E−032.12735E−069.945E−053.6843E−061.7179E−05
0.61.91941E−054.16207E−031.91346E−054.21119E−034.78109E−062.126E−043.4188E−065.36150E−05
0.82.23256E−055.04855E−032.22705E−055.08817E−034.28582E−062.452E−044.0061E−066.75790E−05
1.02.46120E−055.78314E−032.47896E−055.78346E−036.16524E−063.829E−044.2389E−066.12935E−05
b28f6441-bee1-40b4-a019-b6cda20d6e28_figure10.gif

Figure 10. Geometrical comparison of wave solution u(ζ,t) of example 4(i) for different perturbation parameter β and M=32 .

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure11.gif

Figure 11. Geometrical comparison of wave solution u(ζ,t), of example four (ii) with different perturbation parameter β and M=40 .

Example 5 illustrates the effectiveness of the proposed method in achieving lower error norms across various time steps and sizes. As it is showing in Table 13, at t = 0.1 with Δt = 0.01, the L2 norm was 4.5909E07 , which was substantially lower than 8.56447E06 from.19 The results in Table 14 confirm that our method consistently yields lower L2 and L norms, particularly with finer time steps, demonstrating stability and robustness in simulating wave solutions. Also as it is shown in Table 15, the present method significantly reduces the maximum absolute errors compared to the method in,19 especially as M increases, demonstrating faster convergence. The errors decrease by several orders of magnitude across all parameters, indicating the superior accuracy and efficiency of the proposed approach. Based on this results, the present method outperforms the previous method in both accuracy and convergence rate. Figures 12 and 13 visually represent the behavior of the wave solutions u(ζ,t) and v(ζ,t) affirming the numerical findings.

Table 14. Comparison of L2 -norm, L -norm and GRE in the evaluating example five in the time interval 0 < t ≤ 0.5.

Time-steps Norm of errorResults obtained by method in19Results obtained by present method
M = 20M = 40M = 60M = 80M = 20M = 40M = 60 M = 80
t=0.1 L2 2.69111E−043.41167E−051.20233E−056.11513E−063.51E−065.458E−064.857E−077.598E−07
L 5.88431E−033.91978E−033.59510E−033.48590E−034.72E−052.74E−065.619E−064.949E−07
GRN 5.37349E−023.58310E−023.25095E−023.13709E−024.84E−045.197E−066.547E−053.62E−05
t=0.01 L2 2.38562E−043.04466e−051.09433E−055.63647E−065.48E−073.637E−062.263E−082.246E−08
L 5.93525E−033.91185E−033.58612E−033.47732E−036.93E−063.375E−065.254E−075.118E−07
GRN 5.36526E−023.57576E−023.24471E−023.13131E−024.99E−055.445E−058.276E−066.31E−06
t=0.001 L2 2.3968E−043.0887E−051.11036E−055.7122E−065.97E−086.726E−055.6676E−074.332E−07
L 5.9765E−033.9128E−033.58625E−033.4778E−036.68E−077.452E−055.5104E−073.877E−07
GRN 5.3665E−023.5729E−023.24500E−023.1351E−026.45E−068.829E−056.713E−067.562E−06

Table 15. Comparisons of parameter-uniform maximum absolute errors and its rate of convergence in the evaluating example five in the time interval 0 < t ≤ 0.2.

By present method
β M = 5M = 10M = 20M = 40 M = 80
20 3.113E4 2.9925E4 1.925E4 2.25E4 5.78133E5
21 3.811e4 2.9987E4 1.875E4 3.657E4 6.39984E4
22 4.834E3 2.8023E4 1.023E4 3.373E4 6.83074E4
23 4.835E3 8.1703E3 1.173E4 4.108E4 6.97700E4
24 5.837E3 1.6629E3 1.629E4 4.629E4 7.6629E4
25 5.847E3 4.0241E3 1.041E4 4.841E4 7.8241E4
EN 7.315E3 8.9243E3 1.943E4 5.923E4 7.9243E4
RN 1.26113E3 1.1375E3 2.1375E4 5.985E4 8.1375E4
By method in19
20 0.0270978290.0062788710.0016563790.0004145310.000103733
21 0.047995010.0168722310.0040312380.0010162820.000255155
22 0.0454404590.0246498820.0074001840.0018115920.000454294
23 0.0453530530.0258079680.0085899730.0024132810.000038522
24 0.0455121330.0259715640.0086711380.0024842710.000689575
25 0.0455287560.0259832090.0086691690.0024928810.000685876
EN 0.047995010.0259832090.0086711380.0024928810.000689575
RN 0.8853047991.5832863681.7984073291.854034639-
b28f6441-bee1-40b4-a019-b6cda20d6e28_figure12.gif

Figure 12. Geometrical comparison of wave solution u(ζ,t) and v(ζ,t) of example five using different step-length h and at specified time with t=0.01.

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure13.gif

Figure 13. Geometrical representation of the behavior solution u(ζ,t) and v(ζ,t) of example five for β=1 and M = 20.

Finally, Example 6 examines the effects of varying α, with β=1 . For α=1 , as listed in Table 16, our method achieved lower error norms across the perturbation parameters. Conversely in Table 17, for α=1 , while the method still performs favorably, the error norms are generally higher, indicating an increased sensitivity to perturbations. Figures 1416 visually represent the evolution of wave solutions for both α=1 and α=1 , highlighting the stability of our method in the positive alpha scenario.

Table 16. Comparisons of L2 -norm and L -norm in the evaluating example six for t=0.01 and M = 32, with α=1 .

By present method
t β=1 β=0.1 β=0.001
L2 L L2 L L2 L
0.16.97298E−054.96037E−044.17722E−057.97298E−037.17873E−043.98307E−03
0.25.55890E−043.53767E−034.27609E−044.55890E−037.98819E−044.57292E−03
0.45.66262E−043.46375E−032.36105E−044.50262E−036.36350E−036.07897E−02
0.65.48152E−043.45341E−032.43169E−033.48152E−036.43448E−036.50014E−02
0.85.82118E−043.79042E−033.48896E−033.82118e−036.49206E−034.84189E−01
0.95.96414E−044.93220E−031.51306E−033.96414E−036.51630E−034.98581E−01
By method in19
0.11.72000E−026.51753E−011.70980E−026.47390E−011.69815E−026.42528E−01
0.21.69010E−026.40410E−011.67894E−026.35634E−011.66406E−026.29654E−01
0.41.62911E−026.17275E−011.61859E−026.12772E−011.60308E−026.06588E−01
0.61.56667E−025.93590E−011.55692E−025.89418E−011.54229E−025.83585E−01
0.81.50302E−025.69451E−011.49402E−025.65600E−011.48039E−025.60161E−01
0.91.47083E−025.57246E−011.46220E−025.53549E−011.44906E−025.48306E−01

Table 17. Comparison of L2 -norm and L -norm in the evaluating example six with t=0.01 and M = 32, α = -1.

By present method
t β=1 β=0.1 β=0.001
L2 L L2 L L2 L
0.13.59093E−042.59093E−034.59093E−044.59093E−045.59093E−031.59093E−03
0.24.15979E−033.45979E−033.45979E−045.45979E−034.45979E−031.45979E−02
0.44.32735E−032.12735E−033.32735E−032.12735E−034.12735E−032.12735E−02
0.64.78109E−034.18109E−034.74109E−034.78109E−033.78109E−032.78109E−02
0.85.28582E−034.28582E−025.28582E−034.28582E−033.28582E−032.28582E−02
0.95.16524E−036.16524E−025.191524E−036.64324E−033.26524E−033.16524E−02
By method in19
0.11.17873E−026.98307E−011.17722E−026.97298E−011.17533E−026.96037E−01
0.31.27819E−027.57292E−011.27609E−027.55890E−011.27291E−027.53767E−01
0.51.36350E−028.07897E−011.36105E−028.06262E−011.35729E−028.03753E−01
0.71.43448E−028.50014E−011.43169E−028.48152E−011.42747E−028.45341E−01
0.91.49206E−028.84189E−011.48896E−028.82118E−011.48435E−028.79042E−01
1.01.51630E−028.98581E−011.51306E−028.96414E−01.50827E−028.93220E−01
b28f6441-bee1-40b4-a019-b6cda20d6e28_figure14.gif

Figure 14. Geometrically the of solution u(ζ,t) and v(ζ,t) of example six for t=0.01 , M = 32, α=1 and β=1 .

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure15.gif

Figure 15. Geometrical comparison of wave solution (ζ,t) and v(ζ,t), of example 6 for t=0.01 , M = 32, α=1 and β=1 .

b28f6441-bee1-40b4-a019-b6cda20d6e28_figure16.gif

Figure 16. Geometrical representation of surfaces of solution u(ζ,t) and u(ζ,t) for t=0.01 , M = 32, α=1 and β=1 .

Overall, the application of the Richardson extrapolation technique significantly enhanced the accuracy and convergence of our proposed method, demonstrating its robustness across various EFK-type equations and conditions.

7. Conclusions

This paper presents an advanced numerical method designed to solve the fourth-order Fisher-Kolmogorov reaction-diffusion equation utilizing a hybrid approach that combines quintic Hermite splines with Richardson extrapolation. This innovative technique demonstrates substantial improvements in both accuracy and stability compared with traditional numerical methods. By leveraging the properties of quintic Hermite splines, the proposed method achieves high-order convergence, specifically sixth-order convergence in the spatial direction and fourth-order convergence in the temporal direction. This level of precision is crucial for accurately modeling the complex nonlinear dynamics that are often encountered in various scientific fields.

A thorough stability analysis underscores the capability of the method to maintain unconditional stability across different perturbation parameters, thereby ensuring that the numerical solutions remain bounded and reliable. This aspect of stability is vital, particularly in applications involving dynamic systems where small errors can propagate and lead to significant inaccuracies. The numerical experiments conducted in this study further validate the effectiveness of the proposed method. These experiments demonstrate that it consistently yields lower error norms than existing techniques, highlighting its robustness in capturing the behavior of wave solutions under various initial and boundary conditions.

In addition to its methodological contributions, this research emphasizes the relevance of the proposed technique in mathematical biology and ecology, where the accurate modeling of dynamic processes is essential. These findings illustrate how advanced numerical approaches can enhance our understanding of complex systems, ultimately providing valuable tools for researchers in these fields. Overall, this study represents a significant advancement in numerical analysis for challenging differential equations, showcasing the potential of innovative methodologies to improve the solution reliability and accuracy in scientific computing.

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 24 Oct 2025
Comment
Author details Author details
Competing interests
Grant information
Copyright
Download
 
Export To
metrics
Views Downloads
F1000Research - -
PubMed Central
Data from PMC are received and updated monthly.
- -
Citations
CITE
how to cite this article
Koroche KA. Advanced Numerical Methods for the Fisher-Kolmogorov Reaction-Diffusion Equation: A Quintic Hermite Splines Approach with Richardson Extrapolation [version 1; peer review: awaiting peer review]. F1000Research 2025, 14:1160 (https://doi.org/10.12688/f1000research.163959.1)
NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article.
track
receive updates on this article
Track an article to receive email alerts on any updates to this article.

Open Peer Review

Current Reviewer Status:
AWAITING PEER REVIEW
AWAITING PEER REVIEW
?
Key to Reviewer Statuses VIEW
ApprovedThe paper is scientifically sound in its current form and only minor, if any, improvements are suggested
Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit.
Not approvedFundamental flaws in the paper seriously undermine the findings and conclusions

Comments on this article Comments (0)

Version 1
VERSION 1 PUBLISHED 24 Oct 2025
Comment
Alongside their report, reviewers assign a status to the article:
Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested
Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit.
Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions
Sign In
If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password.

The email address should be the one you originally registered with F1000.

Email address not valid, please try again

You registered with F1000 via Google, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Google account password, please click here.

You registered with F1000 via Facebook, so we cannot reset your password.

To sign in, please click here.

If you still need help with your Facebook account password, please click here.

Code not correct, please try again
Email us for further assistance.
Server error, please try again.