Adaptive sparse grid multilevel methods for elliptic PDEs based on finite differences

Computing ◽  
1998 ◽  
Vol 61 (2) ◽  
pp. 151-179 ◽  
Author(s):  
Michael Griebel
Author(s):  
Dũng Đinh

By combining a certain  approximation property in the spatial domain, and weighted summability  of the Hermite polynomial expansion coefficients  in the parametric domain, we investigate  linear non-adaptive methods of fully discrete polynomial interpolation approximation as well as fully discrete weighted quadrature methods of integration for parametric and stochastic elliptic PDEs with lognormal inputs. We explicitly construct  such methods and prove convergence rates of the approximations by them.  The linear non-adaptive methods of fully discrete polynomial interpolation approximation are sparse-grid collocation methods which are  certain sums taken over finite nested Smolyak-type indices sets of mixed tensor products of dyadic scale successive differences of spatial approximations of particular solvers, and of  successive differences of  their parametric Lagrange interpolating polynomials. The  Smolyak-type sparse interpolation grids in the parametric domain are constructed from the roots of Hermite polynomials or their improved modifications. Moreover, they generate in a natural way fully discrete weighted quadrature formulas for integration of the solution to parametric and stochastic elliptic PDEs and its linear functionals, and the error of the  corresponding integration can be estimated via the error in Bochner space.  We also briefly  consider similar problems for parametric and stochastic elliptic PDEs with affine inputs, and  problems of non-fully discrete polynomial interpolation approximation and integration. In particular, the convergence rates of non-fully discrete polynomial interpolation approximation and integration obtained in this paper significantly improve the known ones.


2011 ◽  
Vol 11 (3) ◽  
pp. 272
Author(s):  
Ivan Gavrilyuk ◽  
Boris Khoromskij ◽  
Eugene Tyrtyshnikov

Abstract In the recent years, multidimensional numerical simulations with tensor-structured data formats have been recognized as the basic concept for breaking the "curse of dimensionality". Modern applications of tensor methods include the challenging high-dimensional problems of material sciences, bio-science, stochastic modeling, signal processing, machine learning, and data mining, financial mathematics, etc. The guiding principle of the tensor methods is an approximation of multivariate functions and operators with some separation of variables to keep the computational process in a low parametric tensor-structured manifold. Tensors structures had been wildly used as models of data and discussed in the contexts of differential geometry, mechanics, algebraic geometry, data analysis etc. before tensor methods recently have penetrated into numerical computations. On the one hand, the existing tensor representation formats remained to be of a limited use in many high-dimensional problems because of lack of sufficiently reliable and fast software. On the other hand, for moderate dimensional problems (e.g. in "ab-initio" quantum chemistry) as well as for selected model problems of very high dimensions, the application of traditional canonical and Tucker formats in combination with the ideas of multilevel methods has led to the new efficient algorithms. The recent progress in tensor numerical methods is achieved with new representation formats now known as "tensor-train representations" and "hierarchical Tucker representations". Note that the formats themselves could have been picked up earlier in the literature on the modeling of quantum systems. Until 2009 they lived in a closed world of those quantum theory publications and never trespassed the territory of numerical analysis. The tremendous progress during the very recent years shows the new tensor tools in various applications and in the development of these tools and study of their approximation and algebraic properties. This special issue treats tensors as a base for efficient numerical algorithms in various modern applications and with special emphases on the new representation formats.


Sign in / Sign up

Export Citation Format

Share Document