Abstract
In recent years, a family of numerical algorithms to solve problems in real algebraic and semialgebraic geometry has been slowly growing. Unlike their counterparts in symbolic computation they are numerically stable. But their complexity analysis, based on the condition of the data, is radically different from the usual complexity analysis in symbolic computation as these numerical algorithms may run forever on a thin set of ill-posed inputs.
| Original language | English |
|---|---|
| Pages (from-to) | 373-396 |
| Journal | Chinese Annals of Mathematics. Series B |
| Volume | 39 |
| Issue number | 2 |
| Online published | 2 Feb 2018 |
| DOIs | |
| Publication status | Published - Mar 2018 |
Research Keywords
- Complexity
- Condition
- Numerical algorithms
- Semialgebraic geometry
RGC Funding Information
- RGC-funded
Fingerprint
Dive into the research topics of 'Grid Methods in Computational Real Algebraic (and Semialgebraic) Geometry'. Together they form a unique fingerprint.Projects
- 1 Finished
-
GRF: Computing the Homology of Real Projective Varieties
CUCKER, F. (Principal Investigator / Project Coordinator)
1/10/16 → 30/06/18
Project: Research
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver