A PL homotopy for finding all the roots of a polynomial

DOI10.1007/BF01582093MaRDI QIDQ4178398zbMATH OpenOpenAlexFDO

Authors Masakazu Kojima, Hisakazu Nishino, Naohiko Arima

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582093

zbMATH Keywords

HomotopyRoots of a PolynomialComplex CoefficientsMultiple RootsTwo Numerical Examples

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Fixed points and coincidences in algebraic topology (55M20) Numerical computation of solutions to single equations (65H05)

Cites work

• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• scientific article; zbMATH DE number 3567160 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• An Extension of Lemke’s Method to the Piecewise Linear Complementarity Problem
• Homotopies for computation of fixed points
• Homotopies for computation of fixed points on unbounded regions
• On \(C^1\)-complexes
• On triangulations for computing fixed points
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Studies on Piecewise-Linear Approximations of Piecewise-C¹ Mappings in Fixed Points and Complementarity Theory
• The Solution of Systems of Piecewise Linear Equations

Cited in

(9)

• A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
• Computation of all solutions to a system of polynomial equations
• An approximate solution treatment for nonlinear problems
• On accelerating PL continuation algorithms by predictor—corrector methods
• An analysis of the solution set to a homotopy equation between polynomials with real coefficients
• On the complexity of a PL homotopy algorithm for zeros of polynomials
• A geometrical interpretation of the without-exception feasibility of PL homotopy methods
• On the geometry of paths generated by PL homotopy methods
• On the cost of computing roots of polynomials

This page was built for publication: A PL homotopy for finding all the roots of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178398)