Computational Mathematics

Subject 620-381 (2008)

Note: This is an archived Handbook entry from 2008.Search for this in the current handbookSearch for this in the current handbook

Credit Points: 12.500
Level: Undergraduate
Dates & Locations:

This subject has the following teaching availabilities in 2008:

Semester 1, - Taught on campus.
Pre-teaching Period Start not applicable
Teaching Period not applicable
Assessment Period End not applicable
Last date to Self-Enrol not applicable
Census Date not applicable
Last date to Withdraw without fail not applicable

Timetable can be viewed here. For information about these dates, click here.
Time Commitment: Contact Hours: 24 lectures (two per week), 12 computer laboratory classes (one per week) and 60 hours of project work
Total Time Commitment: 120 hours
Prerequisites: Any one of [07]620-122, [08]620-142, [05]620-192, [05]620-194, [07]620-211; together with one of [07]620-113, [07]620-123, [08]620-143, [05]620-193; and one of computer science [07]433-171 or [07]433-151 or [07]620-131 or other evidence of competence in C, C++, Fortran, Pascal, or similar languages.
Corequisites: None
Recommended Background Knowledge: None
Non Allowed Subjects: None
Core Participation Requirements: It is University policy to take all reasonable steps to minimise the impact of disability upon academic study and reasonable steps will be made to enhance a student's participation in the University's programs. Students who feel their disability may impact upon their active and safe participation in a subject are encouraged to discuss this with the relevant subject coordinator and the Disability Liaison Unit.


Dr S Carnie
Subject Overview:

This subject introduces the underlying basis for numerical techniques to solve a variety of problems; and the role of various kinds of numerical error and how algorithms are designed to minimise this error; and develops basic algorithms in the areas of root-finding, linear systems, interpolation, quadrature and solution of differential equations. Students should acquire skills in implementing the above algorithms in well-constructed computer programs and interpreting the results obtained from the programs. This subject demonstrates the difficulties and possible pitfalls in numerical computation. It also shows where to find sources of reliable numerical software.

Topics include errors, roundoff, truncation error and stability; root-finding, iteration, bisection, Newton's method and secant method; linear systems, Gauss elimination, pivoting, LU factorisation, tridiagonal systems, condition number; interpolation, polynomial and spline; data fitting and least squares methods; quadrature, Newton-Cotes, Gaussian quadrature, adaptive quadrature and improper integrals; and differential equations and initial value problems: Euler, Runge-Kutta, predictor-corrector and stiff problems.

Assessment: Computational assignments of up to 75 pages in total due during the semester (50%); a 2-hour written examination in the examination period (50%).
Prescribed Texts: None
Breadth Options: This subject is a level 2 or level 3 subject and is not available to new generation degree students as a breadth option in 2008.
This subject or an equivalent will be available as breadth in the future.
Breadth subjects are currently being developed and these existing subject details can be used as guide to the type of options that might be available.
2009 subjects to be offered as breadth will be finalised before re-enrolment for 2009 starts in early October.
Fees Information: Subject EFTSL, Level, Discipline & Census Date
Notes: This subject is available for science credit to students enrolled in the BSc (pre-2008 degree only), BASc or a combined BSc course.
Related Course(s): Bachelor of Arts
Bachelor of Arts and Bachelor of Science
Bachelor of Arts and Sciences
Bachelor of Science

Download PDF version.