Inhalt

[ 201SYMRCACV12 ] VL Computer Algebra for Concrete Mathematics

Versionsauswahl
Workload Ausbildungslevel Studienfachbereich VerantwortlicheR Semesterstunden Anbietende Uni
3 ECTS B3 - Bachelor 3. Jahr Mathematik Carsten Schneider 2 SSt Johannes Kepler Universität Linz
Detailinformationen
Quellcurriculum Bachelorstudium Technische Mathematik 2019W
Ziele In this lecture basic skills and techniques will be elaborated which are relevant to simplify formulas related to enumeration, in particular, to carry out the average and worst case complexity analysis of algorithms.
Lehrinhalte The content of the lecture can be summarized by the following key words:

    algorithmic treatment of formal power series
    c-finite and holonomic functions/sequences
    recurrence solving
    basic aspects of asymptotics
    symbolic summation 

A major emphasis of the lecture is to present the basic notions, to develop the basic ideas of the underlying algorithms and to put computer algebra into action for concrete examples.

Beurteilungskriterien oral exam
Lehrmethoden symbolic computation and in particular computer algebra, basic linear algebra, asymptotics
Abhaltungssprache Englisch
Literatur Many of the topics discussed in the lecture can be found in the book "Concrete Mathematics - A Foundation for Computer Science" by R.L.Graham, D.E.Knuth und O.Patashnik (Addison-Wesley, 1994) and "The Concrete Tetrahedron" by Manuel Kauers and Peter Paule (Springer Wien, 2011).
Lehrinhalte wechselnd? Nein
Äquivalenzen TM1WHVOANKO: VO Analytische Kombinatorik (3 ECTS)
Präsenzlehrveranstaltung
Teilungsziffer -
Zuteilungsverfahren Direktzuteilung