On an algorithmic feasibility of source conditions in iterative methods of solving irregular nonlinear equations

Authors

  • M.Yu. Kokurin Mari State University

Keywords:

irregular equation, iterative method, source condition, complexity, polynomial algorithm

Abstract

A relation between an algorithmic feasibility of source conditions in iterative methods for solving irregular nonlinear problems and the «P=NP?» problem is established. On this basis, we estimate the possibilities of polynomial-time algorithmic satisfaction of these conditions.

Author Biography

M.Yu. Kokurin

Mari State University,
The Faculty of Physics and Mathematics
• Professor

References

  1. Бакушинский А.Б., Кокурин М.Ю. Итерационные методы решения некорректных операторных уравнений с гладкими операторами. М.: Едиториал УРСС, 2002.
  2. Bakushinsky A.B., Kokurin M.Yu. Iterative methods for approximate solution of inverse problems. Dordrecht: Springer, 2004.
  3. Бакушинский А.Б., Кокурин М.Ю. Итерационные методы решения нерегулярных уравнений. М.: ЛЕНАНД, 2006.
  4. Бакушинский А.Б. Итеративные методы с нечеткой обратной связью для решения нерегулярных операторных уравнений // Докл. РАН. 2009. 428, N 5. 583-585.
  5. Гэри М., Джонсон Д. Вычислительные машины и труднорешаемые задачи. М.: Мир, 1982.
  6. Bakushinsky A., Smirnova A. Irregular operator equations by iterative methods with undetermined reverse connection // J. Inverse Ill-Posed Probl. 2010. 18, N 2. 147-165.
New computational technologies

Downloads

Published

22-03-2011

How to Cite

Кокурин М. On an Algorithmic Feasibility of Source Conditions in Iterative Methods of Solving Irregular Nonlinear Equations // Numerical Methods and Programming (Vychislitel’nye Metody i Programmirovanie). 2011. 12. 146-151

Issue

Vol. 12 (2011): Issue 1.

Section

Section 1. Numerical methods and applications

Most read articles by the same author(s)