An iterative Chebyshev spectral solver for two-dimensional elliptic equations with variable coefficients

  • Vasiliy M. Volkov Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus
  • Ekaterina I. Kachalouskaya Brest State A. S. Pushkin University, 21 Kasmanawtaw Boulevard, Brest 224016, Belarus

Abstract

In this paper, we constructed and investigated two variants of iterative algorithms implemented the Chebyshev spectral method solving two-dimensional elliptic equations with variable coefficients. The considered algorithms are based on the use of the stabilised version of the bi-conjugate gradient iterative method with a combined preconditioner in the form of a diagonal matrix of equation coefficients and the discrete analogue of the Laplace operator represented by the finite difference or spectral approximations. To process the discrete analogue of the Laplace operator, we implemented the alternative direction implicit method with an optimal set of iterative parameters and the Bartels – Stewart algorithm in the first and the second cases respectively. Based on numerical experiments, we showed the high efficiency of the proposed algorithms. In both cases, the number of iterations is practically independent of the mesh size and increases moderately with an increasing degree of heterogeneity of the problem coefficients. The computational complexity of the algorithms is estimated as O(NN1/2), where N is the number of grid points. Despite of the significant suboptimality of the computational complexity, in the case of a moderate grid size N = n × n, n ≤ 300, the computation time demonstrates values no worse than those of algorithms of optimal computational complexity O(N).

Author Biographies

Vasiliy M. Volkov, Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus

doctor of science (physics and mathematics), docent; professor at the department of web-technologies and computer simulation, faculty of mechanics and mathematics

 

Ekaterina I. Kachalouskaya, Brest State A. S. Pushkin University, 21 Kasmanawtaw Boulevard, Brest 224016, Belarus

senior lecturer at the department of applied mathematics and informatics, faculty of physics and mathematics

References

  1. Boyd JP. Chebyshev and Fourier spectral methods. 2nd edition. New York: Dover Publications; 2000. XVI, 594 p.
  2. Trefethen LN. Spectral methods in MATLAB. Philadelphia: Society for Industrial and Applied Mathematics; 2000. XVII, 165 p. (Dongarra JJ, Demmel JW, Gannon D, Grosse E, Moré JJ, editors. Software, environments, and tools).
  3. Orszag SA. Spectral methods for problems in complex geometrics. In: Parter SV, editor. Numerical methods for partial differential equations. Proceedings of an advanced seminar; 1978 October 23–25; Madison, USA. New York: Academic Press; 1979. p. 273–305 (Publication of the Mathematics Research Center, the University of Wisconsin – Madison; No. 42). DOI: 10.1016/B978-0-12-546050-7.50014-9.
  4. D’yakonov EG. Optimization in solving elliptic problems. McCormick S, editor. Boca Raton: CRC Press; 2018. XXVIII, 561 p. (CRC revivals).
  5. Fortunato D, Townsend A. Fast Poisson solvers for spectral methods. IMA Journal of Numerical Analysis. 2020;40(3):1994–2018. DOI: 10.1093/imanum/drz034.
  6. Jbilou K. ADI preconditioned Krylov methods for large Lyapunov matrix equations. Linear Algebra and its Applications. 2010; 432(10):2473–2485. DOI: 10.1016/j.laa.2009.12.025.
  7. van der Vorst HA. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing. 1992;13(2):631–644. DOI: 10.1137/0913035.
  8. Samarskii AA, Nikolaev ES. Metody resheniya setochnykh uravnenii [Methods for solving grid equations]. Moscow: Nauka; 1978. 592 p. Russian.
  9. Bartels RH, Stewart GW. Algorithm 432 [C2]: solution of the matrix equation AX + XB = C [F4]. Communications of the ACM. 1972;15(9):820–826. DOI: 10.1145/361573.361582.
  10. Damm T. Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations. Numerical Linear Algebra with Applications. 2008;15(9):853–871. DOI: 10.1002/nla.603.
  11. Volkov VM, Prakonina AU. Iterative realization of finite difference schemes in the fictitious domain method for elliptic problems with mixed derivatives. Journal of the Belarusian State University. Mathematics and Informatics. 2019;1:69–76. Russian. DOI: 10.33581/2520-6508-2019-1-69-76.
Published
2023-12-13
Keywords: Chebyshev spectral methods, bi-conjugate gradient method, alternative direction implicit method, Bartels – Stewart algorithm, elliptic equations
How to Cite
Volkov, V. M., & Kachalouskaya, E. I. (2023). An iterative Chebyshev spectral solver for two-dimensional elliptic equations with variable coefficients. Journal of the Belarusian State University. Mathematics and Informatics, 3, 53-62. Retrieved from https://journals.bsu.by/index.php/mathematics/article/view/5668
Issue
No 3 (2023): Journal of the Belarusian State University. Mathematics and Informatics
Section
Computational Mathematics

Copyright (c) 2023 Journal of the Belarusian State University. Mathematics and Informatics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

The authors who are published in this journal agree to the following:

  1. The authors retain copyright on the work and provide the journal with the right of first publication of the work on condition of license Creative Commons Attribution-NonCommercial. 4.0 International (CC BY-NC 4.0).
  2. The authors retain the right to enter into certain contractual agreements relating to the non-exclusive distribution of the published version of the work (e.g. post it on the institutional repository, publication in the book), with the reference to its original publication in this journal.
  3. The authors have the right to post their work on the Internet (e.g. on the institutional store or personal website) prior to and during the review process, conducted by the journal, as this may lead to a productive discussion and a large number of references to this work. (See The Effect of Open Access.)