RUS  ENG
Full version
JOURNALS // Matematicheskoe modelirovanie // Archive

Matem. Mod., 2018 Volume 30, Number 10, Pages 67–85 (Mi mm4009)

This article is cited in 2 papers

An adaptive Chebyshev iterative method

V. T. Zhukov, N. D. Novikova, O. B. Feodoritova

Keldysh Institute of Applied Mathematics of RAS, Moscow

Abstract: For the numerical solution of a boundary-value problem of three-dimensional elliptic equations an adaptive Chebyshev iterative method is constructed. In this adaptive method, the unknown lower bound of the spectrum of the discrete operator is refined in the additional cycle of the iterative method; the upper bound of the spectrum is taken to be its estimate by the Gershgorin theorem. Such procedure ensures the convergence of the constructed adaptive method with computational costs close to the costs of the Chebyshev method, which uses the exact boundaries of the spectrum of the discrete operator.

Keywords: elliptic equations, Chebyshev polynomials, adaptive method.

Received: 30.10.2017


 English version:
Mathematical Models and Computer Simulations, 2019, 11:3, 426–437


© Steklov Math. Inst. of RAS, 2024