An efficient strategy for the numerical solution of time-fractional diffusion-reaction problems is devised. A standard finite difference discretization of the space derivative is initially applied which results in a linear stiff term. Then a rectangular product-integration (PI) rule is implemented in an implicit-explicit (IMEX) framework in order to implicitly treat this linear stiff term and handle in an explicit way the non-linear, and usually non-stiff, term. The kernel compression scheme (KCS) is successively adopted to reduce the overload of computation and storage need for the persistent memory term. To reduce the computational effort the semidiscretized problem is described in a matrix-form, so as to require the solution of Sylvester equations only with small matrices. Theoretical results on the accuracy, together with strategies for the optimal selection of the main parameters of the whole method, are derived and verified by means of numerical experiments carried out in two-dimensional domains. The computational advantages with respect to other approaches are also shown and some applications to the detection of pattern formation are illustrated at the end of the paper.
A computationally efficient strategy for time-fractional diffusion-reaction equations / Garrappa, Roberto; Popolizio, Marina. - In: COMPUTERS & MATHEMATICS WITH APPLICATIONS. - ISSN 0898-1221. - STAMPA. - 116:(2022), pp. 181-193. [10.1016/j.camwa.2021.05.027]
A computationally efficient strategy for time-fractional diffusion-reaction equations
Marina Popolizio
2022-01-01
Abstract
An efficient strategy for the numerical solution of time-fractional diffusion-reaction problems is devised. A standard finite difference discretization of the space derivative is initially applied which results in a linear stiff term. Then a rectangular product-integration (PI) rule is implemented in an implicit-explicit (IMEX) framework in order to implicitly treat this linear stiff term and handle in an explicit way the non-linear, and usually non-stiff, term. The kernel compression scheme (KCS) is successively adopted to reduce the overload of computation and storage need for the persistent memory term. To reduce the computational effort the semidiscretized problem is described in a matrix-form, so as to require the solution of Sylvester equations only with small matrices. Theoretical results on the accuracy, together with strategies for the optimal selection of the main parameters of the whole method, are derived and verified by means of numerical experiments carried out in two-dimensional domains. The computational advantages with respect to other approaches are also shown and some applications to the detection of pattern formation are illustrated at the end of the paper.File | Dimensione | Formato | |
---|---|---|---|
2022_A_computationally_efficient_strategy_for_time-fractional_diffusion-reaction_equations_preprint.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Creative commons
Dimensione
1.43 MB
Formato
Adobe PDF
|
1.43 MB | Adobe PDF | Visualizza/Apri |
2022_A_computationally_efficient_strategy_for_time-fractional_diffusion-reaction_equations_pdfeditoriale.pdf
solo gestori catalogo
Tipologia:
Versione editoriale
Licenza:
Tutti i diritti riservati
Dimensione
1.31 MB
Formato
Adobe PDF
|
1.31 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.