QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients

DOI10.1109/78.875462zbMath1002.12011OpenAlexW2130331374MaRDI QIDQ2734415

Christopher J. Zarowski, Frederick W. Fairman, Xiao-Yan Ma

Publication date: 13 December 2001

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/78.875462

zbMATH Keywords

greatest common divisor of two polynomialsQR-factorization

Mathematics Subject Classification ID

Related Items (12)

Polynomial computations for blind image deconvolution ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ The Sylvester Resultant Matrix and Image Deblurring ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ Approximate polynomial GCD over integers ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Structured total least norm and approximate GCDs of inexact polynomials ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

Uses Software

• mctoolbox

This page was built for publication: QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients