Artículo

A note on the finite variance of the averaging function for polynomial system solving

Beltran, Carlos; Shub, Michael IraIcon
Fecha de publicación: 05/2010
Editorial: Springer
Revista: Foundations Of Computational Mathematics
ISSN: 1615-3375
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

Resumen

In the forthcoming paper of Beltrán and Pardo, the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, and even polynomial in the size of the input. In this paper, we prove that some other higher moments are also finite. In particular, we show that the variance is polynomial in the size of the input.
Palabras clave: Polynomial Systems , Condition Metric
 
Archivos asociados
Tamaño: 423.7Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/restrictedAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/15083
URL: https://link.springer.com/article/10.1007/s10208-009-9054-4
DOI: http://dx.doi.org/10.1007/s10208-009-9054-4
Colecciones
Articulos(IMAS)
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Citación
Beltran, Carlos; Shub, Michael Ira; A note on the finite variance of the averaging function for polynomial system solving; Springer; Foundations Of Computational Mathematics; 10; 1; 5-2010; 115-125
Compartir
Altmétricas