<tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
From MaRDI portal
Publication:5355581
DOI10.1109/TSP.2004.837413zbMath1372.65120MaRDI QIDQ5355581
Lihong Zhi, Robert M. Corless, Stephen M. Watt
Publication date: 20 September 2017
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Orthogonalization in numerical linear algebra (65F25)
Related Items
Polynomial computations for blind image deconvolution ⋮ A quadratically convergent algorithm for structured low-rank approximation ⋮ Relaxed NewtonSLRA for approximate GCD ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ Filtering and smoothing formulas of AR(p)-modulated Poisson processes ⋮ Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ GPGCD: an iterative method for calculating approximate GCD of univariate polynomials ⋮ The Sylvester Resultant Matrix and Image Deblurring ⋮ The calculation of the degree of an approximate greatest common divisor of two polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ The computation of multiple roots of a polynomial ⋮ A geometrical approach to finding multivariate approximate LCMs and GCDs ⋮ Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions ⋮ Approximate polynomial GCD over integers ⋮ Numerical proper reparametrization of parametric plane curves ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Obtaining exact value by approximate computations ⋮ A structured rank-revealing method for Sylvester matrix ⋮ Kempe's universality theorem for rational space curves ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Structured total least norm and approximate GCDs of inexact polynomials ⋮ GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials ⋮ Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis ⋮ A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix ⋮ 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 rank and null space computation of the generalized Sylvester matrix ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Mixed and componentwise condition numbers for matrix decompositions
This page was built for publication: <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
