"On an algorithmic feasibility of source conditions in iterative methods of solving irregular nonlinear equations"
Kokurin M.Yu.

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.

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

Kokurin M.Yu.   e-mail: kokurinm@yandex.ru