First steps in OpenCL and a bisecting root finder

During the past week Adam has been focusing on the Embedded Parallel Computing course, which introduced vector machines and the related GPU architectures. As part of this course, Adam is re-implementing some of the laboratory exercises which were part of the Heterogeneous Parallel Computing Coursera course, but now in OpenCL instead of CUDA. Kevin helped Adam in modularising the vector addition host code as a C++ class, making it easier to re-use in subsequent implementations. Work on the interval arithmetic library for the Chalmers Scala course is also moving forward. With the help of Jan he wrapped a bisection algorithm around the basic Interval Newton algorithm to complete the validated root finding algorithm, all implemented on top of the library.