𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Method of determining lower bounds for the complexity of P-schemes

✍ Scribed by V. M. Khrapchenko

Publisher
SP MAIK Nauka/Interperiodica
Year
1971
Tongue
English
Weight
273 KB
Volume
10
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some Lower Bounds for the Complexity of
Some Lower Bounds for the Complexity of Continuation Methods
✍ Jean-Pierre Dedieu; Steve Smale πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 222 KB

In this note we consider the zero-finding problem for a homogeneous polynomial system, The well-determined (m=n) and underdetermined (m<n) cases are considered together. We also let D=max d i , d=(d 1 , ..., d m ), and The projective Newton method has been introduced by Shub in [6] and is defined