Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya
General information
Latest issue

Search papers
Search references

Latest issue
Current issues
Archive issues
What is RSS

Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.:

Personal entry:
Save password
Forgotten password?

Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2017, Volume 13, Issue 1, Pages 4–16 (Mi vspui316)  

Applied mathematics

About A. N. Tikhonov's regularized least squares method

V. I. Erokhina, V. V. Volkovb

a Mozhaisky Military Space Academy, 13, Jdanovskaya ul., St. Petersburg, 197198, Russian Federation
b Borisoglebsk branch of Voronezh State University, 43, Narondaya ul., Borisoglebsk, 397160, Russian Federation

Abstract: The Tikhonov's regularized least squares method (RLS) and its applications to problems of noisy data processing are considered. The starting point of this research is method for solving approximate systems of linear algebraic equations (SLAE), proposed by A. N. Tikhonov in 1980 that he later named 'RLS'. The traditional method of finding sustainable solutions of the problems with approximate data is Tikhonov's regularization: unconditional minimization of the smoothing functional. RLS differs from this approach. This method makes use of the solution approach to the mathematical programming problem of a special kind. Nowadays RLS has not become a common tool for solving approximate linear systems, and the theory of RLS is not well researched. The purpose of the article is to remedy this deficiency. A number of important theoretical and practical aspects of RLS are considered. New results are presented. One of the results is the method of constructing a model SLAE with the exact right-hand side and approximate matrix for which a priori lower bounds for the maximum relative error of RLS are achieved. It is shown that, under certain conditions, RLS reduces to the problem of minimizing the smoothing functional or to the least squares method or — and this is an unexpected result — to the problem of finding a stationary point of smoothing functional with a negative regularization parameter. The algebraic transformation which reduces the conditionality of the RLS problem to a numerical solution is constructed and substantiated. We propose illustrative example of RLS through an applied image restoration problem for an image, registered by a device with an inexact point-spread function. The results of computational experiments are given. Refs 18. Figs 3.

Keywords: the approximate system of linear algebraic equations, regularized least squares method.

Funding Agency Grant Number
Russian Foundation for Basic Research 16-31-50016_мол_нр


Full text: PDF file (389 kB)
References: PDF file   HTML file

UDC: 519.6
Received: June 2, 2016
Accepted: January 19, 2017

Citation: V. I. Erokhin, V. V. Volkov, “About A. N. Tikhonov's regularized least squares method”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 13:1 (2017), 4–16

Citation in format AMSBIB
\by V.~I.~Erokhin, V.~V.~Volkov
\paper About A.\,N.~Tikhonov's regularized least squares method
\jour Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr.
\yr 2017
\vol 13
\issue 1
\pages 4--16

Linking options:

    SHARE: FaceBook Twitter Livejournal

    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Вестник Санкт-Петербургского университета. Серия 10. Прикладная математика. Информатика. Процессы управления
    Number of views:
    This page:183
    Full text:21
    First page:20

    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022