General scheme of one-step variational-gradient methods for linear equations

DOI10.1007/BF02742071MaRDI QIDQ1280944zbMATH OpenFDO

Authors A. Yu. Luchka, O. É. Noshchenko, N. I. Tukalevskaya

Publication date 6 July 1999

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02742071

computer algorithms Hilbert space linear equation variational-gradient methods

Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions to equations with linear operators (65J10)

Review text

The authors propose a general scheme for the construction of one-step variational-gradient methods to solve the linear equation \(Au=f\), where \(A\) is a bounded linear operator that acts in a Hilbert space \(H\). A theoretical justification of the scheme is given. The authors consider some particular cases of this method that can be implemented in the form of computer algorithms. The construction of these algorithms depends on the properties of the operator \(A\), and also on the choice of the operators and the system of linearly independed functions in the variational-gradient method.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: General scheme of one-step variational-gradient methods for linear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280944)