Finding all solutions to polynomial systems and other systems of equations

DOI10.1007/BF01582106zbMath0409.65026MaRDI QIDQ4197292

No author found.

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

Algorithm Solutions Nonlinear Equations Systems of Nonlinear Equations Polynomial Systems Fixed Point Computation Simplicial Approximation Complementary Pivoting Dominating Term Simplicial Pivoting Solution of Systems Of Nonlinear Equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)

Related Items (45)

A transformation to avoid solutions at infinity for polynomial systems ⋮ A homotopy for solving polynomial systems ⋮ Qualitative and numerical analysis of a class of prey-predator models ⋮ Pseudozeros of multivariate polynomials ⋮ Homotopy method for generalized eigenvalue problems \(Ax=\lambda Bx\) ⋮ Proof of the Feldman-Karlin conjecture on the maximum number of equilibria in an evolutionary system ⋮ A homotopy for solving general polynomial systems that respects m- homogeneous structures ⋮ Solving polynomial systems ⋮ A hybrid algorithm for multi-homogeneous Bézout number ⋮ On the geometry of paths generated by PL homotopy methods ⋮ Cell decomposition of almost smooth real algebraic surfaces ⋮ The random product homotopy and deficient polynomial systems ⋮ Computational issues in solid boundary evaluation ⋮ Numerical generation of periodic traveling wave solutions of some nonlinear dispersive wave systems ⋮ A Levenberg-Marquardt method for solving semi-symmetric tensor equations ⋮ The globalization of Durand-Kerner algorithm ⋮ A continuation method to solve polynomial systems and its complexity ⋮ On the global convergence of path-following methods to determine all solutions to a system of nonlinear equations ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ Heuristic methods for computing the minimal multi-homogeneous Bézout number. ⋮ Minimizing multi-homogeneous Bézout numbers by a local search method ⋮ On the general boundary element method ⋮ Numerically determining solutions of systems of polynomial equations ⋮ Computing curve intersection by homotopy methods ⋮ Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators ⋮ Foreword. What is numerical algebraic geometry? ⋮ Mixed cell computation in HOM4ps ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ Computing singular solutions to polynomial systems ⋮ Optimization problem in multi-homogeneous homotopy method ⋮ An analysis of the solution set to a homotopy equation between polynomials with real coefficients ⋮ Computing the optimal partition of variables in multi-homogeneous homotopy methods ⋮ Algebraic \(\mathbb C^*\)-actions and the inverse kinematics of a general 6R manipulator ⋮ Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling ⋮ Solving decomposable sparse systems ⋮ Parameter identification by continuation methods ⋮ A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems ⋮ A geometrical interpretation of the without-exception feasibility of PL homotopy methods ⋮ Solution of the least squares method problem of pairwise comparison matrices ⋮ A methodology for solving chemical equilibrium systems ⋮ Numerical algebraic geometry and algebraic kinematics ⋮ Computation of all solutions to a system of polynomial equations ⋮ An algorithm for computing multivariable root loci by pivoting ⋮ Solving sparse non-negative tensor equations: algorithms and applications ⋮ A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games

Cites Work

This page was built for publication: Finding all solutions to polynomial systems and other systems of equations