scientific article
From MaRDI portal
Publication:3917180
zbMath0465.55003MaRDI QIDQ3917180
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical continuation methodsembedding-method for the calculation of all zeros of n complex polynomial equations in n unknowns
Numerical computation of solutions to systems of equations (65H10) Classical topics in algebraic topology (55M99)
Related Items (15)
A transformation to avoid solutions at infinity for polynomial systems ⋮ A homotopy for solving polynomial systems ⋮ Homotopy method for generalized eigenvalue problems \(Ax=\lambda Bx\) ⋮ A homotopy for solving general polynomial systems that respects m- homogeneous structures ⋮ Solving polynomial systems ⋮ The random product homotopy and deficient polynomial systems ⋮ General equilibrium models and homotopy methods ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ Computing singular solutions to polynomial systems ⋮ An analysis of the solution set to a homotopy equation between polynomials with real coefficients ⋮ A Polyhedral Method for Solving Sparse Polynomial Systems ⋮ A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems ⋮ Computation of all solutions to a system of polynomial equations ⋮ A globally convergent method for finding zeros of smooth functions ⋮ A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
This page was built for publication:
