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

locationmultiplicityzerossymbolic computationfloating-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) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

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

(29)

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

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)