Différences
Ci-dessous, les différences entre deux révisions de la page.
Les deux révisions précédentes Révision précédente | Prochaine révisionLes deux révisions suivantes | ||
teaching:methcalchim:start [2020/09/01 09:52] – [Miscellaneous] villersd | teaching:methcalchim:start [2021/01/22 12:41] – villersd | ||
---|---|---|---|
Ligne 45: | Ligne 45: | ||
* Diagonalisation and triangularisation | * Diagonalisation and triangularisation | ||
* LU decomposition : factorization in triangular matrices | * LU decomposition : factorization in triangular matrices | ||
- | * [[numerical_integration|Numerical intégration]] (integrals) | ||
- | * Simpson method and gaussian quadratures | ||
* [[root-finding_algorithm|Root findings : equations f(x) = 0]] | * [[root-finding_algorithm|Root findings : equations f(x) = 0]] | ||
* Polynomial equations | * Polynomial equations | ||
Ligne 52: | Ligne 50: | ||
* Secant method, Regula falsi | * Secant method, Regula falsi | ||
* Newton-Raphson method | * Newton-Raphson method | ||
+ | * [[numerical_integration|Numerical intégration]] (integrals) | ||
+ | * Simpson method and gaussian quadratures | ||
+ | |||
+ | <note tip> | ||
+ | Learning outcomes : | ||
+ | * Systems of linear equations | ||
+ | * failing of the theoretical way to solve a linear system using determinant and cofactors (np complexity) | ||
+ | * triangularisation and diagonalisation principles : algorithm and complexity | ||
+ | * " | ||
+ | * extension towards the matrix inversion | ||
+ | * lower-upper LU decomposition and complexity (N³ for the decomposition step and N² for substitution step). How to solve systems with varying independant vectors | ||
+ | * special matrix require special algorithms : tridiagonal matrix algorithm (Thomas algorithm) | ||
+ | * Root findings | ||
+ | * Numerical intégration | ||
+ | </ | ||
==== Classical numerical methods ==== | ==== Classical numerical methods ==== |