Abstract:
The properties of a mathematical programming problem that arises in finding a stable (in the sense of Tikhonov) solution to a system of linear algebraic equations with an approximately given augmented coefficient matrix are examined. Conditions are obtained that determine whether this problem can be reduced to the minimization of a smoothing functional or to the minimal matrix correction of the underlying system of linear algebraic equations. A method for constructing (exact or approximately given) model systems of linear algebraic equations with known Tikhonov solutions is described. Sharp lower bounds are derived for the maximal error in the solution of an approximately given system of linear algebraic equations under finite perturbations of its coefficient matrix. Numerical examples are given.
Key words:approximately given system of linear algebraic equations, regularization, minimal matrix correction.
Fulltext:
PDF file (323 kB)