Différences

Ci-dessous, les différences entre deux révisions de la page.

--- teaching:methcalchim:system_of_linear_equations [2017/09/28 10:39] – villersd
+++ teaching:methcalchim:system_of_linear_equations [2018/10/08 16:06] – villersd
@@ Ligne 8: / Ligne 8: @@
   * [[wp>LU_decomposition]]
     * [[wp>Triangular_matrix#Forward_and_back_substitution]]
+  * Chapter 2 in the book "Numerical Recipes" :
+    * 2.0 Introduction
+    * 2.1 Gauss-Jordan Elimination
+    * 2.2 Gaussian Elimination with Backsubstitution
+    * 2.3 LU Decomposition and Its Application
+  * Python [[https://docs.scipy.org/doc/numpy/|NumPy]] library : [[https://docs.scipy.org/doc/numpy/reference/index.html|NumPy Reference]]
+    * [[https://docs.scipy.org/doc/numpy/reference/routines.linalg.html|Linear algebra (numpy.linalg)]] : [[https://docs.scipy.org/doc/numpy/reference/generated/numpy.linalg.solve.html#numpy.linalg.solve|numpy.linalg.solve]]
   * Time complexity analysis
     * Hint : in Python, use the timeit module
@@ Ligne 21: / Ligne 28: @@
   * Thermal diffusion and chemical diffusion (transient or stationary) on a regular 1D space with equidistant steps. ODE equations can be writen such a given evolution equation for node # i only imlies nodes i+1 and i-1
   * Using [[wp>Tridiagonal_matrix_algorithm|tridiagonal Thomas algorithm]] allows to save computational time thanks to n complexity
-  * ? Python libraty with Thomas algorithm
+  * ? Python library with Thomas algorithm
 ===== References : =====
   * Numerical recipes, The Art of Scientific Computing 3rd Edition, William H. Press, Saul A. Teukolsky, William T. Vetterling, Brian P. Flannery, 2007, isbn: 9780521880688
     * [[http://numerical.recipes/]]
+      * in C : [[http://apps.nrbook.com/c/index.html]]
     * [[http://www2.units.it/ipl/students_area/imm2/files/Numerical_Recipes.pdf]]
     * [[http://apps.nrbook.com/empanel/index.html#]]