Pages that link to "Item:Q3836210"
From MaRDI portal
The following pages link to General polynomial roots and their multiplicities in<i>O</i>(<i>N</i>)memory and<i>O</i>(<i>N</i><sup>2</sup>)Time<sup>∗</sup> (Q3836210):
Displaying 5 items.
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- A global algorithm to estimate the expectations of the components of an observed univariate mixture (Q1042627) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- Constructive ways for generating (generalized) real orthogonal matrices as products of (generalized) symmetries (Q5946194) (← links)
