Pages that link to "Item:Q5501605"
From MaRDI portal
The following pages link to Multiplicity hunting and approximating multiple roots of polynomial systems (Q5501605):
Displaying 13 items.
- The computation of multiple roots of a polynomial (Q425345) (← links)
- Foreword. What is numerical algebraic geometry? (Q507158) (← links)
- Verified error bounds for eigenvalues of geometric multiplicity \(q\) and corresponding invariant subspaces (Q684197) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
- A new deflation method for verifying the isolated singular zeros of polynomial systems (Q1987424) (← links)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems (Q2163445) (← links)
- Subresultants in multiple roots: an extremal case (Q2361559) (← links)
- On deflation and multiplicity structure (Q2628321) (← links)
- A certified iterative method for isolated singular roots (Q2674007) (← links)
- Verified error bounds for isolated singular solutions of polynomial systems (Q2927825) (← links)
- Critical Points of the Multiplier Map for the Quadratic Family (Q5070660) (← links)
- On multivariate polynomials with many roots over a finite grid (Q5157742) (← links)
