Using monodromy to avoid high precision in homotopy continuation

DOI10.1007/S11786-014-0190-0zbMATH Open1302.65137OpenAlexW2123718967MaRDI QIDQ475409FDOQ475409

Daniel J. Bates, Matthew E. Niemerg

Publication date: 27 November 2014

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-014-0190-0

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Solving polynomial systems; resultants (13P15)

Cites Work

• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Algorithm 795
• Paramotopy: parameter homotopies in parallel
• Numerically solving polynomial systems with Bertini
• Regeneration homotopies for solving systems of polynomials
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Algorithm 921
• Robust certified numerical homotopy tracking
• Galois groups of Schubert problems via homotopy computation
• Computing singular solutions to nonlinear analytic systems
• Adaptive Multiprecision Path Tracking
• Title not available (Why is that?)
• Certified Parallelotope Continuation for One-Manifolds
• Title not available (Why is that?)
• Numerical algebraic geometry
• Solving nonlinear equations by adaptive homotopy continuation
• Using monodromy to decompose solution sets of polynomial systems into irreducible components
• An Interval Step Control for Continuation Methods
• Sweeping algebraic curves for singular solutions

Uses Software

• HOM4PS
• Macaulay2
• PHCpack
• Bertini
• alphaCertified
• Paramotopy
• NAG4M2
• NumericalAlgebraicGeometry

This page was built for publication: Using monodromy to avoid high precision in homotopy continuation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475409)