|
An Applied Mathematician's Apology by Nick Trefethen[1] has a chapter (a couple of pages) titled "Cleve Moler and Matlab". > I first met Cleve Moler when I was a graduate student and he visited Stanford, where his loud and friendly voice reverberated around Serra House. Moler is the antithesis of a European, and as a transatlantic soul, I love both Europeans and their antitheses. A room with Moler in it is a no-nonsense zone. He has no interest in showing you how your problem is connected with the theory of pseudodifferential operators. He just wants to get things done computationally, and nobody has done it better. Moler is about the same age as Knuth, and while Knuth was writing his great books on the analysis of discrete algorithms, Moler was creating the modern era of numerical software. He was an author of both of the foundational software packages of the 1970s, EISPACK and LINPACK, and he also published two influential software-based numerical analysis textbooks. And then, in around 1977 in the Computer Science department at the University of New Mexico, he invented Matlab, which changed the world. I never liked using Matlab (the little I used it), but after reading this I understood better what its innovation was: “All the right algorithms would be invoked in all the right places, without the user needing to know the details.” A footnote I found interesting: > For me `eig(A)` epitomizes the successful contribution of numerical analysis to our technological world. Physicists, chemists, engineers, and mathematicians know that computing eigenvalues of matrices is a solved problem. Simply invoke `eig(A)`, or its equivalent in whatever language you are using, and you tap into the work of generations of numerical analysts. The algorithm involved, the QR algorithm, is completely reliable, utterly nonobvious, and amazingly fast. On my laptop, for a 1000 × 1000 matrix A, `eig(A)` computes all 1000 eigenvalues in half a second. [1]: https://sites.math.rutgers.edu/~zeilberg/akherim/NickApology... |