Fast algorithms for spectral differentiation matrices
zbMATH Open1327.65250MaRDI QIDQ896876FDOQ896876
Authors: Jared Lee Aurentz
Publication date: 15 December 2015
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/ETNA/volumes/2011-2020/vol44/abstract_vol44_pp281-288.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A fast algorithm for spectral differentiation
- Rapid Prolate Pseudospectral Differentiation and Interpolation with the Fast Multipole Method
- Generation of Pseudospectral Differentiation Matrices I
- Fractional spectral differentiation matrices based on Legendre approximation
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)
Cited In (6)
- Fast computation of the spectral differentiation by the fast multipole method
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Fast algorithms for Brownian matrices
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Fast differentiation algorithm and efficient calculation of the exact matrix of second derivatives
- Fourth-Order Time-Stepping For Stiff PDEs On The Sphere
Uses Software
This page was built for publication: Fast algorithms for spectral differentiation matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896876)