Next Article in Journal
Polarization in Political Rallies: A Markovian Agent-Based Model for Opinion Dynamics
Previous Article in Journal
Nomological Deductive Reasoning for Trustworthy, Human-Readable, and Actionable AI Outputs
Previous Article in Special Issue
A Transfer Matrix Norm-Based Framework for Multimaterial Topology Optimization: Methodology and MATLAB Implementation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Structure Approximation-Based Preconditioning for Solving Tempered Fractional Diffusion Equations

School of Mathematics and Statistics, Beijing Technology and Business University, Beijing 100048, China
*
Author to whom correspondence should be addressed.
Algorithms 2025, 18(6), 307; https://doi.org/10.3390/a18060307
Submission received: 14 April 2025 / Revised: 20 May 2025 / Accepted: 21 May 2025 / Published: 23 May 2025
(This article belongs to the Special Issue Numerical Optimization and Algorithms: 3rd Edition)

Abstract

Tempered fractional diffusion equations constitute a critical class of partial differential equations with broad applications across multiple physical domains. In this paper, the Crank–Nicolson method and the tempered weighted and shifted Grünwald formula are used to discretize the tempered fractional diffusion equations. The discretized system has the structure of the sum of the identity matrix and a diagonal matrix multiplied by a symmetric positive definite (SPD) Toeplitz matrix. For the discretized system, we propose a structure approximation-based preconditioning method. The structure approximation lies in two aspects: the inverse approximation based on the row-by-row strategy and the SPD Toeplitz approximation by the τ matrix. The proposed preconditioning method can be efficiently implemented using the discrete sine transform (DST). In spectral analysis, it is found that the eigenvalues of the preconditioned coefficient matrix are clustered around 1, ensuring fast convergence of Krylov subspace methods with the new preconditioner. Numerical experiments demonstrate the effectiveness of the proposed preconditioner.
Keywords: tempered fractional diffusion equations; Krylov subspace method; structure approximation; preconditioning tempered fractional diffusion equations; Krylov subspace method; structure approximation; preconditioning

Share and Cite

MDPI and ACS Style

Zhang, X.; Wang, C. Structure Approximation-Based Preconditioning for Solving Tempered Fractional Diffusion Equations. Algorithms 2025, 18, 307. https://doi.org/10.3390/a18060307

AMA Style

Zhang X, Wang C. Structure Approximation-Based Preconditioning for Solving Tempered Fractional Diffusion Equations. Algorithms. 2025; 18(6):307. https://doi.org/10.3390/a18060307

Chicago/Turabian Style

Zhang, Xuan, and Chaojie Wang. 2025. "Structure Approximation-Based Preconditioning for Solving Tempered Fractional Diffusion Equations" Algorithms 18, no. 6: 307. https://doi.org/10.3390/a18060307

APA Style

Zhang, X., & Wang, C. (2025). Structure Approximation-Based Preconditioning for Solving Tempered Fractional Diffusion Equations. Algorithms, 18(6), 307. https://doi.org/10.3390/a18060307

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop