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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

M. V. Popov

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

Author for correspondence.
Email: hecon@mail.ru
France, Lyon; Moscow

Yu. A. Poveschenko

Keldysh Institute of Applied Mathematics; National Research Nuclear University MEPhI

Email: hecon@mail.ru
Russian Federation, Moscow; Moscow

V. A. Gasilov

Keldysh Institute of Applied Mathematics; National Research Nuclear University MEPhI

Email: hecon@mail.ru
Russian Federation, Moscow; Moscow

A. V. Koldoba

Moscow Institute of Physics and Technology

Email: hecon@mail.ru
Russian Federation, Dolgoprudny, Moscow oblast

T. S. Poveschenko

Kurchatov Institute of Atomic Energy

Email: hecon@mail.ru
Russian Federation, Moscow


Copyright (c) 2018 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies