In this lecture, Professor Trefethen first provides an overview of the field of linear algebra and optimization. Secondly, he discusses the question of how fast we can solve Ax=3Db? Thirdly, he discusses sparse matrices
don't worry if you don't have an account with us, we'll create one
[{"meta":{"author":"Scientific Computing for DPhil Students","authorlink":""},"src":"http:\/\/media.podcasts.ox.ac.uk\/maths\/sci-comp\/2015-10-13-MT_scientific_computing_lecture_01.mp4","thumb":{"src":"https:\/\/images.lystnfm.com\/tr:n-app_thumbnail_medium\/podcastsnw-202311\/79a88e-b044-50ac-d93868_800.jpg"},"title":"Sparse Matrices and Iterative Methods (1.1)","link":"javascript:;","id":"item-135778"}]
