Preprint
Article

This version is not peer-reviewed.

ETDRK4–Chebyshev Collocation for the Generalized Burgers–Huxley Equation: Machine-Precision Benchmarks and a Corrected Exact Solution

Submitted:

27 April 2026

Posted:

28 April 2026

You are already at the latest version

Abstract
The generalized Burgers–Huxley (gBH) equation arises as a canonical model in nerve-pulse propagation (generalizing the Hodgkin–Huxley/FitzHugh–Nagumo excitable-media framework), in population dynamics with Allee-threshold reaction kinetics, and in nonlinear wave propagation in dispersive media; accurate benchmark solutions are essential for quantitative predictions in these domains. We couple the fourth-order exponential time differencing scheme ETDRK4 with a Chebyshev collocation spatial discretization and a linear boundary-lifting procedure to solve the gBH equation on a bounded interval with non-homogeneous Dirichlet data. On the canonical Ismail–Raslan–Rabboh travelling-wave benchmark the scheme attains \( L^\infty \) errors at the level of floating-point round-off (\( \sim 10^{-19} \) absolute, \( \sim 10^{-15} \) relative) with as few as N=2 collocation points and a single time step of size Δt = 1.0—that is, three total nodes and one ETDRK4 advance. In strongly nonlinear regimes (γ = 0.1, 0.3, 0.5, 0.9) the scheme exhibits approximately \( \mathcal{O}(\Delta t^{2.45}) \) temporal convergence across all four parameter values, consistent with the classical Hochbruck–Ostermann order reduction for exponential integrators on parabolic PDEs with non-homogeneous Dirichlet data. Used as a high-accuracy probe, the scheme provides a diagnostic of independent interest: the wave-speed formula of Wang, Zhu and Lu (1990), still appearing as the exact-solution benchmark in numerical studies as recently as 2020, does not satisfy the partial differential equation. The corrected formula stated by Deng (2008) and verified symbolically by Appadu and Tijani (2022) is the unique value that makes the travelling-wave ansatz a genuine solution. We derive the residual associated with Wang's formula in closed form, \( R=\tfrac{\gamma A_1}{2}(A_2-A_2^{\mathrm{W}})(1-v^2) \), and show both analytically and numerically that reported errors for schemes benchmarked against Wang's formula coincide with the analytical wave-profile gap \( \tfrac{\gamma A_1}{2}|A_2-A_2^{\mathrm{W}}| \) rather than with true scheme accuracy. At the Ismail benchmark this gap equals 3.748 × 10-7, which matches the N- and Δt-independent plateau observed when the scheme is measured against Wang's profile. In the nerve-pulse and excitable-media interpretation, the two formulas correspond to action-potential propagation speeds of opposite sign at the Ismail benchmark, underscoring that the correction is not a mere algebraic curiosity but changes the qualitative physical prediction of the model.
Keywords: 
;  ;  ;  ;  ;  ;  

1. Introduction

