Haupt-Navigation

Arbeitsgruppe

Lehre

Veranstaltungen
Abschlussarbeiten

Inhalt des Dokuments

Search for Publication

All Publications

The probability that a slightly perturbed numerical analysis problem is difficult
Zitatschlüssel	BCL-The-Probability-That-A-Slightly-Perturbed-Numerical-Analysis-Problem-Is-Difficult
Autor	Peter Bürgisser and Felipe Cucker and Martin Lotz
Seiten	1559-1583
Jahr	2008
Journal	Math. Comp.
Jahrgang	77
Notiz	Warning: unfortunately, due to an error in the production of the paper, binomial coefficients have been replaced by fractions at several places in the journal version! For a correct version see arXiv math/0610270
Zusammenfassung	We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs. Several applications to linear and polynomial equation solving show that the estimates obtained in this way are easy to derive and quite accurate. The main theorem is based on a volume estimate of $ varepsilon$-tubular neighborhoods around a real algebraic subvariety of a sphere, intersected with a spherical disk of radius σ. Besides 𝜀 and σ, this bound depends only on the dimension of the sphere and on the degree of the defining equations.

Link zur Publikation [1] Link zur Originalpublikation [2] Download Bibtex Eintrag [3]

Zurück [4]

------ Links: ------

[1] http://www3.math.tu-berlin.de/algebra/work/NA061027
0.pdf

[2] http://www.ams.org/journals/mcom/2008-77-263/S0025-
5718-08-02060-7/home.html

[3] https://www.math.tu-berlin.de/fachgebiete_ag_diskal
g/fachgebiet_algorithmische_algebra/v_menue/publication
s/parameter/de/font5/maxhilfe/?no_cache=1&tx_sibibt
ex_pi1%5Bdownload_bibtex_uid%5D=1351030&tx_sibibtex
_pi1%5Bcontentelement%5D=tt_content%3A541745

[4] https://www.math.tu-berlin.de/fachgebiete_ag_diskal
g/fachgebiet_algorithmische_algebra/v_menue/publication
s/parameter/de/font5/maxhilfe/