Fast algorithms for spectral differentiation matrices
From MaRDI portal
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
Cited in
(9)- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Fractional spectral differentiation matrices based on Legendre approximation
- Fourth-order time-stepping for stiff PDEs on the sphere
- Fast algorithms for Brownian matrices
- Fast computation of the spectral differentiation by the fast multipole method
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Fast differentiation algorithm and efficient calculation of the exact matrix of second derivatives
- Fast computation of orthogonal systems with a skew-symmetric differentiation matrix
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)