The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
DOI10.1365/s13291-015-0117-yzbMath1321.00071OpenAlexW815771349MaRDI QIDQ494615
Publication date: 1 September 2015
Published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1365/s13291-015-0117-y
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Conditioning of matrices (15A12) General topics in the theory of algorithms (68W01) External book reviews (00A17)
Cites Work
- Fast linear homotopy to find approximate zeros of polynomial systems
- On a problem posed by Steve Smale
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Complexity of Bezout's theorem. V: Polynomial time
- Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
- Complexity of Bezout's theorem. III: Condition number and packing
- Level Sets and Extrema of Random Processes and Fields
- Complexity of Bezout's Theorem I: Geometric Aspects
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Smoothed analysis of algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication: The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
