Homotopies for solving polynomial systems within a bounded domain
From MaRDI portal
Publication:1338223
DOI10.1016/0304-3975(94)00064-6zbMath0811.65041OpenAlexW2095237592MaRDI QIDQ1338223
Publication date: 2 May 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00064-6
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) 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)
Related Items
A convex geometric approach to counting the roots of a polynomial system, A certified numerical algorithm for the topology of resultant and discriminant curves, Mixed-volume computation by dynamic lifting applied to polynomial system solving, Counting solutions of a polynomial system locally and exactly, Deformation techniques for efficient polynomial equation solving., Enclosing all zeros of a system of analytic functions, Adjacency spectra of random and complete hypergraphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Singularities of differentiable maps, Volume 1. Classification of critical points, caustics and wave fronts. Transl. from the Russian by Ian Porteous, edited by V. I. Arnol'd
- Globally convergent homotopy methods: A tutorial
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Homotopy algorithm for symmetric eigenvalue problems
- The random product homotopy and deficient polynomial systems
- Coefficient-parameter polynomial continuation
- Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
- Symbolic homotopy construction
- Symmetric homotopy construction
- A methodology for solving chemical equilibrium systems
- Computing singular solutions to nonlinear analytic systems
- Numerical Solution of a Class of Deficient Polynomial Systems
- Algorithm 652
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- On Locating All Zeros of an Analytic Function within a Bounded Domain by a Revised Delves/Lyness Method
- Abstract Generalized Bisection and a Cost Bound
- Some tests of generalized bisection
- Homotopy Method for General $\lambda $-Matrix Problems
- Solving Eigenvalue Problems of Real Nonsymmetric Matrices with Real Homotopies
- Nonlinear Homotopies for Solving Deficient Polynomial Systems with Parameters
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Finding all isolated solutions to polynomial systems using HOMPACK
- Chemical equilibrium systems as numerical test problems
- The $GBQ$-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Solving Real Polynomial Systems with Real Homotopies