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.
| Original language | English |
|---|---|
| Pages (from-to) | 113-184 |
| Journal | Journal of the ACM |
| Volume | 46 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 1999 |
Research Keywords
- 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
Fingerprint
Dive into the research topics of 'Complexity Estimates Depending on Condition and Round-Off Error'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver