Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
From MaRDI portal
Publication:5220197
Cites work
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 503395 (Why is no real title available?)
- scientific article; zbMATH DE number 3992817 (Why is no real title available?)
- A continuation method to solve polynomial systems and its complexity
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- A stable, polynomial-time algorithm for the eigenpair problem
- Adaptive step-size selection for homotopy methods to solve polynomial equations
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
- Certified predictor-corrector tracking for Newton homotopies
- 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
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Condition length and complexity for the solution of polynomial systems
- Condition. The geometry of numerical algorithms
- Curvature Measures
- Efficient polynomial system-solving by numerical methods
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- Fast linear homotopy to find approximate zeros of polynomial systems
- Fixed points, zeros and Newton's method
- Mathematical problems for the next century
- Modern computer algebra
- Most tensor problems are NP-hard
- Numerically solving polynomial systems with Bertini
- On Smale's 17th problem: a probabilistic positive solution
- On a problem posed by Steve Smale
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- On the distance to the zero set of a homogeneous polynomial
- On the efficiency of algorithms of analysis
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- The Probability That a Numerical Analysis Problem is Difficult
- The complexity of partial derivatives
- The condition number of join decompositions
- The kinematic formula in Riemannian homogeneous spaces
- Unitary Triangularization of a Nonsymmetric Matrix
Cited in
(8)- On Smale's 17th problem: a probabilistic positive solution
- Algebraic compressed sensing
- Functional norms, condition numbers and numerical algorithms in algebraic geometry
- Smale 17th Problem: Advances and Open Directions
- Rigid continuation paths II. structured polynomial systems
- Random points on an algebraic manifold
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- Smoothed analysis for the condition number of structured real polynomial systems
This page was built for publication: Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220197)
