Abstract
The numerical solution of spectral fractional diffusion problems in the form \({\mathcal A}^\alpha u = f\) is studied, where \(\mathcal A\) is a selfadjoint elliptic operator in a bounded domain \(\varOmega \subset {\mathbb R}^d\), and \(\alpha \in (0,1]\). The finite difference approximation of the problem leads to the system \({\mathbb A}^\alpha {\mathbf{u}} = {\mathbf{f}}\), where \({\mathbb A}\) is a sparse, symmetric and positive definite (SPD) matrix, and \({\mathbb A}^\alpha \) is defined by its spectral decomposition. In the case of finite element approximation, \({\mathbb A}\) is SPD with respect to the dot product associated with the mass matrix. The BURA method is introduced by the best uniform rational approximation of degree k of \(t^{\alpha }\) in [0, 1], denoted by \(r_{\alpha ,k}\). Then the approximation \(\mathbf{u}_k\approx \mathbf{u}\) has the form \(\mathbf{u}_k = c_0 {\mathbf{f}} +\sum _{i=1}^k c_i({\mathbb A} - {\widetilde{d}}_i {\mathbb I})^{-1}{\mathbf{f}}\), \({\widetilde{d}}_i<0\), thus requiring the solving of k auxiliary linear systems with sparse SPD matrices. The BURA method has almost optimal computational complexity, assuming that an optimal PCG iterative solution method is applied to the involved auxiliary linear systems. The presented analysis shows that the absolute values of first \(\left\{ {\widetilde{d}}_i\right\} _{i=1}^{k'}\) can be extremely large. In such a case the condition number of \({\mathbb A} - {\widetilde{d}}_i {\mathbb I}\) is practically equal to one. Obviously, such systems do not need preconditioning. The next question is if we can replace their solution by directly multiplying \({\mathbf{f}}\) with \(-c_i/{\widetilde{d}}_i\). Comparative analysis of numerical results is presented as a proof-of-concept for the proposed RS-BURA method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bonito, A., Pasciak, J.: Numerical approximation of fractional powers of elliptic operators. Math. Comput. 84(295), 2083–2110 (2015)
Software BRASIL. https://baryrat.readthedocs.io/en/latest/#baryrat.brasil
Harizanov, S., Kosturski, N., Margenov, S., Vutov, Y.: Neumann fractional diffusion problems: BURA solution methods and algorithms. Math. Comput. Simul. 189, 85–98 (2020)
Harizanov, S., Lazarov, R., Margenov, S.: A survey on numerical methods for spectral space-fractional diffusion problems. Frac. Calc. Appl. Anal. 23, 1605–1646 (2020)
Harizanov, S., Lazarov, R., Margenov, S., Marinov, P., Vutov, Y.: Optimal solvers for linear systems with fractional powers of sparse SPD matrices. Numer. Linear Algebra Appl. 25(5), e2167 (2018). https://doi.org/10.1002/nla.2167
Harizanov, S., Lazarov, R., Margenov, S., Marinov, P., Pasciak, J.: Analysis of numerical methods for spectral fractional elliptic equations based on the best uniform rational approximation. J. Comput. Phys. 408, 109285 (2020)
Hofreither, C.: A unified view of some numerical methods for fractional diffusion. Comput. Math. Appl. 80(2), 332–350 (2020)
Hofreither, C.: An algorithm for best rational approximation based on Barycentric rational interpolation. Numer. Algorithms 88(1), 365–388 (2021). https://doi.org/10.1007/s11075-020-01042-0
Stahl, H.: Best uniform rational approximation of \(x^\alpha \) on [0, 1]. Bull. Amer. Math. Soc. (NS) 28(1), 116–122 (1993)
Stahl, H.: Best uniform rational approximation of \(x^\alpha \) on [0, 1]. Acta Math. 190(2), 241–306 (2003)
Varga, R.S., Carpenter, A.J.: Some numerical results on best uniform rational approximation of \(x^\alpha \) on \([0, 1]\). Numer. Algorithms 2(2), 171–185 (1992)
Acknowledgements
We acknowledge the provided access to the e-infrastructure and support of the Centre for Advanced Computing and Data Processing, with the financial support by the Grant No BG05M2OP001-1.001-0003, financed by the Science and Education for Smart Growth Operational Program (2014–2020) and co-financed by the European Union through the European structural and Investment funds.
The presented work is partially supported by the Bulgarian National Science Fund under grant No. DFNI-DN12/1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Harizanov, S., Kosturski, N., Lirkov, I., Margenov, S., Vutov, Y. (2022). Reduced Sum Implementation of the BURA Method for Spectral Fractional Diffusion Problems. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2021. Lecture Notes in Computer Science, vol 13127. Springer, Cham. https://doi.org/10.1007/978-3-030-97549-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-97549-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-97548-7
Online ISBN: 978-3-030-97549-4
eBook Packages: Computer ScienceComputer Science (R0)