Mathematical Analysis 1
Code  Completion  Credits  Range  Language 

BIEMA1.21  Z,ZK  5  2P+1R+1C  English 
 Relations:
 It is not possible to register for the course BIEMA1.21 if the student is concurrently registered for or has already completed the course BIEZMA (mutually exclusive courses).
 It is not possible to register for the course BIEMA1.21 if the student is concurrently registered for or has previously completed the course BIEZMA (mutually exclusive courses).
 The requirement for course BIEMA1.21 can be fulfilled by substitution with the course BIEZMA.
 Course guarantor:
 Lecturer:
 Tutor:
 Supervisor:
 Department of Applied Mathematics
 Synopsis:

We begin the course by introducing students to the set of real numbers and its properties, and we note its differences with the set of machine numbers. Then we study real sequences and real functions of a real variable. We gradually introduce the notions of limits of sequences and functions, continuous functions, and derivatives of functions. This theoretical foundation is then applied to rootfinding problems (iterative method of bisection and Newton’s method), construction of cubic interpolation (spline), and formulation and solution of simple optimization problems (i.e., the issue of finding extrema of functions). The course is closed with the Landau’s asymptotic notation and methods of mathematical description of complexity of algorithms.
 Requirements:

Knowledge of high school mathematics, basics of mathematical logic (BIEDML.21), and BIELA1.21.
 Syllabus of lectures:

1. Extended real number line: rational and irrational numbers, completeness axiom, neighborhood, infinity. Relation to machine numbers.
2. Basic properties of functions and sequences. Elementary functions (polynomials, trigonometric functions, exponential, and logarithm).
3. Limit of a sequence and limit of a function: definition, meaning, and illustrations.
4. Computation of limits: algebraic properties of limits, squeeze theorem, examples.
5. The continuity of a function, continuity of elementary functions, implications for root finding (the bisection method as an example of iterative numerical method).
6. The derivative of a function, geometric meaning, linearity of differentiation, product and quotient rule. Derivative of inverse function. Differentiation of elementary functions.
7. Newton’s method for root finding.
8. Cubic interpolation (splines). L’Hospital’s rule.
9. Lagrange’s mean value theorem, implications for monotony and convexity/concavity of functions.
10. Local extrema of functions. Sufficient conditions for their existence.
11. Analytical graph plotting: examples. The notion of an optimization problem.
12. Landau’s asymptotic notation.
13. Mathematical description of the complexity of algorithms.
 Syllabus of tutorials:

This is an outline of proseminars and subsequent exercises.
1. Functions and sequences, basic properties.
2. Elementary functions (polynomials, trigonometric functions, exponential and logarithm).
3. Limits of sequences and functions.
4. Continuity of functions.
5. Derivative of a function.
6. Analytical graph sketching (monotonicity, local exrtrema, asymptotes, etc.).
 Study Objective:
 Study materials:

1. Oberguggenberger M., Ostermann A. : Analysis for Computer Scientists. Springer, 2018. ISBN 9780857294456.
2. Stewart J. : Calculus (8th Edition). Cengage Learning, 2015. ISBN 9781285740621.
3. Bittinger M.L., Ellenbogen D.J., Surgent S.A. : Calculus and Its Applications (11th Edition). Pearson, 2015. ISBN 9780321979391.
 Note:
 Further information:
 https://courses.fit.cvut.cz/BIEMA1/
 No timetable has been prepared for this course
 The course is a part of the following study plans:

 Bachelor Specialization Computer Engineering, 2021 (compulsory course in the program)
 Bachelor Specialization, Information Security, 2021 (compulsory course in the program)
 Bachelor Specialization, Software Engineering, 2021 (compulsory course in the program)
 Bachelor Specialization, Computer Science, 2021 (compulsory course in the program)
 Bachelor Specialization, Computer Networks and Internet, 2021 (compulsory course in the program)
 Bachelor Specialization Computer Systems and Virtualization, 2021 (compulsory course in the program)
 Bachelor Specialization, Computer Engineering, Version 2024 (compulsory course in the program)