Extending adaptive sparse grids for stochastic collo- cation to hybrid parallel architectures

نویسندگان

  • Richard K. Archibald
  • Ralf Deiterding
  • John Jakeman
چکیده

1 Stochastic collocation In a stochastic simulation, one is typically interested in the relationship between the variables that drive the system (inputs) and the system response (outputs). For the “forward problem,” the inputs Z = (Z1, . . . , Zd) are random variables with distributions that we assume to be known. The outputs are some known functions g of the simulation state u = u(x, t;Z), which depends on Z and the deterministic variables x and (possibly) time t. The mapping from Z to g(u) can be given abstractly by the function G

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Adaptive Sparse Grids to Solve High-Dimensional Dynamic Models∗

We present a flexible and scalable method to compute global solutions of high-dimensional non-smooth dynamic models. Within a timeiteration setup, we interpolate policy functions using an adaptive sparse grid algorithm with piecewise multi-linear (hierarchical) basis functions. As the dimensionality increases, sparse grids grow considerably slower than standard tensor product grids. In addition...

متن کامل

Scalable high-dimensional dynamic stochastic economic modeling

We present a highly parallelizable and flexible computational method to solve highdimensional stochastic dynamic economic models. Solving such models often requires the use of iterative methods, like time iteration or dynamic programming. By exploiting the generic iterative structure of this broad class of economic problems, we propose a parallelization scheme that favors hybrid massively paral...

متن کامل

An Abstract Data Type for Parallel Simulations Based on Sparse Grids

In this paper we introduce an abstract data type for the distributed representation and eecient handling of sparse grids on parallel architectures. The new data layout, implemented by means of the PVM message passing library, provides partitioning and dynamic load balancing transparent to the application making use of it. This enables parallelization of sequential partial diierential equations ...

متن کامل

Numerical Comparison of Leja and Clenshaw-Curtis Dimension-Adaptive Collocation for Stochastic Parametric Electromagnetic Field Problems

We consider the problem of approximating the output of a parametric electromagnetic field model in the presence of a large number of uncertain input parameters. Given a sufficiently smooth output with respect to the input parameters, such problems are often tackled with interpolation-based approaches, such as the stochastic collocation method on tensor-product or isotropic sparse grids. Due to ...

متن کامل

Cluster-based Communication and Load Balancing for Simulations on Dynamically Adaptive Grids

The present paper introduces a new communication and load-balancing scheme based on a clustering of the grid which we use for the efficient parallelization of simulations on dynamically adaptive grids. With a partitioning based on space-filling curves (SFCs), this yields several advantageous properties regarding the memory requirements and load balancing. However, for such an SFC-based partitio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011