Pages that link to "Item:Q638509"
From MaRDI portal
The following pages link to A subdivision method for computing nearest gcd with certification (Q638509):
Displaying 6 items.
- 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)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm (Q1979358) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)