The paper presents a method for the recursive computation of models with a continuum of heterogeneous agents. Following the literature, it is assumed that the cross-sectional distribution of wealth in the economy can be represented, to a sufficient degree of accuracy, by a finite number of summary statistics. The main innovation of the method is a very flexible representation of the cross-secti...

The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache con icts cause traditional columnmajor or row-major array layouts to incur high variability in memory system performance as matrix size varies. This paper investigates the use of recursive array layouts to improve performance and reduce vari...

Many of us who teach calculus and mathematical topics that use calculus have taken for granted that hand-held calculators use Taylor series or a variant to compute transcendental functions. Thus, it was a surprise to learn that this was not the case. The CORDIC method (Coordinate Rotation Digital Computer) was developed by Jack Volder [6] in the late 1950’s. Hewlett-Packard was quick to realize...

This document presents a performance comparison between the perdomain path computation method and the Path Computation Element (PCE) Architecture based Backward Recursive Path Computation (BRPC) procedure. Metrics to capture the significant performance aspects are identified and detailed simulations are carried out on realistic scenarios. A performance analysis for each of the path computation ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines with oracles). Relativizations of several results of complexity theory are carried out. A recursive relatedness theorem is proved, showing that any two relative complexity measures are related by a f...

1 The primitive recursive functions 1.1 Intuitive syntax and semantics In informal mathematical notation we often define the addition function in the following way: 0 + n = n m + n = (m + n) We have used the notation m for the successor of the number m. In a functional language we can use a similar definition: add 0 n = n add (s m) n = s (add m n) We know that this is a meaningful definition si...

The relative convex hull, or the minimum-perimeter polygon (MPP) of a simple polygon A, contained in a second polygon B, is a unique polygon in the set of nested polygons between A and B. The computation of the minimum-length polygon (MLP), as a special case for isothetic polygons A and B, is useful for various applications in image analysis and robotics. The paper discusses the first recursive...

In today’s Web and social network environments, query workloads include ad hoc and OLAP queries, as well as iterative algorithms that analyze data relationships (e.g., link analysis, clustering, learning). Modern DBMSs support ad hoc and OLAP queries, but most are not robust enough to scale to large clusters. Conversely, “cloud” platforms like MapReduce execute chains of batch tasks across clus...

This document presents a performance comparison between the perdomain path computation method and the Path Computation Element (PCE) Architecture based Backward Recursive Path Computation (BRPC) procedure. Metrics to capture the significant performance aspects are identified and detailed simulations are carried out on realistic scenarios. A performance analysis for each of the path computation ...