Pages that link to "Item:Q849175"
From MaRDI portal
The following pages link to Algorithms for accurate, validated and fast polynomial evaluation (Q849175):
Displayed 15 items.
- Reducing rounding errors and achieving Brouwer's law with Taylor series method (Q425370) (← links)
- High-precision computation: mathematical physics and dynamics (Q449457) (← links)
- Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
- Accurate evaluation of a polynomial and its derivative in Bernstein form (Q611362) (← links)
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form (Q643356) (← links)
- Accurate quotient-difference algorithm: error analysis, improvements and applications (Q1738119) (← links)
- Evaluation schemes in the ring of quaternionic polynomials (Q1742581) (← links)
- Compensated de Casteljau algorithm in \(K\) times the working precision (Q2009574) (← links)
- PACF: a precision-adjustable computational framework for solving singular values (Q2101911) (← links)
- Matrix representations for multi-degree B-splines (Q2195892) (← links)
- Numerical validation of compensated algorithms with stochastic arithmetic (Q2318228) (← links)
- An accurate algorithm for evaluating rational functions (Q2335677) (← links)
- Accurate evaluation of polynomials in Legendre basis (Q2336684) (← links)
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (Q2672185) (← links)
- Algorithm 954 (Q2828160) (← links)