OPTIMAL AND LOW-MEMORY NEAR-OPTIMAL PRECONDITIONING OF FULLY IMPLICIT RUNGE--KUTTA SCHEMES FOR PARABOLIC PDEs.
Saved in:
| Title: | OPTIMAL AND LOW-MEMORY NEAR-OPTIMAL PRECONDITIONING OF FULLY IMPLICIT RUNGE--KUTTA SCHEMES FOR PARABOLIC PDEs. |
|---|---|
| Authors: | XIANGMIN JIAO, XUEBIN WANG, QIAO CHEN |
| Source: | SIAM Journal on Scientific Computing; 2021, Vol. 43 Issue 5, pA3527-A3551, 25p |
| Subject Terms: | PARABOLIC differential equations, ADVECTION-diffusion equations, FINITE difference method, FINITE element method |
| Abstract: | Runge--Kutta (RK) schemes, especially Gauss--Legendre and some other fully implicit RK (FIRK) schemes, are desirable for the time integration of parabolic partial differential equations due to their A-stability and high-order accuracy. However, it is significantly more challenging to construct optimal preconditioners for them compared to diagonally implicit RK (DIRK) schemes. To address this challenge, we first introduce mathematically optimal preconditioners called block complex Schur decomposition (BCSD), block real Schur decomposition (BRSD), and block Jordan form (BJF), motivated by block-circulant preconditioners and Jordan form solution techniques for IRK. We then derive an efficient, near-optimal singly diagonal approximate BRSD (SABRSD) by approximating the quasi-triangular matrix in real Schur decomposition using an optimized uppertriangular matrix with a single diagonal value. A desirable feature of SABRSD is that it has a similar memory requirement and factorization (or setup) cost as singly DIRK (SDIRK). We approximate the diagonal blocks in these preconditioning techniques using an incomplete factorization with (near) linear complexity, such as multilevel ILU, ILU(0), or a multigrid method with an ILU-based smoother. We apply the block preconditioners in right-preconditioned GMRES to solve the advection-diffusion equation in 3D using finite element and finite difference methods. We show that BCSD, BRSD, and BJF significantly outperform other preconditioners in terms of GMRES iterations, and SABRSD is competitive with them and the prior state of the art in terms of computational cost while requiring the least amount of memory. [ABSTRACT FROM AUTHOR] |
| Copyright of SIAM Journal on Scientific Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Nájsť tento článok vo Web of Science Be the first to leave a comment!