Sparse grids 论文

2004Cambridge University Press eBooks引用 374
Advanced Mathematical Modeling in EngineeringAdvanced Numerical Methods in Computational MathematicsMatrix Theory and Algorithms

摘要

We present a survey of the fundamentals and the applications of sparse grids, with a focus on the solution of partial differential equations (PDEs). The sparse grid approach, introduced in Zenger (1991), is based on a higherdimensional multiscale basis, which is derived from a one-dimensional multiscale basis by a tensor product construction. Discretizations on sparse grids involve O(N · (log N)d-1) degrees of freedom only, where d denotes the underlying problem's dimensionality and where N is the number of grid points in one coordinate direction at the boundary. The accuracy obtained with piecewise linear basis functions, for example, is O(N-2 · (log N)d-1) with respect to the L2- and L∞- norm, if the solution has bounded second mixed derivatives. This way, the curse of dimensionality, i.e., the exponential dependence O(Nd) of conventional approaches, is overcome to some extent. For the energy norm, only O(N) degrees of freedom are needed to give an accuracy of O(N-1). That is why sparse grids are especially well-suited for problems of very high dimensionality.