Earlier this week I had a discussion about the running time of an algorithm used to test a method. This got me thinking about one of my favourite areas of computer science - computational complexity. We can use complexity theory to split problems into classes. Understanding some of these classes can help us to recognise when … Continue reading Stop trying to solve hard problems!
As part of a placement earlier this year, I was given two sets of functions to play with. The first set was implemented in both MATLAB and FORTRAN and formed a root-finding algorithm. The second was implemented in only MATLAB but promised shorter running times and greater accuracy. The task was to compare the two … Continue reading A perfect matching of complex roots