Detection and validation of clusters of polynomial zeros

DOI10.1006/JSCO.1997.0160MaRDI QIDQ1382032zbMATH OpenOpenAlexFDO

Authors 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

floating-point arithmeticlocationmultiplicityreal or complex polynomialsymbolic computationvalidation methodszeros

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) 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) Symbolic computation and algebraic computation (68W30)

Recommendations

• Finding a cluster of zeros of univariate polynomials
• Enclosing clusters of zeros of polynomials
• Newton Iteration Towards a Cluster of Polynomial Zeros
• Zero-clusters of polynomials: best approach in supercomputing era
• Ten methods to bound multiple roots of polynomials

Cited in

(31)

• Nearest multivariate system with given root multiplicities
• An algorithm for computing certified approximate GCD of n univariate polynomials
• Certified approximate univariate GCDs
• Enclosing clusters of zeros of polynomials
• Finding a cluster of zeros of univariate polynomials
• Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
• Computation of approximate polynomial GCDs and an extension
• An algorithm for locating all zeros of a real polynomial
• Clustering complex zeros of triangular systems of polynomials
• Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
• Computing the polynomial remainder sequence via Bézout matrices
• A higher order family for the simultaneous inclusion of multiple zeros of polynomials
• Computing clustered close-roots of univariate polynomials
• scientific article; zbMATH DE number 2125604 (Why is no real title available?)
• Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
• Regularization and matrix computation in numerical polynomial algebra
• An Existence Test for Root Clusters and Multiple Roots
• scientific article; zbMATH DE number 1254284 (Why is no real title available?)
• Newton Iteration Towards a Cluster of Polynomial Zeros
• Computing multiple roots of inexact polynomials
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Overdetermined Weierstrass iteration and the nearest consistent system
• scientific article; zbMATH DE number 1428942 (Why is no real title available?)
• Analytic root clustering: a complete algorithm using soft zero tests
• On factorization of analytic functions and its verification
• A subdivision method for computing nearest gcd with certification
• Hybrid method for computing the nearest singular polynomials
• Shifted varieties and discrete neighborhoods around varieties
• A verified method for bounding clusters of zeros of analytic functions
• On location and approximation of clusters of zeros: Case of embedding dimension one
• Zero-clusters of polynomials: best approach in supercomputing era

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382032)