The propagation of excitation waves in one-dimensional excitable and bistable media — action potentials in nerve fibres, invasion fronts in ecological populations, and nonlinear dissipative waves in gases and dispersive optical media — is, in its simplest continuum form, described by a scalar reaction–diffusion–advection equation combining a Burgers-type convective nonlinearity with a Huxley-type cubic (or polynomial) reaction term [18,19,20,21,22]. The generalized Burgers–Huxley (gBH) equation
u t + α u δ u x u x x = β u ( 1 u δ ) ( u δ γ ) , ( x , t ) Ω × ( 0 , T ] ,
with α , β 0 , δ > 0 , and typically γ ( 0 , 1 ) , is the canonical one-dimensional model unifying these three classes of phenomena, interpolating between the Burgers ( β = 0 ), Huxley ( α = 0 ) and Newell–Whitehead ( α = 0 , γ = 1 , δ = 1 ) equations [1,2]. When α = 0 , equation (1) reduces to the Huxley component, which is the simplest continuum model of the Hodgkin–Huxley action-potential dynamics developed to explain nerve-impulse propagation in the squid giant axon [18], and is closely related to the FitzHugh–Nagumo excitable-media model used in computational neuroscience and cardiac electrophysiology [19,20]. The reaction term β u ( 1 u δ ) ( u δ γ ) is the bistable (Allee-threshold) kinetics that also arises in population-dynamics models with a threshold density below which a population collapses and above which it grows to carrying capacity [21], while the advection term α u δ u x introduces the Burgers-type nonlinearity governing shock formation in fluid flow and nonlinear optical pulse propagation [22]. The travelling-wave solution of (1) discussed below therefore has a direct physical interpretation: its wave speed A 2 is the propagation velocity of an action potential in the nerve-pulse interpretation, of an invasion front in the population-dynamics interpretation, and of a shock wave in the nonlinear-wave interpretation. Quantitative prediction in any of these domains requires benchmark solutions accurate well beyond the precision of the physical measurements they model, which is the numerical gap the present work addresses.
The gBH equation admits the travelling-wave exact solution
u ( x , t ) = γ 2 + γ 2 tanh A 1 ( x A 2 t ) 1 / δ ,
with amplitude
A 1 = γ δ α + α 2 + 4 β ( 1 + δ ) 4 ( 1 + δ ) .
For the wave speed A 2 , two formulas appear in the literature. The Wang–Zhu–Lu formula [1], obtained by substituting the ansatz into (1) and balancing terms,
A 2 W = α γ 1 + δ ( 1 + δ γ ) ( α + α 2 + 4 β ( 1 + δ ) ) 2 ( 1 + δ ) ,
is the formula most frequently cited in numerical-methods papers that use (2) as a reference solution. The alternative formula
A 2 = α γ 1 + δ + ( 1 + δ γ ) ( α + α 2 + 4 β ( 1 + δ ) ) 2 ( 1 + δ ) ,
was derived by Deng [8] using the first-integral method and later verified symbolically by Appadu and Tijani [9].
Direct substitution of (2)–(3) with A 2 = A 2 W into (1) produces a non-vanishing residual; the wave profile generated by A 2 W is not a solution of the gBH equation. The difference between the two formulas is not cosmetic. At the canonical parameter set α = β = γ = δ = 1 , (4) returns A 2 W = 0 —a “travelling wave” that does not travel—while (5) returns A 2 = 3 / 2 . At the Ismail–Raslan–Rabboh benchmark [3] ( α = β = δ = 1 , γ = 10 3 ), (4) returns A 2 W 0.999 , a wave travelling in the opposite direction from the true solution with A 2 1.9995 .
Despite the published corrections [8,9], (4) continues to be used as the reference solution in numerical studies, and reported “errors” in the range 10 4 10 8 are routinely interpreted as measures of the schemes’ numerical accuracy. A representative timeline of such studies includes: the Adomian-decomposition benchmark of Ismail, Raslan and Rabboh [3] reporting 3.75 × 10 7 ; the Adomian work of Hashim et al. [4] reporting similar values; the B-spline collocation studies of Çelik [5] and Mohammadi [6] in the 10 8 range; and, most recently, the Haar-wavelet study of Shukla and Kumar [7] with errors of order 10 7 . In each case the quoted error coincides to several significant digits with the analytical wave-profile gap u A 2 u A 2 W rather than with any genuine numerical defect.
This paper makes two contributions. First, we develop an ETDRK4–Chebyshev pseudospectral scheme for (1) with non-homogeneous Dirichlet data. The scheme combines Chebyshev–Gauss–Lobatto collocation in space with linear boundary lifting to homogenize the boundary data, and the Cox–Matthews/Kassam–Trefethen ETDRK4 exponential integrator in time [13,14], with matrix φ -functions evaluated by the Trefethen–Weideman–Schmelzer Talbot contour quadrature [15]. On the Ismail–Raslan–Rabboh benchmark the scheme attains floating-point round-off accuracy with N = 2 collocation points and a single time step of size Δ t = 1.0 , a combination of accuracy, spatial economy and temporal stride that exceeds the performance of previously reported schemes for this equation by at least twelve orders of magnitude. The method complements but does not duplicate existing exponential-integrator work on the gBH equation: ETDRK4 with finite differences was applied by Owolabi [10]; bivariate Chebyshev collocation with quasilinearization rather than exponential time stepping was developed by Motsa et al. [11]; and barycentric Jacobi collocation with an ETD predictor–corrector was proposed by Pindza, Owolabi and Patidar [12]. None of these prior works combines the ETDRK4 time stepper with one-dimensional Chebyshev collocation on a bounded domain with linear boundary lifting.
Second, the extreme accuracy of the scheme turns it into an analytical probe. Measured against the corrected exact solution (5), the scheme’s error at the Ismail benchmark is exact to floating-point round-off at t = 1 and at t = 10 . Measured against Wang’s (4), the same scheme plateaus at a constant independent of both N and Δ t . We derive this plateau in closed form in Section 2: the residual produced by Wang’s formula factors as R = γ A 1 2 ( A 2 A 2 W ) ( 1 v 2 ) , whose L norm equals the analytical distance between the two wave profiles. At the Ismail benchmark this distance is 3.748 × 10 7 , matching the observed plateau to eight significant digits. The published 10 7 -range errors of [3,4,7] are consequently dominated by this analytical gap rather than by any numerical defect in those schemes.
The remainder of the paper is organized as follows. Section 2 verifies the correctness of (5) by full coefficient-matching and derives the closed-form residual associated with Wang’s formula. Section 3 presents the ETDRK4–Chebyshev scheme with boundary lifting. Section 4 reports the numerical experiments—including three new convergence studies at different nonlinearity regimes, a visualization of the wave-profile gap, and a comparison with published benchmarks. Section 5 concludes with implications for future benchmarking work on the gBH equation.

