Given a mathematical problem,
0. Have an idea of whether it is well posed and how to redefine it if not,
of whether it should have solutions and how many,
and have a feeling of how these solutions should behave.
Know how to find information about the problem or a similar one if it seems basic enough, in order not to reinvent the wheel.
This is more of a prerequisite for the course,
and it will not really be possible to teach this at class due to time constraints,
at least not explicitly. However, certainly some experience should be gained
in this respect by performing the course work. |
|
|
|
1. Identify the family of numerical algorithms to apply,
and the pros and cons of each particular method therein.
Understand the nature of the solution(s) they can provide,
in particular their accuracy, depending on the method. |
|
|
|
2. Be able to implement a particular numerical method
in the form of a COMPUTER PROGRAM (CORE OBJECTIVE).
Correctness, accuracy, efficiency, usability and generality
of the program are more detailed objectives, in order of importance.
Note that the ability to program a numerical algorithm is an
objective of the course, whereas the ABILITY TO PROGRAM at all is a PREREQUISITE.
Again, due to time constraints, it won't be possible to teach students to
program or programm in a particular language formally.
However, there will be a lot of "learning by doing" in this area,
as programming a numerical algorithm is programming after all.
Some time at class will be devoted to discuss how to programm
each algorithm, and the possibility of individual help at office hours is real. |
|
|
|
3. Be able to use the developed program to obtain solutions which make sense,
i.e, validation, accuracy test, monitoring and control, and interpretation
of the obtained solutions are crucial here.
This objective needs to act as feed back for the previous objectives/steps:
If the solution does not make sense, either the mathematical problem needs
to be redefined, or the algorithm rethought, or there is a programming mistake. |
|
|
|