Orthogonal polynomial expansions on sparse grids
DOI10.1016/j.jco.2014.04.001zbMath1300.65009OpenAlexW2046921083MaRDI QIDQ457562
Yanzhao Cao, Ying Jiang, Yuesheng Xu
Publication date: 29 September 2014
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2014.04.001
algorithmstabilitycollocation methodnumerical experimentsanalytic functionsparse gridspectral methodexponential convergenceorthogonal polynomialfast cosine transform
Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical methods for discrete and fast Fourier transforms (65T50) Algorithms for approximation of functions (65D15) Real-analytic functions (26E05)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- B-spline quasi-interpolation on sparse grids
- Fast conversion algorithms for orthogonal polynomials
- Fouriertransform on sparse grids with hierarchical bases
- Fast algorithms for discrete polynomial transforms on arbitrary grids
- High dimensional polynomial interpolation on sparse grids
- Approximation of infinitely differentiable multivariate functions is intractable
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Spectral Methods
- A Fast Algorithm for the Evaluation of Legendre Expansions
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Fast algorithms for discrete polynomial transforms
- Fast Algorithms for Periodic Spline Wavelets on Sparse Grids
- The Discrete Cosine Transform
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
- Sparse grids
This page was built for publication: Orthogonal polynomial expansions on sparse grids