Dette er en gammel utgave av dokumentet!


Activity

Activity

Week Dates Theme Cheney & Kincaid Extra Material
2 11.01 Root Finding: Newton and Bisection Methods 3.1, 3.2
3 17.01 18.01 Root Finding: refinement of Newton's Method, Newton's method in 2D, Floating Point Numbers, Introduction to for loops 3.2, 2.1
4 24.01 25.01 Floating Point Numbers, Lagrange Interpolation 2.1, 2.2, 4.1
5 31.01 01.02 Neville's algorithm, Newton's divided difference 4.1
6 07.02 08.02 Programming: functions and lists; interpolation error; Chebyschev points 4.2
7 14.02 15.02 Chebyshev Optimality, Implementation of Neville's algorithm; Discrete Differentiation, Richardson Extrapolation 4.2, 4.3
8 21.02 22.02 Taylor Theorem, Richardson Extrapolation, Linear Systems 1.2, 7.1, 7.2
9 28.02 29.02 Gaussian Elimination 7.1, 7.2
10 06.03 07.03 Condition Number, Elimination with Pivoting, Least Square Problems, Iterative Methods 7.2, 8.1, 8.2
11 13.03 14.03 Determinant vs Condition number, Finding Roots of Polynomials, Numerical Integration 5.1, 5.2, 5.3, 6.1, 6.2
12 20.03 21.03 Numerical Integration, Discrete Fourier Transform 5.1, 5.2, 5.3, 6.1, 6.2
13 27.03 28.03 Fast Fourier Transform FFT Notes
15 11.04 Fast Fourier Transform, Differential Equations 10 FFT Notes
16 17.04 18.04 Differential Equations, Revisions 10
17 24.04 Revisions
2012-05-21, Olivier Philippe Paul Verdier