Rigid continuation paths II. structured polynomial systems

DOI10.1017/fmp.2023.7arXiv2010.10997OpenAlexW4287635612MaRDI QIDQ6103341

Felipe Cucker, Peter Bürgisser, Pierre Lairez

Publication date: 2 June 2023

Published in: Forum of Mathematics, Pi (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.10997

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Real zeros of mixed random fewnomial systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Condition length and complexity for the solution of polynomial systems
• A continuation method to solve polynomial systems and its complexity
• Fast linear homotopy to find approximate zeros of polynomial systems
• On a problem posed by Steve Smale
• Fixed points, zeros and Newton's method
• Certified predictor-corrector tracking for Newton homotopies
• On Smale's 17th problem: a probabilistic positive solution
• Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
• Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
• On condition numbers and the distance to the nearest ill-posed problem
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• The complexity of partial derivatives
• Complexity of Bezout's theorem. V: Polynomial time
• Completeness and reduction in algebraic complexity theory
• Mathematical problems for the next century
• A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Robust certified numerical homotopy tracking
• Mixed precision path tracking for polynomial homotopy continuation
• Complexity of Bezout's theorem. III: Condition number and packing
• Characterizing Valiant's algebraic complexity classes
• Condition
• Certified Numerical Homotopy Tracking
• Univariate polynomials
• Algorithm 921
• Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
• Curvature Measures
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
• A Global Lojasiewicz Inequality for Algebraic Varieties
• Complexity of Bezout's Theorem I: Geometric Aspects
• The kinematic formula in Riemannian homogeneous spaces
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Multihomogeneous Newton methods
• A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
• Condition of Intersecting a Projective Variety with a Varying Linear Subspace
• A Gröbner free alternative for polynomial system solving
• Verified error bounds for multiple roots of systems of nonlinear equations

This page was built for publication: Rigid continuation paths II. structured polynomial systems