
Detailed information 
Original study plan 
Bachelor's programme Technical Mathematics 2012W 
Objectives 
Students of Algorithmic Methods 1 will
 get to know important mathematical problems,
 become familiar with important algorithms for solving certain classes of mathematical problems,
 learn to treat problems in a structured fashion,
 transfer mathematical knowledge into computer programs, and
 obey special aspects that come with the execution of computer programs.

Subject 
The course serves as a "bridge" between the two main courses in the first semester, linear algebra and analysis. We will deal with mathematical problems regardless whether they count as linear algebra or as analysis problems. In many cases, an "exakt" vs. an "approximative" solution will be discussed. Exact algorithms often have their justification in algebra, whereas approximations rely on results of analysis.
Concrete content of the course are:
 Basic notions of algorithmics, in particular in numeric and symbolic computation, like roundoff errors, condition, stability, and complexity.
 Data structures for representation of mathematical objects in a computer.
 Loop algorithms and recursion.
 Fundamental problems and their algorithmic solutions in the domains of natural, integer, rational, and real numbers, vectors, and univariate polynomials.

Criteria for evaluation 
Exercises during the semester, programming project and presentation as group work.

Methods 
Lecture, exercises, tutorial, programming project, presentation, working in groups.

Language 
German 
Study material 
Ph. Kügler, W. Windsteiger: Algorithmische Methoden. Band 1: Zahlen, Vektoren, Polynome, Reihe: Mathematik Kompakt, 2009, Softcover, ISBN: 9783764384340, BirkhäuserSpringer.
Ph. Kügler, W. Windsteiger: Algorithmische Methoden. Band 2: Funktionen Matrizen, Multivariate Polynome, Reihe: Mathematik Kompakt, 2012, Softcover, ISBN: 9783764385156, BirkhäuserSpringer.

Changing subject? 
No 
Further information 
http://www.risc.jku.at/people/wwindste/Teaching/AlgMeth1/AktuellerJG/

