8136 (v.5) Numerical Methods 202
Area: | Department of Mathematics and Statistics |
Credits: | 25.0 |
Contact Hours: | 4.0 |
Lecture: | 1 x 3 Hours Weekly |
Tutorial: | 1 x 1 Hours Weekly |
Prerequisite(s): | 4515 (v.5) Scientific Computing 201 or any previous version
|
Syllabus: | Ordinary differential equations - Taylor series methods, Runge Kutta methods, predictor-corrector methods, stability analysis and two-point boundary-value problems. Eigenvalue problem - power method, similarity transformations, Jacobi's method, Given's method and eigenvalues of tridiagonal matrices. Approximation theory - data fitting, least squares approximation, orthogonal polynomials and approximation using Legendre and Chebyshev polynomials. Iterative methods. |
  |
Unit Outcomes: | On successful completion of this unit, students are expected to be able to design numerical algorithms and computer programs for the solutions of large-scale linear systems of equations by iterative methods, initial value problems, two-point boundary value problems, eigenvalue problems, least squares approximation problems. |
Text and references listed above are for your information only and current as of September 30, 2003. Please check with the unit coordinator for up-to-date information. |
Unit References: | Burden R.L. and Faires J.D., 2001. Numerical Analysis 7th edition Brooks/Cole, Australia, UK, USA. Ellis, T.M.R., Philips I.R. and Lahey T.M. 1995 Fortran 90 Programming, Addison - Wesley Publishing Company, Sydney. Atkinson L.V., Hartley P.J. and HudsonJ.D., 1989. Numerical Methods with Fortran 77 - A practical Introduction, Addison-Wesley. |
Unit Texts: | No prescribed texts |
  |
Unit Assessment Breakdown: | 2 assignments 30%, End of semester two-hour examination 70% |
Year | Location | Period | Internal | Area External | Central External | 2004 | Bentley Campus | Semester 2 | Y | | | |
Current as of: February 2, 2004
CRICOS provider code 00301J