Globally convergent, iterative path-following for algebraic equations
type: Item
instance of: scholarly article
title: Globally convergent, iterative path-following for algebraic equations
zbMATH Open document ID: 1229.65076
author: Prashant Batra
published in: Mathematics in Computer Science
publication date: 2012-01-02T00:00:00Z
Mathematics Subject Classification ID: 65H04
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5993985
zbMATH Keywords: fundamental theorem of algebra
zbMATH Keywords: Newton's method
zbMATH Keywords: homotopy methods
MaRDI profile type: Publication
full work available at URL: s11786-011-0069-2
OpenAlex ID: W2090258218
cites work: Simultaneous point estimates for Newton's method
cites work: Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
cites work: How the Roots of a Polynomial Vary with its Coefficients: A Local Quantitative Result
cites work: On Smale's 17th problem: a probabilistic positive solution
cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
cites work: Q3639865
cites work: On a problem posed by Steve Smale
cites work: The Minimum Root Separation of a Polynomial
cites work: Q4789190
cites work: On the location of critical points of polynomials
cites work: On condition numbers and the distance to the nearest ill-posed problem
cites work: Solving the quintic by iteration
cites work: Essays in Constructive Mathematics
cites work: Kronecker's algorithmic mathematics
cites work: Perturbation bounds for polynomials
cites work: On location and approximation of clusters of zeros of analytic functions
cites work: Q3752135
cites work: On Algorithms for Solvingf(x)=0
cites work: How to find all roots of complex polynomials by Newton's method.
cites work: Polynomial Root-Finding Algorithms and Branched Covers
cites work: Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
cites work: On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
cites work: Q5546070
cites work: Families of rational maps and iterative root-finding algorithms
cites work: Q4413922
cites work: An efficient algorithm for the complex roots problem
cites work: Q4060241
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Q4779788
cites work: Perturbation of zeros of analytic functions. II
cites work: Algorithms – ESA 2005
cites work: Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: Complexity of Bezout's theorem. V: Polynomial time
cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
cites work: On the efficiency of algorithms of analysis
cites work: Q4720691
cites work: Q4356579
cites work: Q4501787
cites work: Q4307589
cites work: On dominating sequence method in the point estimate and Smale's theorem
cites work: Some remarks on Smale's “Algorithms for solving equations”
cites work: Q4789207
cites work: Q4953977
DOI: 10.1007/S11786-011-0069-2
description: scientific article; zbMATH DE number 5993985