Structured Matrix Based Methods for Approximate Polynomial GCD
From MaRDI portal
Publication:3087160
DOI10.1007/978-88-7642-381-9zbMath1238.65002OpenAlexW614152557MaRDI QIDQ3087160
Publication date: 2 August 2011
Full work available at URL: https://doi.org/10.1007/978-88-7642-381-9
Sylvester matrixQR decompositionEuclidean algorithmBezout matrixPolynomialGreatest common divisorHouseholder tridiagonalizationApproximated greatest common divisor
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Relaxed NewtonSLRA for approximate GCD ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ Validated Root Enclosures for Interval Polynomials with Multiplicities ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ The RKFIT Algorithm for Nonlinear Rational Approximation ⋮ Approximate square-free part and decomposition ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ Blind image deconvolution through Bezoutians ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ The generalized Schur algorithm and some applications
Uses Software
This page was built for publication: Structured Matrix Based Methods for Approximate Polynomial GCD
