Computing all solutions to polynomial systems using homotopy continuation
From MaRDI portal
Publication:1097645
DOI10.1016/0096-3003(87)90064-6zbMath0635.65058OpenAlexW2132476962MaRDI QIDQ1097645
Andrew John Sommese, Alexander P. Morgan
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)90064-6
kinematicshomotopycontinuationgeometric modelingcomputer programschemical equilibriumNumerical resultszeros of polynomial functions
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)
Related Items
Perturbed homotopies for finding all isolated solutions of polynomial systems, Construction of \(G^1\) planar Hermite interpolants with prescribed arc lengths, A homotopy for solving general polynomial systems that respects m- homogeneous structures, A hybrid algorithm for multi-homogeneous Bézout number, Computing singular solutions to nonlinear analytic systems, Coefficient-parameter polynomial continuation, \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}, A continuation method to solve polynomial systems and its complexity, Efficiently counting affine roots of mixed trigonometric polynomial systems, Solving kinematics problems by efficient interval partitioning, Efficient path tracking methods, Exploring collision-free path planning by using homotopy continuation methods, A new start system for solving deficient polynomial systems using continuation, Solving a sparse system using linear algebra, Statistics of stationary points of random finite polynomial potentials, On the use of predictor-corrector continuation to trace implicitly defined curves and calculating bifurcation, A power series method for computing singular solutions to nonlinear analytic systems, A homotopy training algorithm for fully connected neural networks, Computing singular solutions to polynomial systems, Optimization problem in multi-homogeneous homotopy method, A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems, Computing the optimal partition of variables in multi-homogeneous homotopy methods, Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling, Modeling three-dimensional surface-to-surface rigid contact and impact, A homotopy method with adaptive basis selection for computing multiple solutions of differential equations, Parameter identification by continuation methods, An adaptive homotopy method for computing bifurcations of nonlinear parametric systems, Construction of \(C^ 2\) Pythagorean-hodograph interpolating splines by the homotopy method, Numerical algebraic geometry and algebraic kinematics, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Probability-one homotopy algorithms for solving the coupled Lyapunov equations arising in reduced-order \(H^2/H^\infty\) modeling, estimation, and control, A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
Uses Software
Cites Work
- Unnamed Item
- A transformation to avoid solutions at infinity for polynomial systems
- A homotopy for solving polynomial systems
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- A methodology for solving chemical equilibrium systems
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Algorithm 652
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
