Mathematical Software Systems and Algorithmic Applications
KIB-MSAA
ki2
4
V
5
5
no
German
Case studies/Project collection
KI637
Computer Science and Communication Systems
5
optional course
KIB-MSAA
Computer Science and Communication Systems
5
optional course
PIBWI91
Applied Informatics
5
optional course
PIB-MSAA
Applied Informatics
5
optional course
60 class hours (= 45 clock hours) over a 15-week period.The total student study time is 150 hours (equivalent to 5 ECTS credits).There are therefore 105 hours available for class preparation and follow-up work and exam preparation.
Prof. Dr. Barbara Grabowski
bg
Prof. Dr. Barbara Grabowski
bg
After successfully completing this module, students will be familiar with typical mathematical software, know its advantages and disadvantages, can classify it according to type and application areas and can develop solution algorithms for simpler problems and implement them in a suitable language. They will be able to differentiate between computer algebra systems, numerical systems, statistical software, graphical systems and logical programming languages. They will be familiar with the problems of rounding errors and error propagation and know how to control such errors.
Furthermore, they will be able to manipulate and analyze mathematical terms with the typical data and control structures of computer algebraic systems (CAS) and implement algorithms for symbolic term transformations.
1. Problems of rounding errors, error propagation
2. Classification of common math software systems
2.1. Numerical packages
(classification, computation accuracy, rounding problems,
error propagation, typical examples)
2.2. Computer algebraic systems
(classification, exact computations, symbolic computation, runtime problems, typical examples)
2.3. Other software
(graphical CAS, statistics packages, software for TR, typical examples)
2.4. Declarative languages
(description of the problem and not the solution algorithm, typical examples)
3. CAS
3.1. General elementary concepts of computer algebra
3.2. Recursive structure of mathematical expressions
3.3. Elementary mathematical algorithms, case study
3.4. Recursive mathematical algorithms, case study
3.5. Polynomials, exponential and trigonometric transformations, case study
4. Solving problems with mathematics software
4.1 SPSS
4.1.1 Introduction to SPSS
4.1.2 Case studies: Data mining methods Cluster analysis and exploratory data analysis with SPSS
4.2 MAPLE
4.2.1. Introduction, data structures, control structures, MAPLE programming environment
4.2.2 Case studies: Sorting and search methods,
solving equation systems,
route planning, graph theory and coding
4.3 MatLab
4.3.1. Introduction, data structures, control structures, MatLab development environment
4.3.2 Case studies: Numerical methods for interpolation and approximation
5. Introduction to PROLOG
5.1. Structure: clauses, facts and rules
5.2. The backtracking algorithm
5.3. Lists and recursion in PROLOG
5.4. Creating your own CAS in PROLOG
100% of the lecture will take place in the PC lab "Angewandte Mathematik, Statistik und eLearning". All of the practical exercises for the lecture, as well as solving exercises, homework and case studies will be done with the e-learning system MathCoach, CAS systems, statistics and mathematics software (AMSEL lab: PC lab: "Angewandte Mathematik, Statistik und eLearning").
Joel S. Cohen, Computer Algebra and Symbolic Computation, Bd1: elemtary algorithms, A.K.Peters Ldt., 2002
BRANDSTÄDT A., Graphen und Algorithmen, B.G.Teubner Stuttgart, 1994
Fri Sep 30 06:11:56 CEST 2022, CKEY=kmuaa, BKEY=ki2, CID=[?], LANGUAGE=en, DATE=30.09.2022