Minimal discrepancy method

minimal residual method

An iteration method for the solution of an operator equation

(1)

with a self-adjoint positive-definite bounded operator acting in a Hilbert space , and with a given element . The formula for the minimal discrepancy method takes the form

(2)

where the parameter

(3)

is chosen in each step from the condition for maximal minimization of the norm of the discrepancy (or residual vector) ; that is, it is required that

(4)

If the spectrum of belongs to an interval on the real line, where are positive numbers, then the sequence of approximations in the method (2)–(3) converges to a solution of (1) with the speed of a geometric progression with multiplier .

Different ways of defining the scalar product in lead to different iteration methods. In particular, for special scalar products the formulas for the minimal discrepancy method coincide with the formulas for the method of steepest descent (cf. Steepest descent, method of) and the method of minimal errors (see [2]).

The condition for the convergence of the minimal discrepancy method may be weakened in comparison with that given above if it is considered on certain subsets of . For example, if the minimal discrepancy method is considered only in real spaces, then it is possible to drop the requirement that be self-adjoint (see [3]–[5]).

References

[1]	M.A. Krasnosel'skii, S.G. Krein, "An iteration process with minimal residuals" Mat. Sb. , 31 (1952) pp. 315–334 (In Russian)
[2]	M.A. Krasnosel'skii, G.M. Vainikko, P.P. Zabreiko, et al., "Approximate solution of operator equations" , Wolters-Noordhoff (1972) (Translated from Russian)
[3]	A.A. Samarskii, "Theorie der Differenzverfahren" , Akad. Verlagsgesell. Geest u. Portig K.-D. (1984) (Translated from Russian)
[4]	G.I. Marchuk, Yu.A. Kuznetsov, "Iterative methods and quadratic functionals" , Novosibirsk (1972) (In Russian)
[5]	G.I. Marchuk, Yu.A. Kuznetsov, "Sur les méthodes numériques en sciences physique et economique" , Dunod (1974) (Translated from Russian)