A Sparse Grid Discretization with Variable Coefficient in High Dimensions
نویسنده
چکیده
We present a Ritz-Galerkin discretization on sparse grids using pre-wavelets, which allows to solve elliptic differential equations with variable coefficients for dimension d = 2, 3 and higher dimensions d > 3. The method applies multilinear finite elements. We introduce an efficient algorithm for matrix vector multiplication using a Ritz-Galerkin discretization and semi-orthogonality. This algorithm is based on standard 1-dimensional restrictions and prolongations, a simple pre-wavelet stencil, and the classical operator dependent stencil for multilinear finite elements. Numerical simulation results are presented for a 3-dimensional problem on a curvilinear bounded domain and for a 6-dimensional problem with variable coefficients. Simulation results show a convergence of the discretization according to the approximation properties of the finite element space. The condition number of the stiffness matrix can be bounded below 10 using a standard diagonal preconditioner.
منابع مشابه
Semi-implicit integration factor methods on sparse grids for high-dimensional systems
Numerical methods for partial differential equations in high-dimensional spaces are often limited by the curse of dimensionality. Though the sparse grid technique, based on a one-dimensional hierarchical basis through tensor products, is popular for handling challenges such as those associated with spatial discretization, the stability conditions on time step size due to temporal discretization...
متن کاملDimension-wise integration of high-dimensional functions with applications to finance
We present a new general class of methods for the computation of high-dimensional integrals. The quadrature schemes result by truncation and discretization of the anchored-ANOVA decomposition. They are designed to exploit low effective dimensions and include sparse grid methods as special case. To derive bounds for the resulting modelling and discretization errors, we introduce effective dimens...
متن کاملA simple finite difference method for time-dependent, variable coefficient Stokes flow on irregular domains
We present a simple and efficient variational finite difference method for simulating time-dependent Stokes flow in the presence of irregular free surfaces and moving solid boundaries. The method uses an embedded boundary approach on staggered Cartesian grids, avoiding the need for expensive remeshing operations, and can be applied to flows in both two and three dimensions. It uses fully implic...
متن کاملOn the stability of the hyperbolic cross discrete Fourier transform
A straightforward discretisation of problems in high dimensions often leads to an exponential growth in the number of degrees of freedom. Sparse grid approximations allow for a severe decrease in the number of used Fourier coefficients to represent functions with bounded mixed derivatives and the fast Fourier transform (FFT) has been adapted to this thin discretisation. We show that this so cal...
متن کاملParallel Adaptively Re ned Sparse
A parallel version of a nite diierence discretization of PDEs on sparse grids is proposed. Sparse grids or hyperbolic crosspoints can be used for the eecient representation of solutions of a boundary value problem, especially in high dimensions , because the number of grid points depends only weakly on the dimension. So far only thècombination' technique for regular sparse grids was available o...
متن کامل