The calculation of the degree of an approximate greatest common divisor of two polynomials
From MaRDI portal
Publication:611832
DOI10.1016/j.cam.2010.08.034zbMath1246.65062OpenAlexW2054230702MaRDI QIDQ611832
Publication date: 14 December 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.08.034
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Structured matrix methods computing the greatest common divisor of polynomials ⋮ The computation of multiple roots of a polynomial ⋮ A geometrical approach to finding multivariate approximate LCMs and GCDs ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- On the numerical condition of polynomials in Bernstein form
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
- Certified approximate univariate GCDs
- Common factor detection and estimation
- Structured total least norm and approximate GCDs of inexact polynomials
- Polynomial Scaling
- Computing multiple roots of inexact polynomials
- Approximate factorization of multivariate polynomials via differential equations
- Statistical analysis of effective singular values in matrix rank determination
- High Order Terms for Condition Estimation of Univariate Polynomials
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Numerical Analysis and Its Applications
This page was built for publication: The calculation of the degree of an approximate greatest common divisor of two polynomials
