An adaptive subdivision method for root finding of univariate polynomials
From MaRDI portal
Publication:1736361
DOI10.1016/j.cam.2018.11.023zbMath1503.65096OpenAlexW2902933830WikidataQ128838545 ScholiaQ128838545MaRDI QIDQ1736361
Álvaro Cortés Fácila, Juan Carlos Díaz Martín, Juan Luis García Zapata
Publication date: 26 March 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.11.023
Related Items (2)
Geometric Methods on Low-Rank Matrix and Tensor Manifolds ⋮ GPU acceleration of splitting schemes applied to differential matrix equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the number of roots of a polynomial in a plane region using the winding number
- A geometric algorithm for winding number computation with complexity analysis
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Axioms and hulls
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Solving secular and polynomial equations: a multiprecision algorithm
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- Improving root separation bounds
- An efficient algorithm for the complex roots problem
- Univariate polynomials
- LAPACK Users' Guide
- Solving a Polynomial Equation: Some History and Recent Progress
- A simple but exact and efficient algorithm for complex root isolation
- Proving Properties of Programs by Structural Induction
- Methods of Search for Solving Polynomial Equations
This page was built for publication: An adaptive subdivision method for root finding of univariate polynomials
