https://wiki.devclub.in/index.php?action=history&feed=atom&title=COL726 2026-05-27T05:32:04Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=COL726&diff=2940&oldid=prev 2026-04-14T16:26:08Z

<p>Bot: wrap bare course codes in wikilinks</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 16:26, 14 April 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l4">Line 4:</td> <td colspan="2" class="diff-lineno">Line 4:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credits = 4</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credits = 4</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credit_structure = 3-0-2</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credit_structure = 3-0-2</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| pre_requisites = MTL106</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| pre_requisites = <ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL106<ins style="font-weight: bold; text-decoration: none;">]]</ins></div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| overlaps = MTL704</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| overlaps = <ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL704<ins style="font-weight: bold; text-decoration: none;">]]</ins></div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>}}</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>}}</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== COL726 : Numerical Algorithms ==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== COL726 : Numerical Algorithms ==</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>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.</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>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. <ins style="font-weight: bold; text-decoration: none;">[[</ins>COL727<ins style="font-weight: bold; text-decoration: none;">]] </ins>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.</div></td></tr> </table>

DevanshKandpal https://wiki.devclub.in/index.php?title=COL726&diff=575&oldid=prev 2026-03-04T09:59:58Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = COL726<br /> | name = Numerical Algorithms<br /> | credits = 4<br /> | credit_structure = 3-0-2<br /> | pre_requisites = MTL106<br /> | overlaps = MTL704<br /> }}<br /> <br /> == COL726 : Numerical Algorithms ==<br /> 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&#039;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&#039;s Ruin, Polya&#039;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.</div>

Prashantt492