Basic Interval Newton, parallel scan, caches and pipelining

During the past week Adam has been focusing on course work for the three courses he is attending. This included finishing the implementation of parallel scan for the Heterogeneous Parallel Computing Coursera course, reading about caches and pipelining for the Embedded Parallel Computing course at HH, and pushing the implementation of the interval arithmetic library forward for the Chalmers Scala course. In the latter, work has been focusing on a basic implementation of Interval Netwon's method for finding the zeros of real functions has been implemented (univariate case), backed by a Scala code generator. Once Interval Newton has been implemented using the library, the major remaining part of this work is the development of a code generator for either CUDA or OpenCL.