Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
From MaRDI portal
Publication:5200249
DOI10.1137/100787842zbMath1233.65094OpenAlexW2091280316MaRDI QIDQ5200249
Publication date: 1 August 2011
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100787842
algorithmsnumerical resultselliptic equationhigh-dimensional problemChebyshev-Gauss-Lobatto quadraturesparse spectral-Galerkin methods
Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (43)
An adaptive high-order piecewise polynomial based sparse grid collocation method with applications ⋮ Approximation of functions on a square by interpolation polynomials at vertices and few Fourier coefficients ⋮ Efficient spectral sparse grid approximations for solving multi-dimensional forward backward sdes ⋮ An adaptive sparse grid local discontinuous Galerkin method for Hamilton-Jacobi equations in high dimensions ⋮ Sparse grid discontinuous Galerkin methods for high-dimensional elliptic equations ⋮ Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case ⋮ Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids ⋮ Array-representation integration factor method for high-dimensional systems ⋮ Randomized Newton's method for solving differential equations based on the neural network discretization ⋮ Semi-implicit integration factor methods on sparse grids for high-dimensional systems ⋮ A new collocation method using near-minimal Chebyshev quadrature nodes on a square ⋮ A new spectral element method for pricing European options under the Black-Scholes and Merton jump diffusion models ⋮ A fast discrete spectral method for stochastic partial differential equations ⋮ Efficient parallelization for 3D-3V sparse grid particle-in-cell: single GPU architectures ⋮ Sparse grid discontinuous Galerkin methods for the Vlasov-Maxwell system ⋮ The Adaptive Spectral Koopman Method for Dynamical Systems ⋮ A novel recursive method to reconstruct multivariate functions on the unit cube ⋮ Efficient parallelization for 3d-3v sparse grid particle-in-cell: shared memory architectures ⋮ Stochastic Methods for Solving High-Dimensional Partial Differential Equations ⋮ A parallel sparse grid construction algorithm based on the shared memory architecture and its application to flash calculations ⋮ An adaptive multiresolution interior penalty discontinuous Galerkin method for wave equations in second order form ⋮ Efficient high order method for differential equations in unbounded domains using generalized coordinate transformation ⋮ Orthogonal polynomial expansions on sparse grids ⋮ An Adaptive Multiresolution Discontinuous Galerkin Method with Artificial Viscosity for Scalar Hyperbolic Conservation Laws in Multidimensions ⋮ Compact implicit integration factor methods for a family of semilinear fourth-order parabolic equations ⋮ An \(O(N)\) algorithm for computing expectation of \(N\)-dimensional truncated multi-variate normal distribution. I: Fundamentals ⋮ Efficient spectral methods for quasi-equilibrium closure approximations of symmetric problems on unit circle and sphere ⋮ Efficient Mapping of High Order Basis Sets for Unbounded Domains ⋮ Better Approximations of High Dimensional Smooth Functions by Deep Neural Networks with Rectified Power Units ⋮ Parallel spectral-element direction splitting method for incompressible Navier-Stokes equations ⋮ High order integration factor methods for systems with inhomogeneous boundary conditions ⋮ A sparse grid method for the Navier-Stokes equations based on hyperbolic cross ⋮ Sparse pseudospectral approximation method ⋮ A new constructive and elementary proof of a Bernstein-Walsh theorem, improved to infinite order convergence, for functions \(C^\infty\) in an intricate but smooth two-dimensional real domain ⋮ Fast evaluation of system matrices w.r.t. multi-tree collections of tensor product refinable basis functions ⋮ Approximations by orthonormal mapped Chebyshev functions for higher-dimensional problems in unbounded domains ⋮ Efficient Spectral-Element Methods for the Electronic Schrödinger Equation ⋮ Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case ⋮ Uncertainty Quantification Using Periodic Random Variables ⋮ Sparse Grid Central Discontinuous Galerkin Method for Linear Hyperbolic Systems in High Dimensions ⋮ Exact solutions to a nonlinear partial differential equation: the Product-of-Curvatures Poisson \((u_{x x} u_{y y} = 1)\) ⋮ Guaranteed cost spacecraft attitude stabilization under actuator misalignments using linear partial differential equations ⋮ An \(O(N)\) algorithm for computing expectation of \(N\)-dimensional truncated multi-variate normal distribution. II: computing moments and sparse grid acceleration
Uses Software
This page was built for publication: Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
