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

V. M. Volkov ; E. I. Kachalouskaya

Journal of the Belarusian State University. Mathematics and Informatics, Tome 3 (2023), pp. 53-62.

Résumé

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(N\sqrt{N})$, 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\times n, n\leq 300$, the computation time demonstrates values no worse than those of algorithms of optimal computational complexity $O(N)$.

Détail

Mots-clés : Chebyshev spectral methods; bi-conjugate gradient method; alternative direction implicit method; Bartels – Stewart algorithm; elliptic equations.

Bibliographie

[1] J. P. Boyd, Chebyshev and Fourier spectral methods, 2nd edition, Dover Publications, New York, 2000, XVI+594 pp.

[2] L. N. Trefethen, Spectral methods in MATLAB, Society for Industrial and Applied Mathematics, Philadelphia, 2000, XVII+165 pp. | Zbl

[3] S. A. Orszag, “Spectral methods for problems in complex geometrics”, Numerical methods for partial differential equations, Proceedings of an advanced seminar, Publication of the Mathematics Research Center, 42, Academic Press, New York, 1979, 273–305 | DOI

[4] E. G. D’yakonov, Optimization in solving elliptic problems, CRC Press, Boca Raton, 2018, XXVIII+561 pp.

[5] D. Fortunato, A. Townsend, “Fast Poisson solvers for spectral methods”, IMA Journal of Numerical Analysis, 40(3) (2020), 1994–2018 | DOI | Zbl

[6] K. Jbilou, “ADI preconditioned Krylov methods for large Lyapunov matrix equations”, Linear Algebra and its Applications, 432(10) (2010), 2473–2485 | DOI | Zbl

[7] H. A. Van-der-Vorst, “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, 13(2) (1992), 631–644 | DOI | Zbl

[8] A. A. Samarskii, E. S. Nikolaev, Metody resheniya setochnykh uravnenii, Nauka, Moskva, 1978, +592 pp.

[9] R. H. Bartels, G. W. Stewart, “Algorithm 432 [C2]: solution of the matrix equation AX + XB = C [F4]”, Communications of the ACM, 15(9) (1972), 820–826 | DOI | Zbl

[10] T. Damm, “Direct methods and ADI-preconditioned Krylov subspace methods for generalized Lyapunov equations”, Numerical Linear Algebra with Applications, 15(9) (2008), 853–871 | DOI | Zbl

[11] V. M. Volkov, E. V. Prokonina, “Iteratsionnaya realizatsiya raznostnykh skhem v metode fiktivnykh oblastei dlya ellipticheskikh zadach so smeshannymi proizvodnymi”, Zhurnal Belorusskogo gosudarstvennogo universiteta. Matematika. Informatika, 1 (2019), 69–76 | DOI