Summary:

This course introduces basic concepts and methods of scientific and engineering computing and mathematical modeling and discusses general-purpose numerical methods for solving a variety of problems in science and engineering.

Prerequisites:

Ability to program in a low- or mid-level computer language such as FORTRAN, C, C++, MAPLE, MATHEMATICA, or MATLAB, knowledge of linear algebra, and familiarity with matrix, differential, and integral calculus. Grade of C- or better in MAE 9 or 10 is required.

Topics:

The course will cover the following main topics with applications in engineering modeling and design:
  1. Overview of scientific computing and computer programming.
  2. Introduction to numerical linear algebra and matrix calculus.
  3. Linear algebraic systems.
  4. Nonlinear algebraic systems.
  5. Function interpolation.
  6. Numerical differentiation.
  7. Numerical integration.
  8. Function approximation and data regression.
  9. Numerical solution of ordinary differential equations.

Instructor:

C. Pozrikidis, 2209 EBU1 (cpozrikidis@ucsd.edu)

Teaching Assistants:

TBA

Lectures:

10:00-10:50, Mon, Wed, Fri, PCYNH 109

Discussion and problem session:

12:00-12:50, Wed, Peterson Hall

Office hours:

  1. C. Pozrikidis, Mon, Wed, Fri, 11:00-12:00 in 2209 EBU1, and by appointment.
  2. TA1 Tuesdays, 11:15-12:15, Room 305, EBU2
  3. TA2 Thursdays, 3:30-4:45 in 312 EBU2 (across from the MAE 3 lab)

Textbook:

This course will cover selected topics from the first nine chapters of the book:

Pozrikidis, C. 1998 Numerical Computation in Science and Engineering. Oxford University Press.

An errata is posted and updated regularly at the book web site. Please make a note of typographical and other errors.

A library of FORTRAN programs accompanies the text (please scroll down on the right). Please take a moment to familiarize yourselves with the contents on this site. Feel free to use these programs for the purposes of this course, including solving the problems assigned as homework.

General information:

Five problem sets involving a combination of theoretical and programming projects will be assigned and will be due every two weeks at the beginning of the Wednesday discussion section.

Unless specified otherwise, a solution can be done either by hand or by computer. Part of your training in this class is to develop insight into which way is more appropriate.

Please observe the following guidelines:

  1. Any computer or scripting language is acceptable. However, the use of scripting languages and applications such as MAPLE, MATLAB, MATHEMATICA, and EXCEL is acceptable only at the level a medium-level language such as Fortran, C, or C++, or else for the purposes of plotting and verification.
  2. Any computer facility is acceptable including campus and personal computers.
  3. The source code and output of the computer problems should be turned in on hard copies accompanied by a discussion. The programs should contain ample commentary and explanation of symbols and procecudes.
  4. Special attention should be paid to clarity of presentation and interpretation. Numerical data should be presented in the form of professionally formated output.
  5. Please make sure that your homework solutions are not messy or disorganized. Do not use exponential fields, except for very large or very small numbers.
  6. Plots on many pages: use subplot or plot on same graph using colors or symbols to differentiate. Plots with no legend or not clearly labeled axes are unaccepable.
  7. For those problems done by hand, all intermediate steps must be shown.
  8. Elegance should go hand-in-hand with clarity and efficiency. Do nor turn in problems out of order or problems split up into two areas. All solutions must be stapled.

Study the posted homework solutions even if your own are perfect.

Course grade and exams:

The final course grade will be based on the homework problem solutions (40%), two mid-term exams (15% each), and the final exam (30%).
  1. Homework:

    While discussion of the homework problems is allowed, cooperation is strictly prohibited. When you sit down to write the problem solutions and programs you should be alone. Each student is expected to write his/her own computer programs and produce her/his own solutions. Duplicate solutions and slightly different computer codes will be discarded with no regard to original authorship. If one problem of a homework set is found to be duplicate, the whole set will be given zero credit.

  2. Exams:

    The mid-term and final exams will be open-book and open-notes. The exams will cover material discussed in the classroom, which may not necessarily be included in the textbook. The use of a laptop computer is strictly prohibited. A programmable calculator can only be used for additions, multiplications, and divisions. Make sure to bring the class notes, a calculator, and scratch paper. If you missed a lecture, make sure that you obtain a copy of the lecture notes.

  3. The exams will be cumulative. Thus, the final exam will cover the material discussed throughout the course.

Course plan, reading and problem assignment:

Reading
assignment * 		Problem
assignment ** 		Lecture plan
Week 1: Fri Sept 22 Sections 1.1-1.4 First, due on Oct 04
Week 2: Mon Sept 25 IP address
Wed Sept 27
Fri Sept 29
Week 3: Mon Oct 2
Wed Oct 4 Second, due on Oct 18
Fri Oct 6
Week 4: Mon Oct 9 Review session
Wed Oct 11 First mid-term exam
Fri Oct 13
Week 5: Mon Oct 16
Wed Oct 18 Third, due on Nov 01
Fri Oct 20
Week 6: Mon Oct 23
Wed Oct 25
Fri Oct 27
Week 7: Mon Oct 30
Wed Nov 1 Fourth, due on Nov 15
Fri Nov 3
Week 8: Mon Nov 6
Week 9:
Fri Nov 10 University holiday
Week 9: Mon Nov 13
Wed Nov 15 Fifth, due on Nov 29 Review session
Fri Nov 17 Second mid-term exam
Week 10: Mon Nov 20
Wed Nov 22
Fri Nov 24 University holiday
Week 11: Mon Nov 27
Wed Nov 29 Review Session
Fri Dec 01 Review Session
Week 12: Final Exam

* Sections and page (pp) numbers refer to the class textbook
** Due at the beginning of the Wednesday discussion session

Books on reserve:

The following books have been placed on reserve at the Science and Engineering library:
  1. Pozrikidis, C. 1998 Numerical Computation in Science and Engineering. Oxford University Press.
  2. Gerald, C. F. & Wheatley, P. O. 2004 Applied Numerical Analysis. Seventh Edition, Addison Wesley.

References:

  1. Burden, R. L. & Faires, J. D. 1993, Numerical Analysis, ITP/PWS.
  2. Press, W. H., Flannery, B. P., Teukolsky, S. A., Vetterling, W. T., 1992 Numerical Recipes in X, Second Edition, Cambridge University Press.
  3. Atkinson, K. E. 1989 An Introduction to Numerical Analysis, Wiley.
Further references are given at the end of each Chapter of the textbook.

Class messages

(in reverse chronological order)

Please pay attention to the following class policy:

Duplicate solutions and slightly different computer codes will be discarded with no regard to original authorship. If one problem of a homework set is found to be duplicate, the whole set will be given zero credit. If you cannot find your graded homework, this means that it was kept as a duplicate solution.