HomotopyContinuation. jl: A package for homotopy continuation in Julia

P Breiding, S Timme - … Software–ICMS 2018: 6th International Conference …, 2018 - Springer
We present the Julia package HomotopyContinuation. jl, which provides an algorithmic
framework for solving polynomial systems by numerical homotopy continuation. We …

Numerical algebraic geometry and algebraic kinematics

CW Wampler, AJ Sommese - Acta Numerica, 2011 - cambridge.org
In this article, the basic constructs of algebraic kinematics (links, joints, and mechanism
spaces) are introduced. This provides a common schema for many kinds of problems that …

HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method

TL Lee, TY Li, CH Tsai - Computing, 2008 - Springer
Abstract HOM4PS-2.0 is a software package in FORTRAN 90 which implements the
polyhedral homotopy continuation method for solving polynomial systems. It updates its …

Algorithm 921: alphaCertified: certifying solutions to polynomial systems

JD Hauenstein, F Sottile - ACM Transactions on Mathematical Software …, 2012 - dl.acm.org
Smale's α-theory uses estimates related to the convergence of Newton's method to certify
that Newton iterations will converge quadratically to solutions to a square polynomial …

Numerical polynomial homotopy continuation method to locate all the power flow solutions

D Mehta, HD Nguyen, K Turitsyn - … Generation, Transmission & …, 2016 - Wiley Online Library
The manuscript addresses the problem of finding all solutions of power flow equations or
other similar non‐linear system of algebraic equations. This problem arises naturally in a …

Completeness of solutions of Bethe's equations

W Hao, RI Nepomechie, AJ Sommese - Physical Review E—Statistical …, 2013 - APS
We consider the Bethe equations for the isotropic spin-1/2 Heisenberg quantum spin chain
with periodic boundary conditions. We formulate a conjecture for the number of solutions …

Regeneration homotopies for solving systems of polynomials

J Hauenstein, A Sommese, C Wampler - Mathematics of Computation, 2011 - ams.org
We present a new technique, based on polynomial continuation, for solving systems of $ n $
polynomials in $ N $ complex variables. The method allows equations to be introduced one …

A robust numerical path tracking algorithm for polynomial homotopy continuation

S Telen, MV Barel, J Verschelde - SIAM Journal on Scientific Computing, 2020 - SIAM
We propose a new algorithm for numerical path tracking in polynomial homotopy
continuation. The algorithm is “robust” in the sense that it is designed to prevent path …

A numerical continuation approach using monodromy to solve the forward kinematics of cable-driven parallel robots with sagging cables

A Baskar, M Plecnik, JD Hauenstein… - Mechanism and Machine …, 2024 - Elsevier
Designing and analyzing large cable-driven parallel robots (CDPRs) for precision tasks can
be challenging, as the position kinematics are governed by kineto-statics and cable sag …

Numerically computing real points on algebraic sets

JD Hauenstein - Acta applicandae mathematicae, 2013 - Springer
Given a polynomial system f, a fundamental question is to determine if f has real roots. Many
algorithms involving the use of infinitesimal deformations have been proposed to answer …