Computational Mathematics
Keywords |
Classification |
Keyword |
OFICIAL |
Mathematics |
Instance: 2018/2019 - 2S 
Cycles of Study/Courses
Teaching language
Suitable for English-speaking students
Objectives
Computational Algebra module (1st part):
Introduction to basic concepts of Computational Algebra, in particular to Gröbner basis and the arithmetic of multivariate polynomials.
Numerical Linear Algebra Module (2nd part):
Study constructive methods of numerical resolution of the following problems of Linear Algebra: systems of equations, inverse of matrices and determinants, focusing on the aspects of conditioning and stability, convergence, error control, construction of algorithms, implementation and experimentation in computer in the Python language and processing of study cases.
Learning outcomes and competences
Computational Algebra module (1st part):
Students should acquire knowledge on some basic concepts of Computational Algebra, as well as to have contact with Gröbner basis.
Numerical Linear Algebra module (2nd part):
Students should acquire the knowledge of the fundamental methods of Numerical Linear Algebra in their theoretical, practical, computational and experimental aspects.
Working method
Presencial
Pre-requirements (prior knowledge) and co-requirements (common knowledge)
Computational Algebra module (1st part):
It is expected that the student has good knowledge of abstract algebra. In particular the student should know the division algorithm for polynomials in one variable, the Euclidean algorithm and how to calculate the greatest common divisor of two polynomials in one variable.
Numerical Linear Algebra Module (2nd part):Fundamental notions of Linear Algebra.
Basic notions of any programming language.
Program
Computational Algebra module (1st part):
- Motivation: affine varieties and polynomial ideals.
- Gröbner bases: polynomial ideals, monomial orders and multivariate division with remainder, monomial ideals and Hilbert basis theorem, Gröbner bases and S-polynomials, Buchberger's algorithm.
Numerical Linear Algebra Module (2nd part):
- Python environments. Random, Hilbert and Pascal matrices. Linear algebra: norms, condition numbers, Gauss and Cholesky factorizations. Programming. Graphs.
- Numerical resolution of linear systems, inverse of matrices and determinants: vector and matrix norms, matrix series, conditioning, condition numbers, triangular systems and inverses, direct methods of Gauss and Cholesky; iterative methods of Jacobi and Gauss-Seidel.
Mandatory literature
Pina Heitor;
Métodos numéricos. ISBN: 978-972-592-284-2
Cox David;
Ideals, varieties, and algorithms. ISBN: 0-387-97847-X ((4th edition))
Complementary Bibliography
Brezinski Claude;
Méthodes numériques itératives. ISBN: 978-2-7298-2887-5
Brezinski Claude;
Méthodes numériques directes de l.algèbre matricielle. ISBN: 2-7298-2246-1
Gathen Joachim von zur;
Modern computer algebra. ISBN: 0-521-82646-2
Teaching methods and learning activities
Computational Algebra module (1st part):
The course material and examples will be presented by the teacher. Some time is to be reserved for the resolution of exercises by the students with the advice of the teacher.
Numerical Linear Algebra module (2nd part):
In the theoretic-practical classes are presented the contents of the syllabus with illustrative examples followed by the resolution of theoretical, practical and computational exercises implemented in Python language.
Software
Python
keywords
Physical sciences > Mathematics > Algorithms
Physical sciences > Mathematics > Computational mathematics
Evaluation Type
Distributed evaluation without final exam
Assessment Components
designation |
Weight (%) |
Teste |
85,00 |
Trabalho prático ou de projeto |
15,00 |
Total: |
100,00 |
Amount of time allocated to each course unit
designation |
Time (hours) |
Estudo autónomo |
106,00 |
Frequência das aulas |
52,00 |
Total: |
158,00 |
Eligibility for exams
Course registration.
Calculation formula of final grade
Final classification = t1 + t2 + tc1 + tc2
t1 = 1st test score quoted to 10 (1st part)
t2 = 2st test score quoted to 6 (2nd part)
tc1 = 1st computational work quoted to 1,5
tc1 = 2st computational work quoted to 1,5
NOTE: tc1 and tc2 are obtained during class time.
SECOND SEASON EXAM:
Final classification = er1 + er2 + tc1 + tc2
er1 = 1st exam score quoted to 10
er2 = 1st exam score quoted to 7
tc1, tc2 = tc1 and tc2 are obtained during class time.
(1) The second season exam consists of two parts corresponding to the division of matter for the tests.
(2) In the second season exam, the student can choose one or two of its parts. If he/she submits it for correction, it will replace the corresponding classification(s) obtained in the test(s).
Special assessment (TE, DA, ...)
Computational Algebra/Geometry module: exam.
Numerical Linear Algebra module: exam.
Classification improvement
Computational Algebra module: exam.
Numerical Linear Algebra module: exam.
Observations
Contact:
Christian Lomp
FCUP-DM,
Office FC1 369,
Email: clomp@fc.up.pt