Fast linear homotopy to find approximate zeros of polynomial systems
From MaRDI portal
Publication:626447
DOI10.1007/S10208-010-9078-9zbMATH Open1232.65075OpenAlexW2061860086MaRDI QIDQ626447FDOQ626447
Authors: Luis Miguel Pardo, Carlos Beltran 
Publication date: 18 February 2011
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-010-9078-9
Recommendations
- Complexity of Bezout's theorem. V: Polynomial time
- On Smale's 17th problem: a probabilistic positive solution
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Condition length and complexity for the solution of polynomial systems
Complexity and performance of numerical algorithms (65Y20) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of roots of polynomial equations (65H04) Solving polynomial systems; resultants (13P15)
Cites Work
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Algorithm 795
- Tails of Condition Number Distributions
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- On a theory of computation and complexity over the real numbers: đđ- completeness, recursive functions and universal machines
- The complexity of partial derivatives
- Eigenvalues and Condition Numbers of Random Matrices
- Title not available (Why is that?)
- The hardness of polynomial equation solving
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- On Smale's 17th problem: a probabilistic positive solution
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Complexity of Bezoutâs Theorem IV: Probability of Success; Extensions
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezout's Theorem I: Geometric Aspects
- Title not available (Why is that?)
- Certified numerical homotopy tracking
- Condition Numbers of Gaussian Random Matrices
- Bertini\_real: software for one- and two-dimensional real algebraic sets
- A note on the finite variance of the averaging function for polynomial system solving
- Adaptive step-size selection for homotopy methods to solve polynomial equations
- A continuation method to solve polynomial systems and its complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the probability distribution of data at points in real complete intersection varieties
- Numerical algebraic geometry
- Title not available (Why is that?)
Cited In (36)
- A sequence of polynomials with optimal condition number
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Smale's fundamental theorem of algebra reconsidered
- Smale 17th Problem: Advances and Open Directions
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- A continuation method to solve polynomial systems and its complexity
- The Legacy of Turing in Numerical Analysis
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
- On a problem posed by Steve Smale
- A theory of complexity, condition, and roundoff
- Geometry of polynomials and root-finding via path-lifting
- On the computation of rational points of a hypersurface over a finite field
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- A note on the finite variance of the averaging function for polynomial system solving
- The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
- Probabilistic analyses of condition numbers
- On the geometry and topology of the solution variety for polynomial system solving
- Complexity of Bezout's theorem. V: Polynomial time
- Computational complexity of a piecewise linear homotopy algorithm
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Fast algorithms for zero-dimensional polynomial systems using duality
- Functional norms, condition numbers and numerical algorithms in algebraic geometry
- Minimizing the discrete logarithmic energy on the sphere: the role of random polynomials
- Rigid continuation paths II. structured polynomial systems
- Condition length and complexity for the solution of polynomial systems
- A randomized homotopy for the Hermitian eigenpair problem
- The average condition number of most tensor rank decomposition problems is infinite
- Certified numerical homotopy tracking
- Title not available (Why is that?)
- Robust certified numerical homotopy tracking
- An arithmetic Poisson formula for the multi-variate resultant
- The unavoidable condition\dots A report on the book. Book review of: P. BĂźrgisser and F. Cucker, Condition. The geometry of numerical algorithms
- Stochastic perturbations and smooth condition numbers
Uses Software
This page was built for publication: Fast linear homotopy to find approximate zeros of polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626447)
