We introduce and deploy a generic, highly scalable computational method to solve high-dimensional dynamic stochastic economic models on high-performance computing platforms. Within an MPI---TBB parallel, nonlinear time iteration framework, we approximate economic policy functions using an adaptive sparse grid algorithm with d-linear basis functions that is combined with a dimensional decomposition scheme. Numerical experiments on "Piz Daint" (Cray XC30) at the Swiss National Supercomputing Centre show that our framework scales nicely to at least 1,000 compute nodes. As an economic application, we compute global solutions to international real business cycle models up to 200 continuous dimensions with significant speedup values over state-of...
We use the stochastic simulation algorithm, described in Judd et al. (2009), and the cluster-grid al...
We show how to enhance the performance of a Smolyak method for solving dynamic economic models. Firs...
AbstractStochastic dynamic programs suffer from the so called curse of dimensionality whereby the nu...
We introduce and deploy a generic, highly scalable computational method to solve high-dimensional dy...
We present a highly parallelizable and flexible computational method to solve high-dimensional stoch...
We present a exible and scalable method for computing global solutions of high-dimensional stochasti...
We propose a massively parallelized and optimized framework to solve high-dimensional dynamic stocha...
Abstract: We present a comprehensive framework for Bayesian estima-tion of structural nonlinear dyna...
We introduce a numerical algorithm for solving dynamic economic models that merges stochastic simula...
We introduce a numerical algorithm for solving dynamic economic models that merges stochastic simula...
Many practical decision problems involve both nonlinear relationships and uncertainties. The resulti...
We present a scalable high-performance computing implementation of an agent-based economic model usi...
In this paper we consider a dynamic market equilibrium problem over a finite time horizon in which a...
This thesis presents a parallel algorithm for non-convex large-scale stochastic optimization problem...
This paper introduces a new algorithm, the recursive upwind Gauss–Seidel method, and applies it to s...
We use the stochastic simulation algorithm, described in Judd et al. (2009), and the cluster-grid al...
We show how to enhance the performance of a Smolyak method for solving dynamic economic models. Firs...
AbstractStochastic dynamic programs suffer from the so called curse of dimensionality whereby the nu...
We introduce and deploy a generic, highly scalable computational method to solve high-dimensional dy...
We present a highly parallelizable and flexible computational method to solve high-dimensional stoch...
We present a exible and scalable method for computing global solutions of high-dimensional stochasti...
We propose a massively parallelized and optimized framework to solve high-dimensional dynamic stocha...
Abstract: We present a comprehensive framework for Bayesian estima-tion of structural nonlinear dyna...
We introduce a numerical algorithm for solving dynamic economic models that merges stochastic simula...
We introduce a numerical algorithm for solving dynamic economic models that merges stochastic simula...
Many practical decision problems involve both nonlinear relationships and uncertainties. The resulti...
We present a scalable high-performance computing implementation of an agent-based economic model usi...
In this paper we consider a dynamic market equilibrium problem over a finite time horizon in which a...
This thesis presents a parallel algorithm for non-convex large-scale stochastic optimization problem...
This paper introduces a new algorithm, the recursive upwind Gauss–Seidel method, and applies it to s...
We use the stochastic simulation algorithm, described in Judd et al. (2009), and the cluster-grid al...
We show how to enhance the performance of a Smolyak method for solving dynamic economic models. Firs...
AbstractStochastic dynamic programs suffer from the so called curse of dimensionality whereby the nu...