Exploring the Performance of Some Efficient Explicit Numerical Methods with Good Stability Properties for Huxley’s Equation

Four explicit numerical schemes are collected, which are stable and efficient for the diffusion equation. Using these diffusion solvers, several new methods are constructed for the nonlinear Huxley’s equation. Then, based on many successive numerical case studies in one and two space dimensions, the least performing methods are gradually dropped out to keep only the best ones. During the tests, not only one but all the relevant time step sizes are considered, and for them, running-time measurements are performed. A major aspect is computational efficiency, which means that an acceptable solution is produced in the shortest possible time. Parameter sweeps are executed for the coefficient of the nonlinear term, the stiffness ratio, and the length of the examined time interval as well. We obtained that usually, the leapfrog–hopscotch method with Strang-type operator-splitting is the most efficient and reliable, but the method based on the Dufort–Frankel scheme can also be very efficient.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-01-09
DOI
https://doi.org/10.3390/math13020207
Citations
7
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
10.53
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Exploring the Performance of Some Efficient Explicit Numerical Methods with Good Stability Properties for Huxley’s Equation

Issa Omle, Endre Kovács, Husniddin Khayrullaev
7 citations
Mathematics
Matrix Theory and Algorithms
10.53
article

Exploring the Performance of Some Efficient Explicit Numerical Methods with Good Stability Properties for Huxley’s Equation

Issa Omle, Endre Kovács, Husniddin Khayrullaev
article en
7 citations

Abstract

Four explicit numerical schemes are collected, which are stable and efficient for the diffusion equation. Using these diffusion solvers, several new methods are constructed for the nonlinear Huxley’s equation. Then, based on many successive numerical case studies in one and two space dimensions, the least performing methods are gradually dropped out to keep only the best ones. During the tests, not only one but all the relevant time step sizes are considered, and for them, running-time measurements are performed. A major aspect is computational efficiency, which means that an acceptable solution is produced in the shortest possible time. Parameter sweeps are executed for the coefficient of the nonlinear term, the stiffness ratio, and the length of the examined time interval as well. We obtained that usually, the leapfrog–hopscotch method with Strang-type operator-splitting is the most efficient and reliable, but the method based on the Dufort–Frankel scheme can also be very efficient.

MathematicsVol. 13(2)
University of Miskolc (HU)
Openalex Percentile: Top 2%
Matrix Theory and Algorithms
10.53
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.