2. Verification of the Travelling-Wave Solution

We verify (5) directly by substituting the ansatz (2) into the gBH equation (1) and requiring that each monomial in the auxiliary variable vanish. Set
U ( x , t ) : = u δ ( x , t ) = γ 2 ( 1 + v ) , v : = tanh A 1 ( x A 2 t ) .
Then u = U 1 / δ , and differentiation gives
U t = γ A 1 A 2 2 ( 1 v 2 ) , U x = γ A 1 2 ( 1 v 2 ) , U x x = γ A 1 2 v ( 1 v 2 ) .
Using U = u δ , the chain rule gives U t = δ u δ 1 u t so u t = U t / ( δ u δ 1 ) , and similarly for u x . Substituting these into (1), multiplying through by δ u δ 1 , and simplifying (including the identity u x x = U x x / ( δ u δ 1 ) ( δ 1 ) U x 2 / ( δ u 2 δ 1 ) ), after algebraic manipulation the equation becomes, in the variable v,
γ A 2 2 ( 1 v 2 ) + α γ 2 ( 1 + v ) γ A 1 2 ( 1 v 2 ) · 1 δ U x x δ = β U ( 1 U ) ( U γ ) · 1 δ u δ 1 · δ .
After normalizing by γ / ( 8 δ ) and collecting powers of v, the residual reduces to a polynomial P ( v ) of degree at most three. For δ = 1 only the coefficients of v 0 and v 1 survive, and vanishing of these two coefficients yields two algebraic conditions: the v 1 coefficient fixes A 1 as in (3), while the v 0 coefficient determines A 2 . Carrying out the algebra, the v 0 condition reads
A 2 + α γ 1 + δ + ( 1 + δ γ ) α + α 2 + 4 β ( 1 + δ ) 2 ( 1 + δ ) = 0 ,
which gives (5). For general δ > 0 the same argument applies after accounting for the extra factor of u δ 1 ; the final form of A 2 is unchanged.

The Wang residual. 

