We propose a rational preconditioner for an efficient numerical solution of linear systems arising from the discretization of multi-dimensional Riesz fractional diffusion equations. In particular, the discrete problem is obtained by employing finite difference or finite element methods to approximate the fractional derivatives of order alfa with α Є (1,2]. The proposed preconditioner is then defined as a rational approximation of the Riesz operator expressed as the integral of the standard heat diffusion semigroup. We show that, being the sum of K inverses of shifted Laplacian matrices, the resulting preconditioner belongs to the generalized locally Toeplitz class. As a consequence, we are able to provide the asymptotic description of the spectrum of the preconditioned matrices and we show that, despite the lack of clustering just as for the Laplacian, our preconditioner for α close to 1 and K ≠ 1 reasonably small, provides better results than the Laplacian itself, while sharing the same computational complexity.
Aceto, L., Mazza, M. (2023). A rational preconditioner for multi-dimensional Riesz fractional diffusion equations. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 143, 372-382 [10.1016/j.camwa.2023.05.016].
A rational preconditioner for multi-dimensional Riesz fractional diffusion equations
Mazza M.
2023-01-01
Abstract
We propose a rational preconditioner for an efficient numerical solution of linear systems arising from the discretization of multi-dimensional Riesz fractional diffusion equations. In particular, the discrete problem is obtained by employing finite difference or finite element methods to approximate the fractional derivatives of order alfa with α Є (1,2]. The proposed preconditioner is then defined as a rational approximation of the Riesz operator expressed as the integral of the standard heat diffusion semigroup. We show that, being the sum of K inverses of shifted Laplacian matrices, the resulting preconditioner belongs to the generalized locally Toeplitz class. As a consequence, we are able to provide the asymptotic description of the spectrum of the preconditioned matrices and we show that, despite the lack of clustering just as for the Laplacian, our preconditioner for α close to 1 and K ≠ 1 reasonably small, provides better results than the Laplacian itself, while sharing the same computational complexity.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.