<h3>MA5890  Numerical Linear Algebra</h3>
<br/>
<h4>Course Details</h4>
<b>Description:</b><br>The course will focus on designing algorithms for matrix computations, analysing these algorithms (in terms of complexity, communication costs, stability, performance in finite precision and exact arithmetic), implementation on different computer architectures.<br><br>
<b>CourseContent:</b><br>Floating point arithmetic (1 lecture)<br>Stability of algorithms (2 lectures)<br> conditioning of a problem (2 lectures)<br> perturbation analysis (2 lectures)<br>algorithmic complexity (1 lecture)<br> Matrix decomposition including LU, Cholesky, QR, SVD, etc. (12 lectures)<br> Iterative techniques mainly focussing on Krylov subspace methods including Lanczos, Arnoldi, Conjugate Gradient, GMRES, etc. (12 lectures)<br> Preconditioning (2 lectures)<br> structured matrix computations (4 lectures)<br> designing matrix algorithms on modern computer architectures (3 lectures)<br><br>
<br/>
<h4>Course References:</h4>
TextBooks:<br>1. James W. Demmel, Applied Numerical Linear Algebra, Publisher : Society for Industrial and Applied Mathematics, Year : 1997<br> 2. N. Trefethen & David Bau III, Numerical Linear Algebra, Publisher : Society for Industrial and Applied Mathematics, Year : 1997<br><br>

ReferenceBooks:<br>1. Biswa Nath Datta, Numerical Linear Algebra and applications, 2nd Edition, Publisher : Society for Industrial and Applied Mathematics, Year : 2010<br><br>


Prerequisite: <br>Linear Algebra at undergraduate level