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 18 items.
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Common factor detection and estimation (Q1360497) (← 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)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials (Q2324359) (← links)
- Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- (Q4226976) (← links)
- Computing Divisors and Common Multiples of Quasi-linear Ordinary Differential Equations (Q5168467) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter (Q5930921) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← 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)
