A modification of scarf's algorithm allowing restarting

Publisher Website
Google Scholar
Abstract
A modification is proposed for Scarf's algorithm for computing fixed points, which allows restarting, and hence overcoming a serious difficulty of this well known algorithm. A particular feature of the new algorithm is that it uses for restarting an idea quite different from the sandwiching procedure of Merrill-Mackinnon, and operates with a non regular grid, in contrast with most other algorithms which use regular grids. From the computational point of view, it is very simple and seems to be quite competitive with other existing methods.

This publication has 5 references indexed in Scilit: