Root refinement for real polynomials using quadratic interval refinement
type: Item
instance of: scholarly article
title: Root refinement for real polynomials using quadratic interval refinement
zbMATH Open document ID: 1309.65052
author: Michael Kerber
author: Michael Sagraloff
published in: Journal of Computational and Applied Mathematics
publication date: 2015-01-08T00:00:00Z
Mathematics Subject Classification ID: 65H04
zbMATH DE Number: 6384552
zbMATH Keywords: root isolation
zbMATH Keywords: root approximation
zbMATH Keywords: quadratic interval refinement
zbMATH Keywords: complexity analysis
cites work: ISOLATE
cites work: Q3316585
cites work: Q3447174
cites work: Computer Algebra in Scientific Computing
cites work: Efficient isolation of polynomial's real roots.
cites work: On the complexity of the Descartes method when using approximate arithmetic
cites work: On the Complexity of Reliable Root Approximation
cites work: A fast numerical algorithm for the composition of power series with complex coefficients
cites work: Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
cites work: On the topology of real algebraic plane curves
cites work: Q5301664
cites work: Exact symbolic-numeric computation of planar algebraic curves
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros
cites work: Root-Refining for a Polynomial Equation
cites work: From approximate factorization to root isolation
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Random polynomials and expected complexity of bisection methods for real solving
cites work: A polynomial time algorithm for diophantine equations in one variable
cites work: Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
cites work: On the boolean complexity of real root refinement
cites work: Nearly optimal refinement of real roots of a univariate polynomial
cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder
cites work: Efficient polynomial root-refiners: a survey and new record efficiency estimates
cites work: Numerical methods for roots of polynomials. II
cites work: Efficient real root approximation
cites work: Introduction to Interval Analysis
cites work: A general approach to the analysis of controlled perturbation algorithms
cites work: On multiple roots in Descartes' rule and their distance to roots of higher derivatives
cites work: A generic algebraic kernel for non-linear geometric applications
cites work: Modern computer algebra
cites work: A worst-case bound for topology computation of algebraic curves
describes a project that uses: ISOLATE
describes a project that uses: logcf
describes a project that uses: na20
describes a project that uses: zeroin
MaRDI profile type: Publication
full work available at URL: j.cam.2014.11.031
OpenAlex ID: W2151974897
DOI: 10.1016/J.CAM.2014.11.031
description: scientific article; zbMATH DE number 6384552