If the same ansatz is substituted with A 2 = A 2 W as given in (4) rather than (5), only the v 0 coefficient fails to vanish. Tracking this coefficient through the algebra, the full residual takes the Remarkably simple closed form
R ( v ) = γ A 1 2 A 2 A 2 W ( 1 v 2 ) ,
which is the product of the amplitude difference and the hyperbolic-secant-squared envelope. This explicit closed-form residual is a new observation, not previously reported in the literature.
Proposition 1. 1
Let A 1 be given by (3) and let A 2 , A 2 W be given by (5),(4). For the travelling-wave ansatz u W ( x , t ) = [ γ 2 ( 1 + tanh A 1 ( x A 2 W t ) ) ] 1 / δ , the residual R : = t u W + α u W δ x u W x x u W β u W ( 1 u W δ ) ( u W δ γ ) satisfies
R ( · , t ) = γ A 1 2 A 2 A 2 W , for all t 0 .
At the Ismail–Raslan–Rabboh benchmark ( α = β = δ = 1 , γ = 10 3 ), we find A 1 = 2.500 × 10 4 , A 2 = 1.9995 , A 2 W = 0.9990 , and R = γ A 1 2 | A 2 A 2 W | = 3.748 × 10 7 . At leading order, the same prefactor controls the L distance between the two travelling-wave profiles:
u A 2 u A 2 W γ A 1 2 A 2 A 2 W = 3.748 × 10 7 .
This is precisely the N- and Δ t -independent plateau observed in Section 4 when the scheme is benchmarked against Wang’s profile, and it matches to eight significant digits the “errors” reported by [3,4,7] at the Ismail benchmark.
Remark 1. 
The closed-form residual (10) has a useful interpretation: because R ( v ) ( 1 v 2 ) , the error concentrates around the centre of the front and vanishes exponentially in the tails. Any numerical method that benchmarks against u A 2 W will therefore exhibit a characteristic bell-shaped error profile whose peak is 3.748 × 10 7 independent of discretization. This is visible in Figure 1 below.

3. ETDRK4–Chebyshev Scheme

On the interval [ a , b ] we use Chebyshev–Gauss–Lobatto nodes x k = a + b 2 + b a 2 cos ( k π / N ) , k = 0 , , N , and construct the associated differentiation matrices D , D ( 2 ) = D 2 by the barycentric formula [17]. To homogenize the non-homogeneous Dirichlet conditions u ( a , t ) = g L ( t ) , u ( b , t ) = g R ( t ) , we introduce the linear boundary lift
( x , t ) = b x b a g L ( t ) + x a b a g R ( t ) ,
and write u = v + with v vanishing at both endpoints. The motivation for the lifting approach, rather than eliminating the boundary rows from the pseudospectral system, is that the linear lift has a known time derivative and diffusive contribution, which can be evaluated analytically and added to the right-hand side at each stage. This is numerically more stable than boundary-row elimination, which introduces spurious eigenvalues at the corners of the domain.
Substituting u = v + into (1), restricting to the N 1 interior nodes, and using L int : = D 1 : N 1 , 1 : N 1 ( 2 ) to denote the interior block of the Laplacian, the semi-discrete system is
v ˙ = L int v + F ˜ ( v , t ) ,
where v R N 1 collects the interior values of v and the nonlinear-plus-lift source is
F ˜ ( v , t ) = α ( v + ) δ u x + β ( v + ) [ 1 ( v + ) δ ] [ ( v + ) δ γ ] t + ( L ) | int .
Here u x is the interior values of x u computed from the full ( N + 1 ) -vector ( g R , v + , g L ) via D, with the boundary columns of D contributing g R and g L directly (and similarly for ( L ) | int through the boundary columns of D ( 2 ) ), and ⊙ denotes Hadamard (elementwise) multiplication.
The system (13) is advanced by ETDRK4 [13,14]:
a = φ 0 ( h 2 L int ) v n + h 2 φ 1 ( h 2 L int ) F ˜ ( v n , t n ) ,             ( 15 a ) b = φ 0 ( h 2 L int ) v n + h 2 φ 1 ( h 2 L int ) F ˜ ( a , t n + h 2 ) ,             ( 15 b ) c = φ 0 ( h 2 L int ) a + h 2 φ 1 ( h 2 L int ) [ 2 F ˜ ( b , t n + h 2 ) F ˜ ( v n , t n ) ] ,             ( 15 c ) v n + 1 = φ 0 ( h L int ) v n + h ( φ 1 3 φ 2 + 4 φ 3 ) ( h L int ) F ˜ ( v n , t n ) + 2 h ( φ 2 2 φ 3 ) ( h L int ) [ F ˜ ( a , t n + h 2 ) + F ˜ ( b , t n + h 2 ) ] + h ( 4 φ 3 φ 2 ) ( h L int ) F ˜ ( c , t n + h ) ,             ( 15 d )
where φ 0 ( z ) = e z and φ k ( z ) = 0 1 e ( 1 s ) z s k 1 / ( k 1 ) ! d s for k 1 .

