A homotopy for solving general polynomial systems that respects m- homogeneous structures
From MaRDI portal
DOI10.1016/0096-3003(87)90063-4zbMATH Open0635.65057OpenAlexW2076067331MaRDI QIDQ1097644FDOQ1097644
Authors: Alexander P. Morgan, Andrew J. Sommese 
Publication date: 1987
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(87)90063-4
Recommendations
Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)
Cites Work
- Algorithm 652
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Approach to Homotopy and Degree Theory
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- On the Number of Solutions to Polynomial Systems of Equations
- A homotopy for solving polynomial systems
- Computing all solutions to polynomial systems using homotopy continuation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A methodology for solving chemical equilibrium systems
- Title not available (Why is that?)
- Complex analytic geometry
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Title not available (Why is that?)
- Numerical Solution of a Class of Deficient Polynomial Systems
- A transformation to avoid solutions at infinity for polynomial systems
- Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
- Finding all solutions to polynomial systems and other systems of equations
- A homotopy method for eigenvalue assignment using decentralized state feedback
- Finding All Solutions to a System of Polynomial Equations
- Title not available (Why is that?)
- Determining All Solutions to Certain Systems of Nonlinear Equations
- Solving systems of polynomial equations by bounded and real homotopy
- A Method for Computing All Solutions to Systems of Polynomials Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (69)
- Analysis of post-buckling branches at multiple symmetric bifurcations
- Title not available (Why is that?)
- Finiteness of stationary configurations of the planar four-vortex problem
- Statistics of stationary points of random finite polynomial potentials
- A hybrid algorithm for multi-homogeneous Bézout number
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- Dimension results for extremal-generic polynomial systems over complete toric varieties
- Title not available (Why is that?)
- On the solvability of polynomial systems arising in control
- Matrices in elimination theory
- Symbolic homotopy construction
- A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Modeling three-dimensional surface-to-surface rigid contact and impact
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Heuristic methods for computing the minimal multi-homogeneous Bézout number.
- Constructing frozen Jacobian iterative methods for solving systems of nonlinear equations, associated with ODEs and PDEs using the homotopy method
- Canonical coordinates method for equality-constrained nonlinear optimization.
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Parameter identification by continuation methods
- Computing singular solutions to nonlinear analytic systems
- An efficient start system for multi-homogeneous polynomial continuation
- Coefficient-parameter polynomial continuation
- Algebraic \(\mathbb C^*\)-actions and the inverse kinematics of a general 6R manipulator
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Spherical projective path tracking for homotopy continuation methods
- Numerical algebraic geometry and algebraic kinematics
- Design and evaluation of homotopies for efficient and robust continuation
- Cell decomposition of almost smooth real algebraic surfaces
- Title not available (Why is that?)
- Symmetric homotopy construction
- Perturbed homotopies for finding all isolated solutions of polynomial systems
- Two-parameter homotopy method for nonlinear equations
- A globally convergent method for finding zeros of smooth functions
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- A new start system for solving deficient polynomial systems using continuation
- Construction of \(C^ 2\) Pythagorean-hodograph interpolating splines by the homotopy method
- On the use of predictor-corrector continuation to trace implicitly defined curves and calculating bifurcation
- Bézout number calculations for multi-homogeneous polynomial systems
- A homotopy method with adaptive basis selection for computing multiple solutions of differential equations
- Minimizing multi-homogeneous Bézout numbers by a local search method
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- A homotopy for solving polynomial systems
- Computing all solutions to polynomial systems using homotopy continuation
- On the solutions to polynomial systems obtained by homotopy methods
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- Homotopies for solving polynomial systems within a bounded domain
- Homotopies and polynomial system solving I
- Numerically computing real points on algebraic sets
- An adaptive homotopy tracking algorithm for solving nonlinear parametric systems with applications in nonlinear ODEs
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- The $GBQ$-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems
- Probability-one homotopy algorithms for solving the coupled Lyapunov equations arising in reduced-order \(H^2/H^\infty\) modeling, estimation, and control
- Solving polynomial systems via homotopy continuation and monodromy
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
- The continuation method for rational and deficient systems
- A constrained homotopy technique for excluding unwanted solutions from polynomial equations arising in kinematics problems
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- Polynomial programming using multi-homogeneous polynomial continuation
- The inverse kinematics problem of spatial 4P3R robot manipulator by the homotopy continuation method with an adjustable auxiliary homotopy function
- Numerical Evidence for a Conjecture in Real Algebraic Geometry
- A power series method for computing singular solutions to nonlinear analytic systems
- Computing singular solutions to polynomial systems
- Multiprojective witness sets and a trace test
- Decoupling highly structured polynomial systems
- Early Ending in Homotopy Path-Tracking for Real Roots
- Regeneration homotopies for solving systems of polynomials
- A numerical toolkit for multiprojective varieties
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
Uses Software
This page was built for publication: A homotopy for solving general polynomial systems that respects m- homogeneous structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097644)
