|
Документ взят из кэша поисковой машины. Адрес
оригинального документа
: http://num-meth.srcc.msu.ru/english/zhurnal/tom_2011/v12r118.html
Дата изменения: Fri Mar 25 16:21:44 2011 Дата индексирования: Mon Oct 1 22:53:06 2012 Кодировка: |
|
"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 |