Orthogonal polynomial expansions on sparse grids

DOI10.1016/J.JCO.2014.04.001zbMATH Open1300.65009OpenAlexW2046921083MaRDI QIDQ457562FDOQ457562

Authors: 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

Recommendations

• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• On expansions in orthogonal polynomials
• Rapidly computing sparse Legendre expansions via sparse Fourier transforms
• scientific article; zbMATH DE number 1210426
• A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions

zbMATH Keywords

stabilityalgorithmnumerical experimentscollocation methodexponential convergenceanalytic functionorthogonal polynomialsparse gridspectral methodfast cosine transform

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Algorithms for approximation of functions (65D15) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Real-analytic functions (26E05) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Sparse grids
• Chebyshev and Fourier spectral methods.
• Spectral methods. Algorithms, analysis and applications.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• Fouriertransform on sparse grids with hierarchical bases
• High dimensional polynomial interpolation on sparse grids
• The Discrete Cosine Transform
• Fast algorithms for discrete polynomial transforms
• Approximation of infinitely differentiable multivariate functions is intractable
• 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
• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• A Fast Algorithm for the Evaluation of Legendre Expansions
• Fast algorithms for discrete polynomial transforms on arbitrary grids
• Title not available (Why is that?)
• Fast conversion algorithms for orthogonal polynomials
• Fast Algorithms for Periodic Spline Wavelets on Sparse Grids
• B-spline quasi-interpolation on sparse grids

Cited In (3)

• Computing the Newton potential in the boundary integral equation for the Dirichlet problem of the Poisson equation
• A Fast Matrix-free Algorithm for Spectral Approximations to the Schrödinger Equation
• A fast discrete spectral method for stochastic partial differential equations

This page was built for publication: Orthogonal polynomial expansions on sparse grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457562)