Some lower bounds for the complexity of continuation methods (Q1279910): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Stephen Smale / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Jürgen Guddat / rank | |||
Normal rank | |||
Revision as of 01:30, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some lower bounds for the complexity of continuation methods |
scientific article |
Statements
Some lower bounds for the complexity of continuation methods (English)
0 references
17 August 1999
0 references
The authors consider the zero-finding problem for a homogeneous polynomial system. The main results are two lower bounds for the complexity of a Newton continuation method sequence.
0 references
homogeneous polynomial system
0 references
Newton continuation methods
0 references
complexity bounds
0 references
