小瓢虫传媒

Numerical algorithmic

lsinc1313  2024-2025  Charleroi

Numerical algorithmic
5.00 credits
30.0 h + 30.0 h
Q1
> Schedule

  This learning unit is not open to incoming exchange students!

Teacher(s)
Jodogne S茅bastien; Massart Estelle;
Language
French
Prerequisites

The prerequisite(s) for this Teaching Unit (Unit茅 d鈥檈nseignement 鈥� UE) for the programmes/courses that offer this Teaching Unit are specified at the end of this sheet.
Learning outcomes

At the end of this learning unit, the student is able to :

A.A. S1.G1, S1.3 - A.A. S2.2, S2.4 - A.A S6.1
Given the learning outcomes of the "Bachelor in Computer science" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:
  • S1.G1, S1.3
  • S2.2, S2.4
  • S6.1
Students who have successfully completed this course will be able to:
  • model a simple problem using the proper mathematical notation,
  • identify classical numerical methods suitable for solving a simple problem expressed mathematically,
  • choose, on the basis of precise criteria, the most effective method for numerically solving such a problem,
  • implement a numerical resolution of this simple problem,
  • explain the problems related to the numerical resolution of equations and their impacts: rounding errors, convergence, stopping criteria.
 
Content
The philosophy of the course is to introduce numerical methods by describing and, above all, implementing concepts from algebra and mathematical analysis courses. The aim is to develop algorithms while observing the limits of implementing a mathematical concept: data representation (numbers, etc.) and error handling (calculation, stability, propagation, etc.).
Teaching methods
By presentation of the concept and by implementation.
Evaluation methods
The examination will be a written, on-site test with open-ended questions. It will cover all the material from the lectures and practical sessions. The examination grade will contribute 90% to the final evaluation, while the remaining 10% will come from continuous work and attendance during the practical sessions. The grade for continuous work and attendance is retained throughout the academic year and will not be re-evaluated during the second exam session.
Online resources
Teaching materials
  • "Numerical Methods in Engineering with Python 3" de Jaan Kiusalaas (ISBN-13: 978-1107033856)
  • "Numerical Algorithms" de Justin Solomon (ISBN-13: 978-1482251883)
  • Slides on Moodle
Faculty or entity
> SINC


Programmes / formations proposant cette unit茅 d'enseignement (UE)

Title of the programme
Sigle
Credits
Prerequisites
Learning outcomes
Bachelor in Computer Science
SINC1BA
5
LSINC1101 AND LSINC1111 AND LSINC1112