Publication:5849046

From MaRDI portal


zbMath0065.05403MaRDI QIDQ5849046

C. W. Clenshaw

Publication date: 1955




Related Items

An Algorithm for Summing Orthogonal Polynomial Series and their Derivatives with Applications to Curve-Fitting and Interpolation, An Algorithm for Certain Double Sums of Polynomial Series, Stability of parallel algorithms to evaluate Chebyshev series, Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series, Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms, Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability, Recursive construction of a sequence of solutions to homogeneous linear partial differential equations with constant coefficients, Stability of parallel algorithms for polynomial evaluation, Fast polynomial multiplication and convolutions related to the discrete cosine transform, Product integration with the Clenshaw-Curtis points: Implementation and error estimates, A method for numerical integration on an automatic computer, Rootfinding through global Newton iteration and Chebyshev polynomials for the amplitude of an electronic oscillator, Experiments with a class of generalized trigonometric polynomials, Baryzentrische Formeln zur Trigonometrischen Interpolation. I, A method for computing Bessel function integrals, Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines, On the application of Newbery's transformation to the Reinsch polynomial evaluation scheme, Barycentric formulas for interpolating trigonometric polynomials and their conjugates, Computation of Gaussian quadrature rules from modified moments, A quadrature rule for finite-part integrals, A stable method for the evaluation of a polynomial and of a rational function of one variable, An algorithm for the evaluation of multidimensional (direct and inverse) discrete Chebyshev transforms, On algorithms for the summation of certain special functions, A summation technique for minimal solutions of linear homogeneous difference equations, On the sensitivity to rounding errors of Chebyshev series approximations, A variable coefficient extension of a formula for series conversion, Rounding error propagation in polynomial evaluation schemes, Chebyshev collocation methods for fast orbit determination, Fast and stable algorithms for discrete spherical Fourier transforms, Reliable determination of interpolating polynomials, On a Chebyshev matrix operator method for ordinary linear differential equations with non-constant coefficients, A stable Stieltjes technique for computing orthogonal polynomials and Jacobi matrices associated with a class of singular measures, Algorithms for the integration and derivation of Chebyshev series., Computing integral transforms and solving integral equations using Chebyshev polynomial approximations, High-order recurrences satisfied by classical orthogonal polynomials., On improving the accuracy of Horner's and Goertzel's algorithms, An analogue for Szegő polynomials of the Clenshaw algorithm, Expansion of multivariable polynomials in products of orthogonal polynomials in one variable, Compression of almost-periodic data., Numerical evaluation of the \(p\)th derivative of Jacobi series, On the numerical evaluation of linear recurrences, Orthogonal functions for cross-directional control of web forming processes, Gaussian quadrature formulae of the third kind for Cauchy principal value integrals: Basic properties and error estimates, Parallel evaluation of Chebyshev and trigonometric series, An algorithm for the numerical evaluation of certain Cauchy principal value integrals, Gauss Type Quadrature Rules for Cauchy Principal Value Integrals, Comments on the summations of spherical harmonics in the geopotential evaluation theories of Deprit and others, Polynomial Expansions of Bessel Functions and Some Associated Functions, Error Analysis for Polynomial Evaluation, Error Analysis for Fourier Series Evaluation, Fast algorithms for discrete polynomial transforms