The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Interior-point methods (90C51) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical computation of solutions to systems of equations (65H10) External book reviews (00A17) Conditioning of matrices (15A12) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of algorithms (68W01)
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 3350966 (Why is no real title available?)
- Complexity of Bezout's Theorem I: Geometric Aspects
- Complexity of Bezout's theorem. III: Condition number and packing
- Complexity of Bezout's theorem. V: Polynomial time
- 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 IV: Probability of Success; Extensions
- Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
- Fast linear homotopy to find approximate zeros of polynomial systems
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Level Sets and Extrema of Random Processes and Fields
- On a problem posed by Steve Smale
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494615)
