Approximate GCD and its application to ill-conditioned algebraic equations

DOI10.1016/0377-0427(91)90180-RzbMath0747.65034OpenAlexW1572189095MaRDI QIDQ1184132

Tateaki Sasaki, Matu-Tarow Noda

Publication date: 28 June 1992

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(91)90180-r

zbMATH Keywords

Newton's methodnumerical examplessymbolic computationgreatest common divisormultivariate polynomialsEuclidean algorithmill-conditioned algebraic equationsmultiple and/or close rootsroot-finding algorithmssquare-free decomposition algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Related Items (29)

Affine equivalences of trigonometric curves ⋮ Relaxed NewtonSLRA for approximate GCD ⋮ A new Gröbner basis conversion method based on stabilization techniques ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Certified approximate univariate GCDs ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ Pseudospectra of exponential matrix polynomials ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ A geometrical approach to finding multivariate approximate LCMs and GCDs ⋮ A subdivision method for computing nearest gcd with certification ⋮ A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials ⋮ Normal factorisation of polynomials and computational issues. ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance ⋮ Approximate polynomial GCD by approximate syzygies ⋮ The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ On the Computation of the GCD of 2-D Polynomials ⋮ Exact and approximate similarities of non-necessarily rational planar, parametrized curves, using centers of gravity and inertia tensors ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ Computation of approximate polynomial GCDs and an extension ⋮ A companion matrix resultant for Bernstein polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-gcd computations
• An Existence Test for Root Clusters and Multiple Roots
• Resultant Procedure and the Mechanization of the Graeffe Process
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants

This page was built for publication: Approximate GCD and its application to ill-conditioned algebraic equations