• Login
    View Item 
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Hale, Nicholas
    Townsend, Alex
    KAUST Grant Number
    KUK-C1-013-04
    Date
    2014-02-06
    Online Publication Date
    2014-02-06
    Print Publication Date
    2014-01
    Permanent link to this record
    http://hdl.handle.net/10754/597266
    
    Metadata
    Show full item record
    Abstract
    A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(log N)2/ log log N) operations is derived. The fundamental idea of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency and numerical stability. Since the algorithm evaluates a Legendre expansion at an N +1 Chebyshev grid as an intermediate step, it also provides a fast transform between Legendre coefficients and values on a Chebyshev grid. © 2014 Society for Industrial and Applied Mathematics.
    Citation
    Hale N, Townsend A (2014) A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula. SIAM Journal on Scientific Computing 36: A148–A167. Available: http://dx.doi.org/10.1137/130932223.
    Sponsors
    The first author's work was supported by The MathWorks, Inc., and King Abdullah University of Science and Technology (KAUST), award KUK-C1-013-04. The second author's work was supported by EPSRC grant EP/P505666/1 and by the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement 291068.
    Publisher
    Society for Industrial & Applied Mathematics (SIAM)
    Journal
    SIAM Journal on Scientific Computing
    DOI
    10.1137/130932223
    ae974a485f413a2113503eed53cd6c53
    10.1137/130932223
    Scopus Count
    Collections
    Publications Acknowledging KAUST Support

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.