Math 5610 Numerical Analysis I announcements - Fall 20112012-01-07T22:58:32+01:00Fernando Guevara Vasquezfguevara@math.utah.eduhttp://www.math.utah.edu/~fguevara/math5610_f11/Gradestag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-12-16, 07:26AM:13240167922011-12-16T07:26:32+01:00<ul>
<li>Your final exam, project and final grade for the class have been sent to you via email. Graded papers may be picked up during my office hours in the Spring (MTW 2-3pm) or in Math 5620.</li>
<li>Some histograms<br />
<code>
Letter grade Final exam grade
A :***** 110:***
A-:***** 100:******
B+:*** 90:***
B :**** 80:
B-:*** 70:***
C+:* 60:*
C :* 50:*
40:**
30:**
</code></li>
</ul>Practice Final Solutiontag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-12-08, 06:39PM:13233659992011-12-08T18:39:59+01:00<ul>
<li>The practice final solution is here: <a href="./final_practice_sol.pdf">final_practice_sol.pdf</a></li>
<li>The solutions to <strong>HW7</strong> are here: <a href="./hw07_sol.pdf">hw07_sol.pdf</a></li>
</ul>Practice Finaltag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-12-03, 07:22PM:13229365792011-12-03T19:22:59+01:00<ul>
<li>Here is a practice final: <a href="practice_final.pdf">practice_final.pdf</a>. It is longer and more difficult than the actual final and contains typical problems. We will solve this together on the <em>Wed</em> and <em>Thu</em> lectures.</li>
</ul>Finaltag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-12-03, 12:00AM:13228668092011-12-03T00:00:09+01:00<ul>
<li><strong>HW6</strong> solutions are here: <a href="./hw06_sol.pdf">hw06_sol.pdf</a>.</li>
<li>A review sheet for the final is here: <a href="./final_study_sheet.pdf">final_study_sheet.pdf</a>. Please look at it and bring questions or areas you want to review for the <em>Mon</em> and <em>Tue</em> lectures.</li>
<li>The <em>Wed</em> and <em>Thu</em> lectures will be devoted to solving a practice final (which will be posted soon).</li>
<li>As a friendly reminder:
<ul>
<li>The <strong>final</strong> is on <em>Wed Dec 14</em> 10:30am-12:30pm in our usual classroom (JTB 130).</li>
<li>The exam starts at 10:30am sharp. No extra time will be given if you come late, so plan to come at least 5 minutes early.</li>
<li>The exam is closed book and no calculators are allowed (or needed). No notes are allowed except for the equivalent of two letter sized, single sided, handwritten cheat sheets.</li>
</ul></li>
</ul>Homework 7tag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-11-29, 08:02AM:13225501372011-11-29T08:02:17+01:00<ul>
<li><strong>Homework 7</strong> is due on <em>Tue Dec 6</em> and is here: <a href="./hw07.pdf">hw07.pdf</a>. The accompanying stubs are: <a href="./mylu.m">mylu.m</a> and <a href="./test_mylu.m">test_mylu.m</a>.</li>
</ul>Last two weeks of classestag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-11-26, 06:19AM:13222847632011-11-26T06:19:23+01:00<ul>
<li>Here are the FFT demos we did in class: <a href="./sounddemo.m">sounddemo.m</a> (shows how to filter a sound signal using the FFT) and <a href="./imdemo.m">imdemo.m</a> (gives the rough idea behind lossy compression as used in e.g. JPEG). These demos will not run unmodified in Octave. You need at least to provide your own sound or image samples to work with.</li>
<li>This week we started looking at direct methods for solving linear systems (Chap 6). The notes for this week and next week are here: <a href="./math5610_013.pdf">math5610_013.pdf</a> and <a href="./math5610_014.pdf">math5610_014.pdf</a>.</li>
<li>Here is tentatively what to expect for the last two weeks of classes:
<ul>
<li>Finish chapter 6 (LU, Cholesky, sparse systems)</li>
<li><strong>HW7</strong> will be posted on Mon 11/28 and due in a week. It will cover Chap 6.</li>
<li>A practice final and review sheet will be posted in the next week of classes</li>
<li>In the last week of classes expect:
<ul>
<li>1-2 lectures for solving practice final exam</li>
<li>1-2 review lectures</li>
</ul></li>
</ul></li>
</ul>Fast Fourier Transformtag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-11-17, 10:31PM:13215654952011-11-17T22:31:35+01:00<ul>
<li>Here are the class notes for the Fast Fourier Transform: <a href="./math5610_012.pdf">math5610_012.pdf</a>.</li>
<li>Here is a recursive (and not very efficient) implementation of the FFT: <a href="./myfft.m">myfft.m</a> and a test against Matlab’s FFT: <a href="./test_myfft.m">test_myfft.m</a>.</li>
</ul>Homework 6tag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-11-15, 08:37AM:13213426642011-11-15T08:37:44+01:00<ul>
<li><strong>HW6</strong> is due on <em>Wed Nov 23</em> and is available here: <a href="./hw06.pdf">hw06.pdf</a>. The sample code is here: <a href="./hw6/prob1_sample.m">prob1_sample.m</a></li>
</ul>Class Notes - Chapter 8tag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-11-15, 12:28AM:13213133282011-11-15T00:28:48+01:00<ul>
<li>Here are the class notes for last week and also for this week: <a href="./math5610_009.pdf">math5610_009.pdf</a> (Romberg integration, adaptive Simpson integration), <a href="./math5610_010.pdf">math5610_010.pdf</a> (linear algebra preliminaries) and <a href="./math5610_011.pdf">math5610_011.pdf</a> (Chapter 8: Approximation theory. Includes discrete least squares, best approximation theory, Chebyshev polynomials, Fourier series)</li>
<li><strong>Note</strong>: The page numbers in red take precedence over the handwritten ones.</li>
</ul>Groups for project and Math 5620tag:http://www.math.utah.edu/~fguevara/math5610_f11,2011-11-04, 10:19PM:13204415772011-11-04T22:19:37+01:00<ul>
<li>The <strong>second part</strong> of this class is <strong>Math 5620</strong> which is offered in the Spring 2012 MTWF 10:45-11:35am (see <a href="http://www.math.utah.edu/schedule/spring12/">the Math course schedules</a>). The instructor will be myself and we will use the same textbook as in Math 5610.
<ul>
<li>The program until the end of the year for <strong>Math 5610</strong> is: Ch 6-7 (solving linear systems), Ch 8 (Approximation theory, least squares).</li>
<li>The program for <strong>Math 5620</strong> is roughly: Ch 9 (eigenvalue algorithms), Ch 5 (ODEs, initial value problems), Ch 11 (Boundary value problems), Ch 12 (Finite differences and Finite elements)</li>
</ul></li>
<li><strong>Reminder</strong>: You need to send me your choice of group and project by Nov 7. If you have not found a group there are two options:
<ul>
<li>If you are comfortable working by yourself in one of the projects and you are confident you can finish it, you can do the project by yourself. You <strong>need to tell me about this</strong>.</li>
<li>If you prefer working in a group, <strong>email me</strong> your project preference and I will assign you to work with someone else that does not have a group.</li>
</ul></li>
</ul>