Accurate evaluation of a polynomial in Chebyshev form
From MaRDI portal
(Redirected from Publication:555368)
Recommendations
- Accurate evaluation of polynomials in Legendre basis
- Algorithms for accurate, validated and fast polynomial evaluation
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
Cites work
- A floating-point technique for extending the available precision
- A unified rounding error bound for polynomial evaluation
- Accuracy and Stability of Numerical Algorithms
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Accurate Floating-Point Product and Exponentiation
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate floating-point summation. II: Sign, K-fold faithful and rounding to nearest
- Accurate simple zeros of polynomials in floating point arithmetic
- Accurate Sum and Dot Product
- Algorithms for accurate, validated and fast polynomial evaluation
- An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
- An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
- Backward stability of Clenshaw's algorithm
- Basis conversions among univariate polynomial representations
- Design, implementation and testing of extended and mixed precision BLAS
- Error analysis of an algorithm for summing certain finite series
- scientific article; zbMATH DE number 3936379 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1547082 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Numerical condition of polynomials in different forms
- On algorithms for the summation of certain special functions
- Polynomial evaluation and associated polynomials
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Rounding error propagation in polynomial evaluation schemes
- The evaluation of the zeros of ill-conditioned polynomials. I, II
Cited in
(19)- Polynomial evaluation and associated polynomials
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- Accurate quotient-difference algorithm: error analysis, improvements and applications
- Accurate evaluation of the k-th derivative of a polynomial and its application
- Accurate and efficient evaluation of Chebyshev tensor product surface
- Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
- Compensated de Casteljau algorithm in \(K\) times the working precision
- \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives
- The Laurent-Horner method for validated evaluation of Chebyshev expansions
- Numerical validation of compensated algorithms with stochastic arithmetic
- An accurate algorithm for evaluating rational functions
- Accurate evaluation of polynomials in Legendre basis
- scientific article; zbMATH DE number 1950380 (Why is no real title available?)
- High-precision computation: mathematical physics and dynamics
- scientific article; zbMATH DE number 1547082 (Why is no real title available?)
- Enclosing Chebyshev expansions in linear time
- Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
This page was built for publication: Accurate evaluation of a polynomial in Chebyshev form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555368)
