We propose the relaxation algorithm as a simple and powerful method for simulating the transition process in growth models. This method has a number of important advantages: (1) It can easily deal with a wide range of dynamic systems including multi-dimensional systems with stable eigenvalues...

We propose the relaxation algorithm as a simple and powerful method for simulating the transition process in growth models. This method has a number of important advantages: (1) It can easily deal with a wide range of dynamic systems including multi-dimensional systems with stable eigenvalues...

Growth models often give rise to saddle-point stable dynamic systems with multi-dimensional stable manifolds. It is argued that standard solution procedures used to numerically approximate the transition process are generally inadequate when the (stable) eigenvalues differ substantially in...

In this paper we describe a Sequential Importance Sampling (SIS) procedure for counting the number of vertex covers in general graphs. The performance of SIS depends heavily on how close the SIS proposal distribution is to a uniform one over a suitably restricted set. The proposed algorithm...

This chapter provides an overview of solution and estimation techniques for dynamic stochastic general equilibrium models. We cover the foundations of numerical approximation techniques as well as statistical inference and survey the latest developments in the field.

We compare three alternative Maximum Likelihood Multidimensional Scaling methods for pairwise dissimilarity ratings, namely MULTISCALE, MAXSCAL, and gurations very well. The recovery of the true dimensionality depends on the test criterion (likelihood ratio test, AIC, or CAIC), as well as on the...

We propose the relaxation algorithm as a simple and powerful method for simulating the transition process in growth models. This method has a number of important advantages: (1) It can easily deal with a wide range of dynamic systems including stiff differential equations and systems giving rise...

We propose the relaxation algorithm as a simple and powerful method for simulating the transition process in growth models. This method has a number of important advantages: (1) It can easily deal with a wide range of dynamic systems including multi-dimensional systems with stable eigenvalues...

Estimation and modelling problems as they arise in many fields often turn out to be intractable by standard numerical methods. One way to deal with such a situation consists in simplifying models and procedures. However, the solutions to these simplified problems might not be satisfying. A...