Application of the Richardson Method in the Case of an Unknown Lower Bound of the Problem Spectrum


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

An algorithm is presented, which enables us to use the iterative Richardson method for solving a system of linear algebraic equations with the matrix corresponding to a sign-definite selfadjoint operator, in the absence of information about the lower boundary of the spectrum of the problem. The algorithm is based on the simultaneous operation of two competing processes, the effectiveness of which is constantly analyzed. The elements of linear algebra concerning the spectral estimates, which are necessary to understand the details of the Richardson method with the Chebyshev set of parameters, are presented. The method is explained on the example of a one-dimensional equation of the elliptic type.

作者简介

M. Popov

École Normale Supérieure de Lyon, CRAL (UMR CNRS 5574); Keldysh Institute of Applied Mathematics

编辑信件的主要联系方式.
Email: hecon@mail.ru
法国, Lyon; Moscow

Yu. Poveschenko

Keldysh Institute of Applied Mathematics; National Research Nuclear University MEPhI

Email: hecon@mail.ru
俄罗斯联邦, Moscow; Moscow

V. Gasilov

Keldysh Institute of Applied Mathematics; National Research Nuclear University MEPhI

Email: hecon@mail.ru
俄罗斯联邦, Moscow; Moscow

A. Koldoba

Moscow Institute of Physics and Technology

Email: hecon@mail.ru
俄罗斯联邦, Dolgoprudny, Moscow oblast

T. Poveschenko

Kurchatov Institute of Atomic Energy

Email: hecon@mail.ru
俄罗斯联邦, Moscow


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##