Fast linear homotopy to find approximate zeros of polynomial systems
From MaRDI portal
(Redirected from Publication:626447)
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)
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
Cites work
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 5124810 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 3580810 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 503395 (Why is no real title available?)
- scientific article; zbMATH DE number 1503621 (Why is no real title available?)
- A continuation method to solve polynomial systems and its complexity
- 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
- Algorithm 795
- Bertini\_real: software for one- and two-dimensional real algebraic sets
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Certified numerical homotopy tracking
- Complexity of Bezout's Theorem I: Geometric Aspects
- 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 Numbers of Gaussian Random Matrices
- Eigenvalues and Condition Numbers of Random Matrices
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Numerical algebraic geometry
- On Smale's 17th problem: a probabilistic positive solution
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the probability distribution of data at points in real complete intersection varieties
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Tails of Condition Number Distributions
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The complexity of partial derivatives
- The hardness of polynomial equation solving
Cited in
(36)- A sequence of polynomials with optimal condition number
- Smale's fundamental theorem of algebra reconsidered
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- 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
- On the geometry and topology of the solution variety for polynomial system solving
- Complexity of Bezout's theorem. V: Polynomial time
- Probabilistic analyses of condition numbers
- 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
- 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
- Rigid continuation paths II. structured polynomial systems
- Certified numerical homotopy tracking
- Robust certified numerical homotopy tracking
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
- scientific article; zbMATH DE number 1982611 (Why is no real title available?)
- An arithmetic Poisson formula for the multi-variate resultant
- Stochastic perturbations and smooth condition numbers
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)
