A PL homotopy for finding all the roots of a polynomial
From MaRDI portal
Publication:4178398
DOI10.1007/BF01582093zbMath0395.65016MaRDI QIDQ4178398
Kojima, Masakazu, Hisakazu Nishino, Naohiko Arima
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
26C10: Real polynomials: location of zeros
55M20: Fixed points and coincidences in algebraic topology
Related Items
A geometrical interpretation of the without-exception feasibility of PL homotopy methods, On the complexity of a PL homotopy algorithm for zeros of polynomials, An approximate solution treatment for nonlinear problems, 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, Computation of all solutions to a system of polynomial equations, A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems, On accelerating PL continuation algorithms by predictor—corrector methods
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