The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Design, implementation and testing of extended and mixed precision BLAS
ACM Transactions on Mathematical Software (TOMS)
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
SIAM Journal on Matrix Analysis and Applications
Numerical evaluation of the pth derivative of Jacobi series
Applied Numerical Mathematics
Algorithms for Quad-Double Precision Floating Point Arithmetic
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
SIAM Journal on Scientific Computing
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm
ARITH '07 Proceedings of the 18th IEEE Symposium on Computer Arithmetic
Accurate simple zeros of polynomials in floating point arithmetic
Computers & Mathematics with Applications
Accurate Floating-Point Summation Part I: Faithful Rounding
SIAM Journal on Scientific Computing
Accurate Floating-Point Summation Part II: Sign, $K$-Fold Faithful and Rounding to Nearest
SIAM Journal on Scientific Computing
Accurate evaluation of a polynomial and its derivative in Bernstein form
Computers & Mathematics with Applications
Hi-index | 7.29 |
This paper presents a compensated algorithm for the evaluation of the k-th derivative of a polynomial in power basis. The proposed algorithm makes it possible the direct evaluation without obtaining the k-th derivative expression of the polynomial itself, with a very accurate result to all but the most ill-conditioned evaluation. Forward error analysis and running error analysis are performed by an approach based on the data dependency graph. Numerical experiments illustrate the accuracy and efficiency of the algorithm.