next up previous contents
Next: Data Structures and Algorithms Up: Michaelmas Term 2003: Part Previous: Concurrent Systems and Applications   Contents


Continuous Mathematics

Lecturer: Dr R.J. Gibbens

No. of lectures: 4

This course is a prerequisite for Computer Graphics and Image Processing, Artificial Intelligence I, Computer Vision (Part II), Information Theory and Coding (Part II), Quantum Computing (Part II), Digital Signal Processing (Part II).


Aims


The aims of this course are to review some key concepts and operations defined in continuous mathematics involving real and complex-valued functions. Focus is on the use and implementation of these notions as encountered in computer science.


Lectures

Objectives


At the end of the course students should

Reference books


* Oppenheim, A.V. & Willsky, A.S. (1997). Signals and systems. Prentice-Hall.
Pinkus, A. & Zafrany, S. (1997). Fourier series and integral transforms. Cambridge University Press.
Stephenson, G. (1973). Mathematical methods for science students. Addison Wesley Longman.



next up previous contents
Next: Data Structures and Algorithms Up: Michaelmas Term 2003: Part Previous: Concurrent Systems and Applications   Contents
Christine Northeast
Thu Sep 4 15:29:01 BST 2003