Solving the Incomplete Markets Model in Parallel Using GPU Computing and the Krusell–Smith Algorithm

Michael Hatcher and Eric Scheffel

Computational Economics, 2016, vol. 48, issue 4, No 2, 569-591

Abstract: Abstract This paper demonstrates the potential of graphics processing units in solving the incomplete markets model in parallel using the Krusell–Smith algorithm. We illustrate the power of this approach using the same exercise as in Den Haan et al. (J Econ Dyn Control 34:1–3, 2010). We document a speed gain which increases sharply with the number of agents. To reduce entry barriers, we explain our methodology and provide some example algorithms.

Keywords: GPU computing; Heterogeneous agents; Incomplete markets; Interpolation; Krusell–Smith algorithm (search for similar items in EconPapers)
JEL-codes: C6 C63 D52 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10614-015-9537-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:compec:v:48:y:2016:i:4:d:10.1007_s10614-015-9537-0

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/10614/PS2

DOI: 10.1007/s10614-015-9537-0

Access Statistics for this article

Computational Economics is currently edited by Hans Amman

More articles in Computational Economics from Springer, Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().