Jump to content

COL726

From IITD Wiki
Revision as of 09:59, 4 March 2026 by Prashantt492 (talk | contribs) (Creating course page via bot)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
COL726
Numerical Algorithms
Credits 4
Structure 3-0-2
Pre-requisites MTL106
Overlaps MTL704

COL726 : Numerical Algorithms

[edit]

Number representation, fundamentals of error analysis, conditioning, stability, polynomials and root finding, interpolation, singular value decomposition and its applications, QR factorization, condition number, least squares and regression, Gaussian elimination, eigenvalue computations and applications, iterative methods, linear programming, elements of convex optimization including steepest descent, conjugate gradient, Newton's method. COL727 Rapid Mixing in Markov Chains Credits: 3 (3-0-0) Basic of finite Markov chains; classical Markov Chains including Coupon collection, Gambler's Ruin, Polya's um, Birth and Death chains; Total Variation Distance; the Convergence Theorem; Mixing Time; bounding mixing time via couplings; bounding mixing time via strong stationary times; random walks on networks; bounding mixing time via hitting times; cover times; spectral bounds on mixing time; mixing time bounds via comparison between chains.