Pages that link to "Item:Q2420166"
From MaRDI portal
The following pages link to An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166):
Displaying 9 items.
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control (Q2020558) (← links)
- A gradient system approach for Hankel structured low-rank approximation (Q2029850) (← links)
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials (Q2324359) (← links)
- Distance problems in the behavioral setting (Q6092425) (← links)
- Structured low-rank approximation for nonlinear matrices (Q6109889) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)
- Implementation improvements and extensions of an ODE-based algorithm for structured low-rank approximation (Q6661007) (← links)
