Pages that link to "Item:Q1904521"
From MaRDI portal
The following pages link to Weyl's quadtree algorithm for the unsymmetric eigenvalue problem (Q1904521):
Displaying 3 items.
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- 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) (← links)