Complexity Estimates Depending on Condition and Round-Off Error

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

43 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)113-184
Journal / PublicationJournal of the ACM
Volume46
Issue number1
Publication statusPublished - Jan 1999

Abstract

This paper has two agendas. One is to develop the foundations of round-off in computation. The other is to describe an algorithm for deciding feasibility for polynomial systems of equations and inequalities together with its complexity analysis and its round-off properties. Each role reinforces the other.

Research Area(s)

  • Algorithms, Conditioning, Error analysis, F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems, Feasibility of polynomial systems, G.1.5 [Numerical Analysis]: Roots of Nonlinear Equations, Iterative methods, Theory

Citation Format(s)

Complexity Estimates Depending on Condition and Round-Off Error. / CUCKER, FELIPE; SMALE, STEVE.
In: Journal of the ACM, Vol. 46, No. 1, 01.1999, p. 113-184.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review