An algorithm for computing certified approximate GCD of n univariate polynomials

DOI10.1016/S0022-4049(99)00014-6zbMATH Open0964.12007OpenAlexW2109445883WikidataQ126351598 ScholiaQ126351598MaRDI QIDQ1295792FDOQ1295792

Authors: David Rupprecht 

Publication date: 26 June 2000

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(99)00014-6

Recommendations

• Toward the best algorithm for approximate GCD of univariate polynomials
• On approximate GCDs of univariate polynomials
• An iterative method for calculating approximate GCD of univariate polynomials
• Computation of approximate polynomial GCDs and an extension
• The approximate GCD of inexact polynomials
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• Approximate GCD of several univariate polynomials with small degree perturbations
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Computing approximate GCD of multivariate polynomials
• Certified approximate univariate GCDs

zbMATH Keywords

Sylvester matricesSingular Value DecompositionApproximate GCD

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Symbolic computation and algebraic computation (68W30) Computer aspects of numerical algorithms (65Y99)

Cites Work

• Title not available (Why is that?)
• Quasi-gcd computations
• Certified approximate univariate GCDs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Products of polynomials in many variables
• Detection and validation of clusters of polynomial zeros
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (44)

• Computing approximate GCD of multivariate polynomials
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• Computing GCRDs of approximate differential polynomials
• The approximate GCD of inexact polynomials
• Approximate GCD of several univariate polynomials with small degree perturbations
• Nearest common root of a set of polynomials: a structured singular value approach
• Approximate GCD and its application to ill-conditioned algebraic equations
• Approximate polynomial GCD over integers
• The computation of multiple roots of a polynomial
• Approximate polynomial GCD: small degree and small height perturbations
• Regularization and matrix computation in numerical polynomial algebra
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Recursive polynomial remainder sequence and its subresultants
• Blind image deconvolution through Bezoutians
• Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control
• A computational study of ruled surfaces
• A subspace method for the computation of the GCD of polynomials
• Variable projection methods for approximate (greatest) common divisor computations
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Toward the best algorithm for approximate GCD of univariate polynomials
• Computing multivariate approximate GCD based on Barnett's theorem
• Approximate greatest common divisor of several polynomials from Hankel matrices
• A fast algorithm for approximate polynomial gcd based on structured matrix computations
• Approximate GCD a la dedieu
• Computation of approximate polynomial GCDs and an extension
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
• An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
• Overdetermined Weierstrass iteration and the nearest consistent system
• Structured matrix methods computing the greatest common divisor of polynomials
• Computation of the topology of real algebraic space curves
• A subresultant based subspace method for the computation of polynomial GCDs
• GCD of multivariate approximate polynomials using beautification with the subtractive algorithm
• The ERES method for computing the approximate GCD of several polynomials
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
• An iterative method for calculating approximate GCD of univariate polynomials
• Computing multiple roots of inexact polynomials
• Approximate polynomial GCD by approximate syzygies
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• Numerical and symbolical methods for the GCD of several polynomials
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
• Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
• Approximate gcds of polynomials and sparse SOS relaxations

This page was built for publication: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials

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