Detection and validation of clusters of polynomial zeros

DOI10.1006/jsco.1997.0160zbMath0910.65030OpenAlexW2085128077MaRDI QIDQ1382032

V. Hribernig, Hans J. Stetter

Publication date: 15 February 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1997.0160

zbMATH Keywords

multiplicitysymbolic computationzeroslocationfloating-point arithmeticreal or complex polynomialvalidation methods

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

Shifted varieties and discrete neighborhoods around varieties ⋮ An algorithm for locating all zeros of a real polynomial ⋮ Certified approximate univariate GCDs ⋮ A verified method for bounding clusters of zeros of analytic functions ⋮ Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Enclosing clusters of zeros of polynomials ⋮ A subdivision method for computing nearest gcd with certification ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Computing multiple roots of inexact polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Hybrid method for computing the nearest singular polynomials ⋮ A higher order family for the simultaneous inclusion of multiple zeros of polynomials ⋮ Nearest multivariate system with given root multiplicities ⋮ An algorithm for computing certified approximate GCD of \(n\) univariate polynomials ⋮ Computation of approximate polynomial GCDs and an extension ⋮ Improvement of convergence of an iterative method for finding polynomial factors of analytic functions

This page was built for publication: Detection and validation of clusters of polynomial zeros