Approximate zeros and condition numbers
type: Item
instance of: scholarly article
title: Approximate zeros and condition numbers
zbMATH Open document ID: 0967.65063
author: Felipe Cucker
published in: Journal of Complexity
publication date: 2000-05-07T00:00:00Z
review text: The paper is an addendum to the paper \textit{F. Cucker} and \textit{S. Smale} [Lect. Notes Comput. Sci. 1461, 115-126 (1998; Zbl 0929.65027)]. Here, the author proves the same result for a different condition number.
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 30C15
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 26C10
zbMATH DE Number: 1439894
zbMATH Keywords: approximate zeros
zbMATH Keywords: condition numbers
zbMATH Keywords: systems of polynomial equations
zbMATH Keywords: complexity bounds
zbMATH Keywords: roundoff error
reviewed by: Aurél Galántai
MaRDI profile type: Publication
full work available at URL: jcom.1999.0503
OpenAlex ID: W2051610907
Wikidata QID: Q57733278
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Q3207128
cites work: Q4720691
DOI: 10.1006/JCOM.1999.0503
description: scientific article; zbMATH DE number 1439894