Estamos realizando la búsqueda. Por favor, espere...
1583
37
170
29013
4402
2599
347
386
Abstract: In a recent work Shub (Found. Comput. Math. 9:171?178, 2009), Shub obtained a new upper bound for the number of steps needed to continue a known zero ?0 of a system f0, to a zero ?T of an input system fT , following the path of pairs ( ft, ?t), where ft, t ? [0, T ] is a polynomial system and ft(?t) = 0. He proved that if one can choose the step-size in an optimal way, then the number of steps is essentially bounded by the length of the path of ( ft, ?t) in the so-called condition metric. However, the proof of that result in Shub (Found. Comput. Math. 9:171?178, 2009) is not constructive. We give an explicit description of an algorithm which attains that complexity bound, including the choice of step-size.
Autoría: Beltrán C.,
Fuente: Numerische Mathematik (2011) 117:89-113
Editorial: Springer New York LLC
Año de publicación: 2011
Nº de páginas: 25
Tipo de publicación: Artículo de Revista
DOI: 10.1007/s00211-010-0334-3
ISSN: 0029-599X,0945-3245
Url de la publicación: https://doi.org/10.1007/s00211-010-0334-3
Leer publicación
CARLOS BELTRAN ALVAREZ
Volver