- Homepage
- About the College
- Students
- Taught programmes (UG / PGT)
- Computer Science
- Engineering
- Geology (CSM)
- Mathematics (Exeter)
- Mathematics (Penryn)
- Mining and Minerals Engineering (CSM)
- Physics and Astronomy
- Renewable Energy
- Natural Sciences
- CSM Student and Staff Handbook

- Student Services and Procedures
- Student Support
- Events and Colloquia
- International Students
- Students as Change Agents (SACA)
- Student Staff Liaison Committees (SSLC)
- The Exeter Award
- Peer Support
- Skills Development
- Equality and Diversity
- Athena SWAN
- Outreach
- Living Systems Institute Webpage
- Alumni
- Info points and hubs

- Taught programmes (UG / PGT)
- Staff
- PGR
- Health and Safety
- Computer Support
- National Student Survey (NSS)
- Intranet Help
- College Website

## MTH2005 - Modelling: Theory and Practice (2018)

MODULE TITLE | Modelling: Theory and Practice | CREDIT VALUE | 30 |
---|---|---|---|

MODULE CODE | MTH2005 | MODULE CONVENER | Dr Bob Beare (Coordinator) |

DURATION: TERM | 1 | 2 | 3 |
---|---|---|---|

DURATION: WEEKS | 11 | 11 | 0 |

Number of Students Taking Module (anticipated) | 66 |
---|

The role of the mathematician has changed significantly with the ubiquity and processing power of modern computers. Drawing on the modelling techniques learned in the first year, you will analyse these more closely, understanding the mathematics that underpins them and the extent to which they are appropriate in different situations. You will also work together to develop and analyse your own computer models, including studying the performance of the underlying algorithms and the limits of their predictive power.

Prerequisite modules: MTH1003 and MTH1002 or NSC1002 (Natural Science Students) or equivalent

Corequisite module: MTH2003.

This module explores the use of computers to solve mathematical problems by means of numerical approximation. The techniques discussed form the basis of the numerical simulation and computer modelling of problems in science and business. The key aim is developing an understanding of the numerical algorithms and we will explore these both theoretically and through case studies that develop further the mathematical modelling techniques learned in MTH1003.

On successful completion of this module, **you should be able to:**

**Module Specific Skills and Knowledge:**

1 demonstrate a working knowledge of the theory and practical implementation of basic numerical methods;

2 explore applications and ideas underpinning more advanced methods that are developed in third/fourth stage modules and project work;

3 develop and code your own mathematical models with guidance;

4 interpret the outputs from your models, drawing suitable conclusions from your data;

5 evaluate the effectiveness of your models at explaining and predicting the phenomena you are modelling.

**Discipline Specific Skills and Knowledge:**

6 explore the subject material of the module through diverse applications to areas of science and business;

7 use computation as a natural method for tackling such problems;

**Personal and Key Skills**

8 demonstrate theoretical and practical mathematical skills, including programming.

9 formulate and solve problems independently;

10 communicate computer results and mathematical derivations effectively.

11 work in teams and use a variety of sources to produce reports and other appropriate scientific outputs.

**Root Finding**

Bisection, Newton-Raphson and fixed point convergence. Proofs of convergence and non-convergence. Demonstration of convergence and non-convergence using diagrams.

**Quadrature and Ordinary Differential Equations (ODEs)**

Finite differences, including first and second-order approximations for both the first and second derivative. Timestepping of a first-order ODE using the following methods: forward Euler, leap-frog, Runga-Kutta, Implicit, Adams-Bashforth and Adams-Moulton. Understanding of numerical stability, including identifying the true solution. Analysis of both accuracy and stability of timestepping methods.

**Matrices**

The LU decomposition and Gaussian elimination for matrix inversion. Iterative matrix inversion methods: Jacobi, Gauss-Seidel and Successive Over Relaxation. Analysis of convergence of the iterative methods using: (1) method of norms and (2) Spectral radius. The condition number. Calculating eigenvalues using the power method.

**Partial Differential Equations (PDEs)**