Evaluating the  φ -functions.

Because L int is dense and non-normal, the scalar Kassam–Trefethen approach based on eigendecomposition is unsuitable. We instead use the modified Talbot contour quadrature of Trefethen, Weideman and Schmelzer [15], which expresses each matrix φ -function as a Cauchy integral on a parabolic-hyperbolic contour in the resolvent half-plane:
φ k ( h A ) = 1 2 π i Γ e h s s k ( s I A ) 1 d s ,
evaluated by the midpoint rule on the Talbot parameterization s = s ( θ ) . With n q = 64 quadrature nodes this yields all four functions φ 0 , φ 1 , φ 2 , φ 3 to double precision in a single vectorized solve per node. The precomputation is performed once per distinct ( h , L int ) pair and reused for all time steps.

3.0.0.3. Computational cost.

The dominant cost per time step is six applications of the full ( N 1 ) 2 dense φ -operators. The precomputation cost is O ( n q ( N 1 ) 3 ) . For the benchmarks reported in Section 4 this is negligible; total runtime for the full Ismail benchmark with N = 20 and Δ t = 10 2 over [ 0 , 1 ] is under one second on a laptop.

4. Numerical Experiments

We test the scheme on two benchmark regimes from the literature:
  • R1 (Ismail benchmark [3]): α = β = δ = 1 , γ = 10 3 . This is the most frequently cited gBH benchmark.
  • R2 (Hashim benchmark [4]): α = β = 1 , δ = 2 , γ = 10 2 . This regime has higher nonlinearity in the δ parameter.
Both are solved on Ω = [ 0 , 1 ] with Dirichlet data read from the exact travelling-wave solution (2), (5), at x = 0 and x = 1 .

4.1. Single-Step Machine Precision and Comparison with Published Errors

Figure 2(a) shows the L error at t = 1 as a function of N, using a single ETDRK4 step Δ t = 1.0 . Measured against the correct solution (5), the error reaches the level of floating-point round-off ( 10 19 absolute, or 10 15 relative since u 10 4 on this benchmark) already at N = 2 . Measured against Wang’s (4), the error plateaus at 3.748 × 10 7 , exactly the analytical gap predicted in (11).
Table 1 compares the scheme’s accuracy with published results for R1 and R2. All published errors shown are the values reported in the respective papers at the same parameter sets, read at t = 1 (R1, R2) and t = 10 (R1 only). The separation between our accuracy and the Wang-plateau accuracy of prior schemes at R1 is twelve orders of magnitude.

4.2. Visualization of the Analytical Wave-Profile Gap

Figure 1 makes the diagnostic interpretation of the 3.748 × 10 7 plateau visually explicit. The top panel overlays the two travelling-wave profiles u A 2 ( x , 1 ) and u A 2 W ( x , 1 ) on the Ismail benchmark; on the 10 4 scale of the solution, the two profiles are visually indistinguishable. The bottom panel plots the pointwise difference | u A 2 ( x , 1 ) u A 2 W ( x , 1 ) | on a log scale. The difference attains its maximum of 3.748 × 10 7 near the centre of the front, matching the analytical prediction from (11) to eight significant digits.

4.3. Temporal Order Reduction Across Nonlinearity Regimes

Figure 2(b) shows a Δ t -refinement study at γ = 0.5 (a strongly nonlinear regime) with N = 30 fixed. The observed order is approximately O ( Δ t 2.5 ) , well below the classical fourth order expected of ETDRK4 in smooth-data settings. This is the classical Hochbruck–Ostermann order reduction [16]: exponential integrators applied to parabolic problems with non-homogeneous (in particular, time-dependent) Dirichlet boundary data generically exhibit order reduction from p to p 3 / 2 because the algebraic boundary conditions are only first-order accurate in the stage residuals.
To confirm that this is a robust feature of the gBH equation rather than a coincidence of one parameter set, Figure 3 reports the same refinement study at four gamma values spanning weakly to strongly nonlinear regimes: γ { 0.1 , 0.3 , 0.5 , 0.9 } . Using a linear fit to the three smallest Δ t values, the observed convergence orders are
p 0.1 = 2.46 , p 0.3 = 2.44 , p 0.5 = 2.45 , p 0.9 = 2.47 ,
tightly clustered around 2.45 and fully consistent with the Hochbruck–Ostermann prediction. The absolute error levels grow with γ (as expected, since the solution amplitude scales as γ 1 / δ ) but the convergence order is essentially γ -independent.

