Certified predictor-corrector tracking for Newton homotopies
type: Item
instance of: scholarly article
title: Certified predictor-corrector tracking for Newton homotopies
zbMATH Open document ID: 1329.65110
author: Jonathan D. Hauenstein
author: Alan C. jun. Liddell
published in: Journal of Symbolic Computation
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 65H20
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65H04
zbMATH DE Number: 6517842
zbMATH Keywords: certified tracking
zbMATH Keywords: alpha theory
zbMATH Keywords: numerical algebraic geometry
zbMATH Keywords: homotopy continuation
zbMATH Keywords: Newton's method
zbMATH Keywords: numerical example
zbMATH Keywords: polynomial system
zbMATH Keywords: Newton corrections
zbMATH Keywords: Euler predictor
describes a project that uses: HOM4PS
describes a project that uses: PHCpack
describes a project that uses: Bertini
describes a project that uses: NumericalAlgebraicGeometry
describes a project that uses: NAG4M2
MaRDI profile type: Publication
full work available at URL: j.jsc.2015.07.001
OpenAlex ID: W1041626685
cites work: Efficient path tracking methods
cites work: Certified Numerical Homotopy Tracking
cites work: Robust certified numerical homotopy tracking
cites work: On Smale's 17th problem: a probabilistic positive solution
cites work: Real solutions to systems of polynomial equations and parameter continuation
cites work: An a posteriori certification algorithm for Newton homotopies
cites work: Q4225048
cites work: HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
cites work: Numerical algebraic geometry
cites work: Galois groups of Schubert problems via homotopy computation
cites work: Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: Complexity of Bezout's theorem. V: Polynomial time
cites work: The fundamental theorem of algebra and complexity theory
cites work: Q4720691
cites work: Using monodromy to decompose solution sets of polynomial systems into irreducible components
cites work: Algorithm 795
DOI: 10.1016/J.JSC.2015.07.001
Recommended article: Certified Numerical Homotopy Tracking
Recommended article: Robust certified numerical homotopy tracking
Recommended article: Preconditioned Iterative Methods for Homotopy Curve Tracking
Recommended article: A novel efficient homotopy continuation method in tracking
Recommended article: Mixed precision path tracking for polynomial homotopy continuation
Recommended article: An a posteriori certification algorithm for Newton homotopies
Recommended article: Q2994185
Recommended article: Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking
Recommended article: A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
Recommended article: Homotopy curve tracking in approximate interior point optimization
description: scientific article; zbMATH DE number 6517842