Efficient spectral sparse grid methods and applications to high-dimensional elliptic equations II. Unbounded domains
DOI10.1137/110834950zbMATH Open1269.65130OpenAlexW2038068268MaRDI QIDQ2904829FDOQ2904829
Publication date: 23 August 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110834950
Recommendations
- Efficient spectral sparse grid methods and applications to high-dimensional elliptic problems
- scientific article; zbMATH DE number 1424345
- A nodal sparse grid spectral element method for multi-dimensional elliptic partial differential equations
- Higher order sparse grid methods for elliptic partial differential equations with variable coefficients
- Sparse grids
unbounded domainssparse gridspectral methodhigher-dimensional problemsmapped Chebyshev functionselectronic Schrödinger equation
Direct numerical methods for linear systems and matrix inversion (65F05) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)
Cited In (23)
- Sparse grid discontinuous Galerkin methods for the Vlasov-Maxwell system
- A nodal sparse grid spectral element method for multi-dimensional elliptic partial differential equations
- Efficient spectral methods for quasi-equilibrium closure approximations of symmetric problems on unit circle and sphere
- The Adaptive Spectral Koopman Method for Dynamical Systems
- Efficient spectral-element methods for the electronic Schrödinger equation
- A Fast Cartesian Grid-Based Integral Equation Method for Unbounded Interface Problems with Non-Homogeneous Source Terms
- Sparse grid central discontinuous Galerkin method for linear hyperbolic systems in high dimensions
- A parallel sparse grid construction algorithm based on the shared memory architecture and its application to flash calculations
- Efficient space-time spectral methods for second-order problems on unbounded domains
- Efficient high order method for differential equations in unbounded domains using generalized coordinate transformation
- Direct discretization of the Schrödinger equation on thin grids
- Better approximations of high dimensional smooth functions by deep neural networks with rectified power units
- Fourier spectral method on sparse grids for computing ground state of many-particle fractional Schrödinger equations
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- Adaptive hyperbolic-cross-space mapped Jacobi method on unbounded domains with applications to solving multidimensional spatiotemporal integrodifferential equations
- A new collocation method using near-minimal Chebyshev quadrature nodes on a square
- Probabilistic surrogate models for uncertainty analysis: dimension reduction-based polynomial chaos expansion
- Exact solutions to a nonlinear partial differential equation: the Product-of-Curvatures Poisson \((u_{x x} u_{y y} = 1)\)
- Efficient spectral sparse grid approximations for solving multi-dimensional forward backward sdes
- Approximations by orthonormal mapped Chebyshev functions for higher-dimensional problems in unbounded domains
- Efficient mapping of high order basis sets for unbounded domains
- The Hermite pseudospectral method for the two-dimensional Schrödinger equation with nonseparable potentials
- Efficient spectral sparse grid methods and applications to high-dimensional elliptic problems
This page was built for publication: Efficient spectral sparse grid methods and applications to high-dimensional elliptic equations II. Unbounded domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904829)
