New Practical Advances in Polynomial Root Clustering
type: Item
instance of: scholarly article
title: New Practical Advances in Polynomial Root Clustering
DOI: 10.1007/978-3-030-43120-4_11
author: Rémi Imbach
author: Victor Y. Pan
published in: Mathematical Aspects of Computer and Information Sciences
publication date: 2021-12-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1911.06706
Mathematics Subject Classification ID: 68-XX
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 7441065
describes a project that uses: na20
MaRDI profile type: Publication
OpenAlex ID: W3013800652
cites work: Counting roots of a polynomial in a convex compact region by means of winding number calculation via sampling
cites work: Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis
cites work: Computing real roots of real polynomials
cites work: Nearly optimal refinement of real roots of a univariate polynomial
cites work: On the boolean complexity of real root refinement
cites work: Old and new nearly optimal polynomial root-finders
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
cites work: Computing Real Roots of Real Polynomials ... and now For Real!
cites work: Implementation of a near-optimal complex root clustering algorithm
cites work: Q5590393
cites work: A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
cites work: Complexity Analysis of Root Clustering for a Complex Polynomial
cites work: Solving secular and polynomial equations: a multiprecision algorithm
cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder
cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials
Recommended article: Roots of composite polynomials - an application to root clustering
Recommended article: Root clustering for convex combination of complex polynomials
Recommended article: Computing clustered close-roots of univariate polynomials
Recommended article: Complexity Analysis of Root Clustering for a Complex Polynomial
Recommended article: A symmetric matrix criterion for polynomial root clustering
Recommended article: Implementation of a near-optimal complex root clustering algorithm
Recommended article: Root clustering of interval polynomials in the left-sector
Recommended article: Accelerated subdivision for clustering roots of polynomials given by evaluation oracles
Recommended article: New progress in real and complex polynomial root-finding
Recommended article: Necessary and sufficient conditions for root clustering of a polytope of polynomials in a simply connected domain
description: scientific article; zbMATH DE number 7441065