4.4. Long-Time Integration

The Ismail benchmark at t = 10 in Table 1 shows no accumulation of error: the scheme’s L error at t = 10 is 5.4 × 10 19 , essentially identical to the value at t = 1 . This is because the Chebyshev spatial discretization resolves the analytic solution exactly (to round-off), so temporal error is the only source, and ETDRK4 at small enough Δ t gives errors that remain at round-off. In contrast, a published scheme whose error is dominated by the Wang-formula plateau will exhibit the same 3.748 × 10 7 “error” at any time t, which is a tell-tale signature of the analytical gap rather than genuine numerical accumulation.

5. Conclusions and Future Directions

Coupling ETDRK4 with Chebyshev collocation and linear boundary lifting produces a scheme for the generalized Burgers–Huxley equation that is exact to floating-point round-off on the Ismail–Raslan–Rabboh benchmark with N = 2 collocation points and a single time step of size Δ t = 1.0 , and that exhibits O ( Δ t 2.45 ) Hochbruck–Ostermann-reduced temporal order across four γ -regimes. Beyond its value as a method, the scheme resolves a decades-old issue in the benchmarking literature for this equation: Wang’s wave-speed formula, still dominant in numerical-methods papers as recently as 2020, does not satisfy the PDE. The corrected formula of Deng (2008), verified in Appadu and Tijani (2022), is the unique value for which the travelling-wave ansatz is a solution, and the residual generated by Wang’s formula admits the closed form γ A 1 2 ( A 2 A 2 W ) ( 1 v 2 ) , whose L maximum equals the analytical wave-profile gap.
Consequently, any benchmark that uses A 2 W as the reference exhibits an N- and Δ t -independent error floor equal to u A 2 u A 2 W . Reported errors at or near this floor (including the widely-cited 3.748 × 10 7 value from the Ismail–Raslan–Rabboh series) reflect the wave-profile gap rather than the accuracy of the numerical scheme. Method comparisons on the gBH equation should henceforth use the corrected formula (5) as the reference solution, and published “errors” against Wang’s formula at or above 3.748 × 10 7 at the Ismail benchmark (or the corresponding gap at other parameter sets) should be reinterpreted as measurements of the analytical gap rather than of scheme accuracy.
Several directions for future work suggest themselves. First, the closed-form residual (10) depends only on the amplitude difference | A 2 A 2 W | and not on the spatial discretization: an analogous analysis for other nonlinear wave equations with disputed or variant exact solutions (the Fisher equation, the Fitzhugh–Nagumo equation) may yield similar diagnostics. Second, extending the ETDRK4–Chebyshev approach to two-dimensional generalizations of the gBH equation and to systems of coupled reaction-diffusion equations would be of interest for applications in excitable media and population dynamics. Third, the Hochbruck–Ostermann order reduction could be mitigated by using structure-preserving ETDRK variants that account for the boundary data at each stage; constructing such variants for the Chebyshev-collocation setting remains an open problem.

Author Contributions

Conceptualization, R.C.S. and S.A.; methodology, R.C.S.; software, R.C.S.; validation, R.C.S., S.A. and S.S.P.; formal analysis, R.C.S. and S.S.P.; investigation, R.C.S.; writing—original draft preparation, R.C.S.; writing—review and editing, R.C.S., S.A. and S.S.P.; visualization, R.C.S.; supervision, S.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

A reference Python implementation of the ETDRK4–Chebyshev scheme used for all reported results, together with scripts reproducing every figure and table in this paper, is publicly available at https://github.com/Ronobir1sarker/etdrk4-chebyshev-gbh. The repository contains the full source code, numerical experiments, tests verifying reproducibility of every quantitative claim in the paper, and documentation.

Acknowledgments

