Pages that link to "Item:Q385010"
From MaRDI portal
The following pages link to Computing the nearest singular univariate polynomials with given root multiplicities (Q385010):
Displaying 5 items.
- Efficient computation of dual space and directional multiplicity of an isolated point (Q1634816) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- A unified approach to computing the nearest complex polynomial with a given zero (Q2354766) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted \(\ell_{2, q}\)-norm minimization and its complex extension (Q6548958) (← links)
