Publication:3757242
From MaRDI portal
zbMath0621.65008MaRDI QIDQ3757242
Publication date: 1986
computational complexity; Chebyshev polynomials; fast Fourier transform; eigenfunctions; Jacobi polynomials; Hermite polynomials; Laguerre polynomials; Sturm-Liouville eigenvalue problem; Legendre polynomials
68Q25: Analysis of algorithms and problem complexity
65D15: Algorithms for approximation of functions
65T40: Numerical methods for trigonometric approximation and interpolation
42A05: Trigonometric polynomials, inequalities, extremal problems
Related Items
Fast structured Jacobi-Jacobi transforms, Fast polynomial transforms based on Toeplitz and Hankel matrices, When integration sparsification fails: banded Galerkin discretizations for Hermite functions, rational Chebyshev functions and sinh-mapped Fourier functions on an infinite domain, and Chebyshev methods for solutions with \(C^\infty\) endpoint singularities, Spectral methods with sparse matrices, A fast transform for spherical harmonics, A fast spherical filter with uniform resolution, Computational harmonic analysis for tensor fields on the two-sphere, Hybrid Chebyshev function bases for sparse spectral methods in parity-mixed PDEs on an infinite domain, Fast associated classical orthogonal polynomial transforms