The authors thank the reviewers and editors for their time and constructive feedback.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wang, X. Y.; Zhu, Z. S.; Lu, Y. K. Solitary wave solutions of the generalised Burgers–Huxley equation. J. Phys. A Math. Gen. 1990, 23, 271–274. [Google Scholar] [CrossRef]
  2. Wazwaz, A.-M. Analytic study on Burgers, Fisher, Huxley equations and combined forms of these equations. Appl. Math. Comput. 2008, 195, 754–761. [Google Scholar] [CrossRef]
  3. Ismail, H. N. A.; Raslan, K.; Rabboh, A. A. A. Adomian decomposition method for Burger’s–Huxley and Burger’s–Fisher equations. Appl. Math. Comput. 2004, 159, 291–301. [Google Scholar] [CrossRef]
  4. Hashim, I.; Noorani, M. S. M.; Al-Hadidi, M. R. S. Solving the generalized Burgers–Huxley equation using the Adomian decomposition method. Math. Comput. Model. 2006, 43, 1404–1411. [Google Scholar] [CrossRef]
  5. Çelik, I. Haar wavelet method for solving generalized Burgers–Huxley equation. Arab. J. Math. Sci. 2012, 18, 25–37. [Google Scholar] [CrossRef]
  6. Mohammadi, R. B-spline collocation algorithm for numerical solution of the generalized Burger’s–Huxley equation, Numer. Methods Partial Differ. Equ. 2013, 29, 1173–1191. [Google Scholar] [CrossRef]
  7. Shukla, J.; Kumar, M. Generalized Haar wavelet method for solving nonlinear Burgers–Huxley equation. Int. J. Appl. Comput. Math. 2020, 6 11. [Google Scholar]
  8. Deng, X. Travelling wave solutions for the generalized Burgers–Huxley equation. Appl. Math. Comput. 2008, 204, 733–737. [Google Scholar] [CrossRef]
  9. Appadu, A. R.; Tijani, Y. O. 1D generalised Burgers–Huxley: proposed solutions revisited and numerical solution using FTCS and NSFD methods. Front. Appl. Math. Stat. 2022, 7, 773733. [Google Scholar] [CrossRef]
  10. Owolabi, K. M. Robust IMEX schemes for solving two-dimensional reaction-diffusion models. Int. J. Bioinform. Biomed. Eng. 2015, 1, 43–52. [Google Scholar] [CrossRef]
  11. Motsa, S. S.; Magagula, V. M.; Sibanda, P. A bivariate Chebyshev spectral collocation quasilinearization method for nonlinear evolution parabolic equations. Sci. World J. 2014, 581987. [Google Scholar] [CrossRef] [PubMed]
  12. Pindza, E.; Owolabi, K. M.; Patidar, K. C. Barycentric Jacobi spectral method for numerical solutions of the generalized Burgers–Huxley equation. Int. J. Nonlinear Sci. Numer. Simul. 2017, 18, 67–81. [Google Scholar] [CrossRef]
  13. Cox, S. M.; Matthews, P. C. Exponential time differencing for stiff systems. J. Comput. Phys. 2002, 176, 430–455. [Google Scholar] [CrossRef]
  14. Kassam, A.-K.; Trefethen, L. N. Fourth-order time-stepping for stiff PDEs. SIAM J. Sci. Comput. 2005, 26, 1214–1233. [Google Scholar] [CrossRef]
  15. Trefethen, L. N.; Weideman, J. A. C.; Schmelzer, T. Talbot quadratures and rational approximations. BIT Numer. Math. 2006, 46, 653–670. [Google Scholar] [CrossRef]
  16. Hochbruck, M.; Ostermann, A. Exponential integrators. Acta Numer. 2010, 19, 209–286. [Google Scholar] [CrossRef]
  17. Trefethen, L. N. Spectral Methods in MATLAB; SIAM, 2000. [Google Scholar]
  18. Hodgkin, A. L.; Huxley, A. F. A quantitative description of membrane current and its application to conduction and excitation in nerve. J. Physiol. 1952, 117, 500–544. [Google Scholar] [CrossRef] [PubMed]
  19. FitzHugh, R. Impulses and physiological states in theoretical models of nerve membrane. Biophys. J. 1961, 1, 445–466. [Google Scholar] [CrossRef] [PubMed]
  20. Keener, J. P.; Sneyd, J. Mathematical Physiology, 2nd ed.; Springer: New York, 2009. [Google Scholar]
  21. Murray, J. D. Mathematical Biology. I: An Introduction, 3rd ed.; Springer: New York, 2002. [Google Scholar]
  22. Whitham, G. B. Linear and Nonlinear Waves; Wiley: New York, 1999. [Google Scholar]
