This lecture takes the audience from a tiny numerically-robust implementation of a common linear algebra algorithm through several stages of optimization, culminating in a high-performance solution that easily outperforms Intel’s Math Kernel Library.
YOU MAY ALSO LIKE:
- Conway's Law & Reverse Conway's Law - How to avoid being caught by it and how to turn it to your advantage (in London on 23rd September 2015)
- Fast Track to F# with Tomas Petricek & Phil Trelford (in London on 15th - 16th October 2015)
- µCon 2015: The Microservices Conference (in London on 9th - 10th November 2015)
Dr Jon Harrop BA MA MSci PhD (Cantab) managing director and cofounder, worked as a graphic design artist and computer programmer in industry from 1992 before earning four degrees in the physical sciences from the University of Cambridge. Jon is the primary author of The F#.NET Journal articles (2007-2010) and books such as OCaml for Scientists (2005), F# for Scientists (2007), Visual F# 2010 for Technical Computing (2009) and the forthcoming Multicore .NET as well as a coauthor of New Intelligent Printing Techniques (1995), Smart Cards in Transport (1997), The Future of Chipless Smart Labels (2002) and dozens of other books.