scientific article
From MaRDI portal
Publication:3757242
zbMath0621.65008MaRDI QIDQ3757242
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityChebyshev polynomialsfast Fourier transformeigenfunctionsJacobi polynomialsHermite polynomialsLaguerre polynomialsSturm-Liouville eigenvalue problemLegendre polynomials
Analysis of algorithms and problem complexity (68Q25) Algorithms for approximation of functions (65D15) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric polynomials, inequalities, extremal problems (42A05)
Related Items (9)
Spectral methods with sparse matrices ⋮ A fast spherical filter with uniform resolution ⋮ Fast associated classical orthogonal polynomial transforms ⋮ Hybrid Chebyshev function bases for sparse spectral methods in parity-mixed PDEs on an infinite domain ⋮ 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 ⋮ A fast transform for spherical harmonics ⋮ Computational harmonic analysis for tensor fields on the two-sphere
This page was built for publication:
