Pages that link to "Item:Q2357371"
From MaRDI portal
The following pages link to Variable projection methods for approximate (greatest) common divisor computations (Q2357371):
Displaying 9 items.
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints (Q5146698) (← links)
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
- Structured low-rank approximation for nonlinear matrices (Q6109889) (← links)
- Polarimetric Fourier phase retrieval (Q6556785) (← 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)
