Logo
Munich Personal RePEc Archive

Solving Heterogeneous agent models in Continuous Time with Adaptive Sparse Grids

Du, Zaichuan (2026): Solving Heterogeneous agent models in Continuous Time with Adaptive Sparse Grids.

This is the latest version of this item.

[thumbnail of MPRA_paper_128564.pdf]
Preview
PDF
MPRA_paper_128564.pdf

Download (815kB) | Preview

Abstract

This paper proposes a new approach to numerically solving a wide class of heterogeneous agent models in continuous time using adaptive sparse grids. I combine the sparse finite difference method with the sparse finite volume method to solve the Hamilton-Jacobian-Bellman equation and Kolmogorov Forward equation, respectively, within an implicit Cartisian Discrete Exterior Calculus (DEC) super-mesh. My algorithm automatically adapts grids and adds local resolutions in regions of the state space where both the value function and the distribution approximation errors remains large. The algorithm is asymptotically convergent guaranteed by the Petrov-Galerkin projection. I demonstrate the power of my approach in applications featuring high-dimensional state spaces, occasionally binding constraints, lifecycle and overlapping generations.

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.