An adaptive subdivision method for root finding of univariate polynomials
type: Item
instance of: scholarly article
title: An adaptive subdivision method for root finding of univariate polynomials
zbMATH Open document ID: 1503.65096
author: Juan Carlos Díaz Martín
author: Álvaro Cortés Fácila
author: Juan-Luis García Zapata
published in: Journal of Computational and Applied Mathematics
publication date: 2019-03-26T00:00:00Z
Mathematics Subject Classification ID: 65H04
zbMATH DE Number: 7042017
zbMATH Keywords: root finding
zbMATH Keywords: subdivision
zbMATH Keywords: winding number
zbMATH Keywords: binary search tree
zbMATH Keywords: contour integration
describes a project that uses: LAPACK
describes a project that uses: Eigensolve
describes a project that uses: EISPACK
MaRDI profile type: Publication
full work available at URL: j.cam.2018.11.023
OpenAlex ID: W2902933830
cites work: A first course in numerical analysis.
cites work: LAPACK Users' Guide
cites work: Matrix eigensystem routines - EISPACK guide. 2nd ed
cites work: An iterated eigenvalue algorithm for approximating roots of univariate polynomials
cites work: Q4039860
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Solving secular and polynomial equations: a multiprecision algorithm
cites work: Accelerated approximation of the complex roots and factors of a univariate polynomial
cites work: A simple but exact and efficient algorithm for complex root isolation
cites work: Finding the number of roots of a polynomial in a plane region using the winding number
cites work: A geometric algorithm for winding number computation with complexity analysis
cites work: Q4039888
cites work: Methods of Search for Solving Polynomial Equations
cites work: Improving root separation bounds
cites work: Proving Properties of Programs by Structural Induction
cites work: Q4506483
cites work: A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials
cites work: An efficient algorithm for the complex roots problem
cites work: Univariate polynomials
cites work: Axioms and hulls
Wikidata QID: Q128838545
DOI: 10.1016/J.CAM.2018.11.023
description: scientific article; zbMATH DE number 7042017