Pages that link to "Item:Q1361353"
From MaRDI portal
The following pages link to A subspace method for the computation of the GCD of polynomials (Q1361353):
Displaying 14 items.
- Polynomial GCD derived through monic polynomial subtractions (Q420250) (← links)
- Blind identification of non-minimum phase ARMA systems (Q522843) (← links)
- Common factor estimation and two applications in signal processing (Q948409) (← links)
- Robust estimation of GCD with sparse coefficients (Q1046678) (← links)
- An extended polynomial GCD algorithm using Hankel matrices (Q1186699) (← links)
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control (Q2020558) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
- A subresultant based subspace method for the computation of polynomial GCDs (Q2819622) (← links)
- GCD of multivariate approximate polynomials using beautification with the subtractive algorithm (Q2819632) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- Computation of the GCD of polynomials using gaussian transformations and shifting (Q5287932) (← links)
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance (Q5423857) (← links)
- Structured low-rank approximation for nonlinear matrices (Q6109889) (← links)
