Pages that link to "Item:Q2734415"
From MaRDI portal
The following pages link to QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (Q2734415):
Displaying 14 items.
- Polynomial computations for blind image deconvolution (Q281962) (← links)
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
- Robust estimation of GCD with sparse coefficients (Q1046678) (← links)
- A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials (Q1281845) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
- The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