1d diffusion and 1d advection equation as prototypical PDEs. Finite difference methods. Implicitness and possible extensions e.g. semi-lagrangian and montone advection.

Case studies will be developed in a variety of areas of mathematics, science and/or business as part of the coursework, to support and enhance the material formally presented in lectures/tutorials. These case studies might include, for example: optimisation; Fast Fourier Transform; stochastics; modelling of data.

Scheduled Learning & Teaching Activities | 64.00 | Guided Independent Study | 236.00 | Placement / Study Abroad |
---|

Category | Hours of study time | Description |

Scheduled learning and teaching activities | 44 | Lectures |

Scheduled learning and teaching activities | 10 | Practicals in a computer lab |

Scheduled learning and teaching activities | 10 | Tutorials |

Guided independent study | 236 | Lecture and assessment preparation; wider reading |

Form of Assessment | Size of Assessment (e.g. duration/length) | ILOs Assessed | Feedback Method |
---|---|---|---|

Exercise sheets | 5 x 5 hours | All | Discussion in tutorials; model solutions where appropriate. |

Coursework | 70 | Written Exams | 30 | Practical Exams |
---|

Form of Assessment | % of Credit | Size of Assessment (e.g. duration/length) | ILOs Assessed | Feedback Method |
---|---|---|---|---|

Written exam – closed book | 30 | 2 hours | Via SRS | |

Case studies | 2 x 20 | 5000 words or equivalent | Written comments on returned coursework, customized marksheet | |

Project | 30 | 7500 words or equivalent | Written comments on returned coursework, customized marksheet | |

Original Form of Assessment | Form of Re-assessment | ILOs Re-assessed | Time Scale for Re-reassessment |
---|---|---|---|

All above | Written exam (100%) | All | August Ref/Def period |

If a module is normally assessed entirely by coursework, all referred/deferred assessments will normally be by assignment.

If a module is normally assessed by examination or examination plus coursework, referred and deferred assessment will normally be by examination. For referrals, only the examination will count, a mark of 40% being awarded if the examination is passed. For deferrals, candidates will be awarded the higher of the deferred examination mark or the deferred examination mark combined with the original coursework mark.

information that you are expected to consult. Further guidance will be provided by the Module Convener

ELE – http://vle.exeter.ac.uk

Reading list for this module:

Type | Author | Title | Edition | Publisher | Year | ISBN | Search |
---|---|---|---|---|---|---|---|

Set | Gerald C.F. & Wheatley P.O. | Applied Numerical Analysis | 7th | Anderson-Wesley | 2004 | 978-8131717400 | [Library] |

Set | Kharab A. & Guenther R.B. | An Introduction To Numerical Methods: a MATLAB Approach | Chapman & Hall | 2012 | 978-1439868997 | [Library] | |

Set | Adby, P.R. & Dempster, M.A.H | Introduction to Optimization Methods | Chapman & Hall | 1974 | 0-412-11040-7 | [Library] | |

Set | Press, W.H., Flannery, B.P., Teukolsky, S.A. & Vetterling, W.T | Numerical Recipes: the Art of Scientific Computing | 3rd edition | Cambridge University Press | 2007 | 13: 9780521880688 | [Library] |

Extended | Iserles A. | A first course in numerical analysis of differential equations | Cambridge University Press | 1996 | 000-0-521-55376-8 | [Library] | |

Extended | Yang, X-S | Introduction to Computational Mathematics | World Scientific | 2008 | 13-978-981-281-81 | [Library] |

CREDIT VALUE | 30 | ECTS VALUE | 15 |
---|---|---|---|

PRE-REQUISITE MODULES | MTH1002, MTH1003 |
---|---|

CO-REQUISITE MODULES | MTH2003 |

NQF LEVEL (FHEQ) | 5 | AVAILABLE AS DISTANCE LEARNING | No |
---|---|---|---|

ORIGIN DATE | Wednesday 11 January 2017 | LAST REVISION DATE | Thursday 28 February 2019 |

KEY WORDS SEARCH | Numerical analysis; differential equations; optimisation; minimisation; matrices; Gaussian elimination; MATLAB; case studies. |
---|