The following pages link to Nearest singular polynomials (Q1281843):
Displaying 11 items.
- Computing the nearest singular univariate polynomials with given root multiplicities (Q385010) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Hybrid method for computing the nearest singular polynomials (Q701907) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- On real factors of real interval polynomials (Q1025398) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method (Q1870045) (← links)
- Locating the closest singularity in a polynomial homotopy (Q2109994) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval (Q3597978) (← links)
