Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
type: Item
instance of: scholarly article
title: Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
DOI: 10.1007/978-3-031-14788-3_9
author: Rémi Imbach
author: Victor Y. Pan
publication date: 2022-12-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2206.08622
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 7635697
zbMATH Keywords: polynomial root finding
zbMATH Keywords: subdivision algorithms
zbMATH Keywords: oracle polynomials
MaRDI profile type: Publication
OpenAlex ID: W4291170811
cites work: Quadratic interval refinement for real roots
cites work: Complexity Analysis of Root Clustering for a Complex Polynomial
cites work: A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
cites work: Solving secular and polynomial equations: a multiprecision algorithm
cites work: New Practical Advances in Polynomial Root Clustering
cites work: New progress in univariate polynomial root finding
cites work: Implementation of a near-optimal complex root clustering algorithm
cites work: Faster numerical univariate polynomial root-finding by means of subdivision iterations
cites work: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Old and new nearly optimal polynomial root-finders
cites work: Acceleration of subdivision root-finding for sparse polynomials
cites work: Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders
cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials
cites work: Computing real roots of real polynomials
description: scientific article; zbMATH DE number 7635697