Pages that link to "Item:Q1004779"
From MaRDI portal
The following pages link to Accurate simple zeros of polynomials in floating point arithmetic (Q1004779):
Displaying 10 items.
- Reducing rounding errors and achieving Brouwer's law with Taylor series method (Q425370) (← links)
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems (Q521243) (← links)
- Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
- Accurate evaluation of a polynomial and its derivative in Bernstein form (Q611362) (← links)
- Numerical validation of compensated algorithms with stochastic arithmetic (Q2318228) (← links)
- A parametric approach for dealing with compositional rounded zeros (Q2461577) (← links)
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (Q2672185) (← links)
- (Q3421276) (← links)
- (Q4008400) (← links)
- Fast evaluation and root finding for polynomials with floating-point coefficients (Q6615413) (← links)