Handbook 1996 : Faculty of Science (Volume 4 page 211)
Mathematics subject : Next:618-251 | Prev:618-232 | Search | Help
618-242 "Computational Mathematics" appears differently in several places - choose the one you want:
1. Mathematics, Faculty of Science (v4, p211) : Next:618-251 | Prev:618-232
Credit points: 12.0
Coordinator: Dr N Wormald
Prerequisite: One of Mathematics 618-102 (1995 Handbook), 112, 122, 200, 211; and either Computer Science 433-141 and 433-142, or one of 617-141, 617-142, 617-160 (1995 Handbook).
Contact: 18 lectures and 56 hours project work.
Timetable: Second semester.
Objectives:
On completion of this subject, students should:Comprehend:
- the underlying basis for numerical techniques to solve a variety of problems;
- the solution of linear equations by Gaussian elimination and LU factorization; polynomial interpolation and approximation of functions by polynomials;
- methods of solution of differential equations;
- numerical evaluation of integrals.
Have developed:
- skills in implementing the techniques referred to above, and in interpreting results obtained by computer programs.
Appreciate:
- the difficulties and possible pitfalls of numerical computation and of broad spectrum numerical analysis algorithms.
Content:
Linear equations: matrix norm, scaling, pivoting, stability, iterative methods, tri-diagonal systems. Function approximation: minimax, least squares, orthogonal polynomials, cubic splines; finite differences; interpolation, differentiation, integration. Ordinary differential equations: initial value problems; boundary value problems; numerical integration, asymptotic error formula; Runge-Kutta procedures.
Assessment:
A 1.5-hour end-of-semester written examination and project work as required.
1. Mathematics, Faculty of Science (v4, p211) : Next:618-251 | Prev:618-232
2. Math. & Stats., Faculty of Educ(Parkville) (v5, p147) : Next:618-251 | Prev:618-232
Credit points: 12.0
Coordinator: Dr N Wormald.
Prerequisite: One of Mathematics 618-102 (1995 Handbook), 112, 122, 200, 211; and either Computer Science 433-141 and 433-142, or one of 617-141, 617-142, 617-160 (1995 Handbook).
Contact: 18 lectures and 56 hours project work
Timetable: Second semester.
Objectives:
On completion of this subject, students should:Comprehend:
- the underlying basis for numerical techniques to solve a variety of problems;
- the solution of linear equations by Gaussian elimination and LU factorization; polynomial interpolation and approximation of functions by polynomials;
- methods of solution of differential equations;
- numerical evaluation of integrals.
Have developed:
- skills in implementing the techniques referred to above, and in interpreting results obtained by computer programs.
Appreciate:
- the difficulties and possible pitfalls of numerical computation and of broad spectrum numerical analysis algorithms.
Content:
Linear equations Matrix norm, scaling, pivoting, stability, iterative methods, tri-diagonal systems. Function approximation Minimax, least squares, orthogonal polynomials, cubic splines; finite differences; interpolation, differentiation, integration. Ordinary differential equations Initial value problems; boundary value problems; numerical integration, asymptotic error formula; Runge-Kutta procedures.
Assessment:
A 1.5-hour end-of-semester written examination and project work as required.
* Note that CONTENT differs from the maintainer's version above. A log of variations is available.
2. Math. & Stats., Faculty of Educ(Parkville) (v5, p147) : Next:618-251 | Prev:618-232
Status: Official 1996 Date created: Oct 9 1995 Last modified: Oct 9 1995 Authorised by: Academic Registrar Email enquiries: Course_Information@registrar.unimelb.edu.au
Maintained by: Dept. of Mathematics, Faculty of Science.
Copyright © University of Melbourne 1995,1996.