Pages that link to "Item:Q2378493"
From MaRDI portal
The following pages link to Approximate gcds of polynomials and sparse SOS relaxations (Q2378493):
Displayed 8 items.
- 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)
- Approximate square-free part and decomposition (Q2229724) (← 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)
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
- A complete algorithm to find exact minimal polynomial by approximations (Q4902848) (← links)