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:
- Gojko Adzic's Specification by Example: From User Stories to Acceptance Tests (in London on 9th - 10th March 2017)
- Uncle Bob's Advanced TDD (in London on 3rd - 4th April 2017)
- Uncle Bob's Clean Code: Agile Software Craftsmanship (in London on 5th - 7th April 2017)
- Agile Testing & BDD eXchange 2017 (in London on 9th - 10th November 2017)
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.