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

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.