Computing all solutions to polynomial systems using homotopy continuation
From MaRDI portal
Recommendations
- Solving polynomial systems by polyhedral homotopies
- Solving polynomial systems via homotopy continuation and monodromy
- scientific article; zbMATH DE number 2109418
- A homotopy for solving polynomial systems
- On the solutions to polynomial systems obtained by homotopy methods
- Homotopy continuation method for solving systems of nonlinear and polynomial equations
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
- scientific article; zbMATH DE number 1069614
- Homotopies for solving polynomial systems within a bounded domain
- A special homotopy continuation method for a class of polynomial systems
Cites work
- scientific article; zbMATH DE number 3859276 (Why is no real title available?)
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- A homotopy for solving polynomial systems
- A methodology for solving chemical equilibrium systems
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- A transformation to avoid solutions at infinity for polynomial systems
- Algorithm 652
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
Cited in
(52)- Efficient path tracking methods
- Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- A power series method for computing singular solutions to nonlinear analytic systems
- EFFICIENT EVALUATION OF POLYNOMIALS AND THEIR PARTIAL DERIVATIVES IN HOMOTOPY CONTINUATION METHODS
- Computing singular solutions to polynomial systems
- Monodromy solver. Sequential and parallel
- Solving a sparse system using linear algebra
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- scientific article; zbMATH DE number 2034387 (Why is no real title available?)
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- Computing the optimal partition of variables in multi-homogeneous homotopy methods
- Statistics of stationary points of random finite polynomial potentials
- Numerical algebraic geometry and algebraic kinematics
- A new start system for solving deficient polynomial systems using continuation
- scientific article; zbMATH DE number 4145674 (Why is no real title available?)
- scientific article; zbMATH DE number 50337 (Why is no real title available?)
- scientific article; zbMATH DE number 4135514 (Why is no real title available?)
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Parameter identification by continuation methods
- Exploring collision-free path planning by using homotopy continuation methods
- Solving Real Polynomial Systems with Real Homotopies
- Homotopies and polynomial system solving I
- Computing singular solutions to nonlinear analytic systems
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Numerically determining solutions of systems of polynomial equations
- scientific article; zbMATH DE number 4147409 (Why is no real title available?)
- ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
- Parallel Homotopy Algorithms to Solve Polynomial Systems
- Coefficient-parameter polynomial continuation
- Construction of \(C^ 2\) Pythagorean-hodograph interpolating splines by the homotopy method
- Optimization problem in multi-homogeneous homotopy method
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy
- Construction of \(G^1\) planar Hermite interpolants with prescribed arc lengths
- On the use of predictor-corrector continuation to trace implicitly defined curves and calculating bifurcation
- A homotopy method with adaptive basis selection for computing multiple solutions of differential equations
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Modeling three-dimensional surface-to-surface rigid contact and impact
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- Probability-one homotopy algorithms for solving the coupled Lyapunov equations arising in reduced-order \(H^2/H^\infty\) modeling, estimation, and control
- A hybrid algorithm for multi-homogeneous Bézout number
- Computing curve intersection by homotopy methods
- Solving polynomial systems via homotopy continuation and monodromy
- Solving kinematics problems by efficient interval partitioning
- Algorithm 795
- Perturbed homotopies for finding all isolated solutions of polynomial systems
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- A continuation method to solve polynomial systems and its complexity
- Homotopy relaxation training algorithms for infinite-width two-layer ReLU neural networks
- A homotopy training algorithm for fully connected neural networks
- Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods
This page was built for publication: Computing all solutions to polynomial systems using homotopy continuation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097645)
