A PL homotopy for finding all the roots of a polynomial
From MaRDI portal
Publication:4178398
DOI10.1007/BF01582093zbMath0395.65016OpenAlexW2024084454MaRDI QIDQ4178398
Naohiko Arima, Hisakazu Nishino, Kojima, Masakazu
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582093
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10) Fixed points and coincidences in algebraic topology (55M20)
Related Items (9)
On the geometry of paths generated by PL homotopy methods ⋮ On the cost of computing roots of polynomials ⋮ An analysis of the solution set to a homotopy equation between polynomials with real coefficients ⋮ A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems ⋮ A geometrical interpretation of the without-exception feasibility of PL homotopy methods ⋮ Computation of all solutions to a system of polynomial equations ⋮ On accelerating PL continuation algorithms by predictor—corrector methods ⋮ An approximate solution treatment for nonlinear problems ⋮ On the complexity of a PL homotopy algorithm for zeros of polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(C^1\)-complexes
- The Solution of Systems of Piecewise Linear Equations
- An Extension of Lemke’s Method to the Piecewise Linear Complementarity Problem
- On triangulations for computing fixed points
- Studies on Piecewise-Linear Approximations of Piecewise-C1 Mappings in Fixed Points and Complementarity Theory
- Homotopies for computation of fixed points
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Homotopies for computation of fixed points on unbounded regions
This page was built for publication: A PL homotopy for finding all the roots of a polynomial
