Jacobi‐Galerkin Spectral Method for the Fractional Diffusion Equation

ABSTRACT An efficient numerical method for approximating the fractional diffusion equation, combining the Jacobi spectral method for spatial discretization with the leapfrog scheme for temporal discretization is proposed in this paper. Instead of the Petrov‐Galerkin one as in literature, the spatial discretization for the source problem is conducted using a standard Galerkin weak formulation. This choice ensures that the resulting discretized linear system retains symmetry and positive definiteness, offering a significant advantage. Furthermore, we provide a rigorous analysis of the stability and convergence of the proposed method. Theoretically, we prove that the spatial discretization via the Jacobi spectral method achieves asymptotically exponential convergence, while the temporal discretization using the leapfrog scheme attains a second‐order convergence rate. To validate the accuracy and efficiency of our approach, we compare it with a classical finite difference method. Finally, several numerical examples are presented to demonstrate the feasibility, stability, and high accuracy of the proposed algorithm.

Authors

Institutions

Publication Details

Journal
Numerical Methods for Partial Differential Equations
Published
2026-02-12
DOI
https://doi.org/10.1002/num.70076
Primary Topic
Fractional Differential Equations Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Jacobi‐Galerkin Spectral Method for the Fractional Diffusion Equation

Jing Zhang, Lizhen Chen, Wenfei Lv
Numerical Methods for Partial Differential Equations
Fractional Differential Equations Solutions
article

Jacobi‐Galerkin Spectral Method for the Fractional Diffusion Equation

Jing Zhang, Lizhen Chen, Wenfei Lv
article en

Abstract

ABSTRACT An efficient numerical method for approximating the fractional diffusion equation, combining the Jacobi spectral method for spatial discretization with the leapfrog scheme for temporal discretization is proposed in this paper. Instead of the Petrov‐Galerkin one as in literature, the spatial discretization for the source problem is conducted using a standard Galerkin weak formulation. This choice ensures that the resulting discretized linear system retains symmetry and positive definiteness, offering a significant advantage. Furthermore, we provide a rigorous analysis of the stability and convergence of the proposed method. Theoretically, we prove that the spatial discretization via the Jacobi spectral method achieves asymptotically exponential convergence, while the temporal discretization using the leapfrog scheme attains a second‐order convergence rate. To validate the accuracy and efficiency of our approach, we compare it with a classical finite difference method. Finally, several numerical examples are presented to demonstrate the feasibility, stability, and high accuracy of the proposed algorithm.

Numerical Methods for Partial Differential EquationsVol. 42(2)
Central China Normal University (CN), Beijing Computational Science Research Center (CN)
Openalex Percentile: Top 61%
Fractional Differential Equations Solutions
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.