<p>We define and analyze preconditioners for the Riesz operator <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(-(- \Delta )^{\frac{\alpha }{2}}\)</EquationSource> </InlineEquation>, <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\alpha \in (1,2]\)</EquationSource> </InlineEquation> commonly used in fractional models, such as anomalous diffusion. For <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\alpha\)</EquationSource> </InlineEquation> close to 2 there are various effective preconditioners at disposal with linear computational cost. Seminal results on treatment of the case <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\alpha\)</EquationSource> </InlineEquation> near 1 that still maintains linear computational complexity has been obtained approximating the Riesz operator as a fractional power of a discretized Laplacian, using Gauss-Jacobi formula. In this work, we extend this rational preconditioning approach by leveraging additional quadrature rules with exponential convergence. More precisely, we investigate both sinc and Gauss-Laguerre quadratures and show that, after an opportune choice of the involved parameters, both allow us to construct preconditioners based on a sum of a few shifted Laplacian inverses, and achieve high computational efficiency, ensuring numerical optimality. Several numerical results show that the sinc-based preconditioner is more versatile than the Gauss-Laguerre preconditioner, and that both outperform the Gauss-Jacobi one.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Exploring rational approximations of fractional power operators for preconditioning

  • Lidia Aceto,
  • Mariarosa Mazza

摘要

We define and analyze preconditioners for the Riesz operator \(-(- \Delta )^{\frac{\alpha }{2}}\) , \(\alpha \in (1,2]\) commonly used in fractional models, such as anomalous diffusion. For \(\alpha\) close to 2 there are various effective preconditioners at disposal with linear computational cost. Seminal results on treatment of the case \(\alpha\) near 1 that still maintains linear computational complexity has been obtained approximating the Riesz operator as a fractional power of a discretized Laplacian, using Gauss-Jacobi formula. In this work, we extend this rational preconditioning approach by leveraging additional quadrature rules with exponential convergence. More precisely, we investigate both sinc and Gauss-Laguerre quadratures and show that, after an opportune choice of the involved parameters, both allow us to construct preconditioners based on a sum of a few shifted Laplacian inverses, and achieve high computational efficiency, ensuring numerical optimality. Several numerical results show that the sinc-based preconditioner is more versatile than the Gauss-Laguerre preconditioner, and that both outperform the Gauss-Jacobi one.