A polynomial interpolation process at quasi-Chebyshev nodes with the FFT (Q3094285): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of MATLAB to Continuous Functions and Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barycentric Lagrange Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Clenshaw-Curtis quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for numerical integration on an automatic computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Clenshaw-Curtis quadrature, I methodology and experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Chebyshev Interpolation and Its Application to Automatic Quadrature / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm Based on the FFT for a Generalized Chebyshev Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier transform and convolution algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebfun: A New Kind of Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for discrete polynomial transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accuracy of the Chebyshev Differencing Method for Analytic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product integration with the Clenshaw-Curtis points: Implementation and error estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Interpolation on Quasi-Equidistributed Nodes on the Unit Disk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric FFTs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is Gauss Quadrature Better than Clenshaw–Curtis? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of the Fejér and Clenshaw-Curtis quadrature rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kink phenomenon in Fejér and Clenshaw-Curtis quadrature / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02484-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009904684 / rank
 
Normal rank

Latest revision as of 08:27, 30 July 2024

scientific article
Language Label Description Also known as
English
A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
scientific article

    Statements

    A polynomial interpolation process at quasi-Chebyshev nodes with the FFT (English)
    0 references
    0 references
    0 references
    24 October 2011
    0 references
    Chebyshev interpolation
    0 references
    Chebyshev nodes
    0 references
    quasi-Chebyshev nodes
    0 references
    chinese remainder theorem
    0 references
    error estimate
    0 references
    computational complexity
    0 references
    fast algorithm
    0 references
    fast Fourier transform (FFT)
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references