Efficient spectral sparse grid methods and applications to high-dimensional elliptic problems
From MaRDI portal
algorithmsChebyshev-Gauss-Lobatto quadratureelliptic equationhigh-dimensional problemnumerical resultssparse spectral-Galerkin methods
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) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)
Recommendations
- Efficient spectral sparse grid methods and applications to high-dimensional elliptic equations II. Unbounded domains
- A nodal sparse grid spectral element method for multi-dimensional elliptic partial differential equations
- scientific article; zbMATH DE number 733550
- Efficient Spectral-Galerkin Method I. Direct Solvers of Second- and Fourth-Order Equations Using Legendre Polynomials
- Higher order sparse grid methods for elliptic partial differential equations with variable coefficients
Cited in
(66)- Sparse high order FEM for elliptic sPDEs
- Improved spectral multigrid methods for periodic elliptic problems
- A fast discrete spectral method for stochastic partial differential equations
- A novel recursive method to reconstruct multivariate functions on the unit cube
- High order integration factor methods for systems with inhomogeneous boundary conditions
- A new spectral element method for pricing European options under the Black-Scholes and Merton jump diffusion models
- A new fast method of solving the high dimensional elliptic eigenvalue problem
- Exact solutions to a nonlinear partial differential equation: the Product-of-Curvatures Poisson \((u_{x x} u_{y y} = 1)\)
- An \(O(N)\) algorithm for computing expectation of \(N\)-dimensional truncated multi-variate normal distribution. II: computing moments and sparse grid acceleration
- An adaptive high-order piecewise polynomial based sparse grid collocation method with applications
- An adaptive sparse grid local discontinuous Galerkin method for Hamilton-Jacobi equations in high dimensions
- Randomized Newton's method for solving differential equations based on the neural network discretization
- A new collocation method using near-minimal Chebyshev quadrature nodes on a square
- 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
- 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
- Parallel spectral-element direction splitting method for incompressible Navier-Stokes equations
- 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
- Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case
- 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
- Sparse grid discontinuous Galerkin methods for high-dimensional elliptic equations
- 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 parallelization for 3d-3v sparse grid particle-in-cell: shared memory architectures
- Efficient spectral-element methods for the electronic Schrödinger equation
- Efficient spectral sparse grid methods and applications to high-dimensional elliptic equations II. Unbounded domains
- Sparsity Optimized High Order Finite Element Functions on Simplices
- Optimized general sparse grid approximation spaces for operator equations
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
- Fast structured direct spectral methods for differential equations with variable coefficients. I. The one-dimensional case
- Array-representation integration factor method for high-dimensional systems
- Semi-implicit integration factor methods on sparse grids for high-dimensional systems
- Sparse finite element approximation of high-dimensional transport-dominated diffusion problems
- scientific article; zbMATH DE number 733550 (Why is no real title available?)
- Orthogonal polynomial expansions on sparse grids
- A nodal sparse grid spectral element method for multi-dimensional elliptic partial differential equations
- Compact implicit integration factor methods for a family of semilinear fourth-order parabolic equations
- scientific article; zbMATH DE number 877099 (Why is no real title available?)
- Stochastic Methods for Solving High-Dimensional Partial Differential Equations
- An adaptive multiresolution discontinuous Galerkin method with artificial viscosity for scalar hyperbolic conservation laws in multidimensions
- 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
- Uncertainty Quantification Using Periodic Random Variables
- Sparse grid central discontinuous Galerkin method for linear hyperbolic systems in high dimensions
- Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids
- Sparse spectral approximations of high-dimensional problems based on hyperbolic cross
- A sparse grid method for the Navier-Stokes equations based on hyperbolic cross
- 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
- Probabilistic surrogate models for uncertainty analysis: dimension reduction-based polynomial chaos expansion
- Adaptive hyperbolic-cross-space mapped Jacobi method on unbounded domains with applications to solving multidimensional spatiotemporal integrodifferential equations
- Prediction-correction method for nonlinear partial differential equations based on sparse grid interpolation techniques
- Spectral informed neural networks
- Sparse pseudospectral approximation method
- Sparse-grid discontinuous Galerkin methods for the Vlasov-Poisson-Lenard-Bernstein model
- Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions
- Tensor neural network and its numerical integration
- Sparse wavelet element method for piezoelectric equations in an unbounded domain
- ChebNet: efficient and stable constructions of deep neural networks with rectified power units via Chebyshev approximation
- Physics-informed deep learning and compressive collocation for high-dimensional diffusion-reaction equations: practical existence theory and numerics
- Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model
- Guaranteed cost spacecraft attitude stabilization under actuator misalignments using linear partial differential equations
This page was built for publication: Efficient spectral sparse grid methods and applications to high-dimensional elliptic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200249)
