Pages that link to "Item:Q4890062"
From MaRDI portal
The following pages link to Numerical impluimentation of a new algorithm for polynomials with multiple roots (Q4890062):
Displaying 7 items.
- The computation of multiple roots of a polynomial (Q425345) (← links)
- A study of accelerated Newton methods for multiple polynomial roots (Q973853) (← links)
- Design, analysis, and implementation of a multiprecision polynomial rootfinder (Q1569736) (← links)
- Computers and the Multiplicity of Polynomial Roots (Q3327625) (← 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)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- (Q4890087) (← links)