Julia Computing (with some random matrices)

Speaker: 
Alan Edelman, Massachusetts Institute of Technology
Date: 
Feb 8 2016 - 4:30pm
Event type: 
PACM Colloquium
Room: 
Fine 214
Abstract: 

This talk is designed to be of interest for a computer science and mathematics audience, I will combine my two “passions” by  (1)  Explaining why the Julia Computing language is so fast.  Julia in some ways resembles Python, or R, or MATLAB, which makes Julia easy to use, but Julia is deeply architected very differently from these earlier languages, making Julia's modern approach  fast, flexible, and productive.  Julia is being used worldwide by scientists, engineers, in classes,  and in industry for big data, financial applications, and the internet of things. (2) Showing how Julia has enabled research in one of my own favorite topics: random matrices.  We will demonstrate several results that quantify and illuminate finite random matrix theory.