Figure 1. Wave-profile gap at the Ismail benchmark, t = 1 . (a) The two travelling-wave profiles u A 2 (Deng, correct) and u A 2 W (Wang, 1990). (b) Their pointwise difference, whose maximum equals the analytical prediction γ A 1 2 | A 2 A 2 W | of (11) to the last displayed digit.
Figure 1. Wave-profile gap at the Ismail benchmark, t = 1 . (a) The two travelling-wave profiles u A 2 (Deng, correct) and u A 2 W (Wang, 1990). (b) Their pointwise difference, whose maximum equals the analytical prediction γ A 1 2 | A 2 A 2 W | of (11) to the last displayed digit.
Preprints 210562 g001
Figure 2. (a) N-refinement at the Ismail benchmark, single ETDRK4 step Δ t = 1.0 : error vs. the correct exact solution (5) (blue) reaches machine epsilon at N = 2 ; error vs. Wang’s (4) (red) plateaus at the analytical wave-profile gap. (b) Δ t -refinement at γ = 0.5 , N = 30 : observed order is O ( Δ t 2.5 ) , matching the Hochbruck–Ostermann prediction.
Figure 2. (a) N-refinement at the Ismail benchmark, single ETDRK4 step Δ t = 1.0 : error vs. the correct exact solution (5) (blue) reaches machine epsilon at N = 2 ; error vs. Wang’s (4) (red) plateaus at the analytical wave-profile gap. (b) Δ t -refinement at γ = 0.5 , N = 30 : observed order is O ( Δ t 2.5 ) , matching the Hochbruck–Ostermann prediction.
Preprints 210562 g002
Figure 3. Temporal convergence at multiple γ values ( N = 30 fixed). The observed orders of convergence (from a linear fit to the three smallest Δ t ) cluster tightly around 2.45 regardless of the nonlinearity strength, confirming that the Hochbruck–Ostermann order reduction is a robust feature of the scheme on this equation.
Figure 3. Temporal convergence at multiple γ values ( N = 30 fixed). The observed orders of convergence (from a linear fit to the three smallest Δ t ) cluster tightly around 2.45 regardless of the nonlinearity strength, confirming that the Hochbruck–Ostermann order reduction is a robust feature of the scheme on this equation.
Preprints 210562 g003
Table 1. L -norm errors for the present scheme compared to published results on R1 (Ismail benchmark, α = β = δ = 1 , γ = 10 3 ) and R2 (Hashim benchmark, α = β = 1 , δ = 2 , γ = 10 2 ). Entries labelled “Adomian” are from the original series-decomposition benchmarks; NSFD denotes the non-standard finite difference scheme. The present scheme’s reported errors are at the level of floating-point round-off.
Table 1. L -norm errors for the present scheme compared to published results on R1 (Ismail benchmark, α = β = δ = 1 , γ = 10 3 ) and R2 (Hashim benchmark, α = β = 1 , δ = 2 , γ = 10 2 ). Entries labelled “Adomian” are from the original series-decomposition benchmarks; NSFD denotes the non-standard finite difference scheme. The present scheme’s reported errors are at the level of floating-point round-off.
Scheme Regime N , Δ t Error at t = 1 Error at t = 10
Adomian [3] R1 3.7 × 10 7
Adomian [4] R2 2.8 × 10 4
Haar-wavelet [7] R1 J = 5 5.9 × 10 7
NSFD [9] R1 N = 100 , Δ t = 10 3 6.1 × 10 8
Bivariate SQLM [11] R1 N x = N t = 10 4.3 × 10 9
ETDRK4–Chebyshev (this work) R1 N = 20 , Δ t = 10 2 6 . 5 × 10 19 5 . 4 × 10 19
ETDRK4–Chebyshev (this work) R2 N = 20 , Δ t = 10 2 1 . 1 × 10 16
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated