California State University, Northridge
Math 481a. Demo programs and supplementary materials.
2.1 The Bisection method. A naive program. Matlab sample code.
2.1 The Bisection method. Slightly more elaborate program. Matlab sample code.
2.2 The fixed point method. The naive program. Matlab sample code.
2.1 The Bisection method. The naive program applied to
2.2 #6, #7. Matlab sample code.
2.3 Newton's method. The naive program. Matlab sample code.
2.3 The Newton's method as applied to Example 2.3 #2. more elaborate program. Matlab sample code.
2.3 Comparison of Fixed point and Newton's method. Matlab sample code.
2.3 Comparison of Newton's, Secant, and False Position method. Matlab sample code.
2.3 Comparison of Newton's, Secant, and False Position, and Fixed point method. Matlab sample code.
2.6 Finding roots of a polynomial. Method of deflation. Newton's method for finding roots. Matlab sample code.
2.6 Finding roots of a polynomial. The same as above but comments removed to make the code short.
3.0 Plot several taylor polynomials approximating e^x at x=0. Matlab sample code.
3.1 Interpolation by Lagrange's polynomial. Matlab sample code.
3.2 Approximation polynomial by divided differences. Matlab sample code.
3.3 Evaluation of hermite polynomial by the ``divided differences'' method. Matlab sample code.
3.4 Program implementing Natural Spline. Matlab sample code.
4.1 Calculation of the approximation error in two-point finite difference formulas. Matlab sample code.
4.4 Program implementing Composite Simpson Rule. Matlab sample code.
4.4 Program implementing Composite Trapezoidal Rule. Matlab sample code.
4.2 Richardson Extrapolation on the example of Composite Trapezoidal Rule. Matlab sample code.
4.7 Adaptive Quadrature. Matlab sample code.