An adaptive subdivision method for root finding of univariate polynomials
From MaRDI portal
Recommendations
- Old and new nearly optimal polynomial root-finders
- Finding the number of roots of a polynomial in a plane region using the winding number
- Subdivision methods for solving polynomial equations
- Improved subdivision scheme for the root computation of univariate polynomial equations
- Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
Cites work
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 193017 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- A first course in numerical analysis.
- A geometric algorithm for winding number computation with complexity analysis
- A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain
- A simple but exact and efficient algorithm for complex root isolation
- Accelerated approximation of the complex roots and factors of a univariate polynomial
- An efficient algorithm for the complex roots problem
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Axioms and hulls
- Finding the number of roots of a polynomial in a plane region using the winding number
- Improving root separation bounds
- LAPACK Users' Guide
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Methods of Search for Solving Polynomial Equations
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Proving Properties of Programs by Structural Induction
- Solving a Polynomial Equation: Some History and Recent Progress
- Solving secular and polynomial equations: a multiprecision algorithm
- Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
Cited in
(6)- Subdivision methods for solving polynomial equations
- Faster numerical univariate polynomial root-finding by means of subdivision iterations
- A geometric algorithm for winding number computation with complexity analysis
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds
- Improved subdivision scheme for the root computation of univariate polynomial equations
- GPU acceleration of splitting schemes applied to differential matrix equations
This page was built for publication: An adaptive subdivision method for root finding of univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736361)
