Merge pull request #5 from jorgensd/dokken/ml-p1

Update ns code

Author: mleoni-pf

chapter2/ns_code2.ipynb

@@ -13,7 +13,9 @@
     "To be able to solve this problem efficiently and ensure numerical stability, we will substitute our first order backward difference scheme with a Crank-Nicholson discretization in time, and a semi-implicit Adams-Bashforth approximation of the non-linear term.\n",
     "\n",
     "```{admonition} Computationally demanding demo\n",
-    "This demo is computationally demanding, with a run-time up to 15 minutes, as it is using parameters from the DFG 2D-3 benchmark, which consists of 12800 time steps. It is adviced to download this demo and  not run it in a browser. This runtime of the demo can be decreased by using 2 or 3 mpi processes.\n",
+    "This demo is computationally demanding, with a run-time up to 15 minutes, as it is using parameters from the DFG 2D-3 benchmark, which consists of 12800 time steps.\n",
+    "It is adviced to download this demo and  not run it in a browser.\n",
+    "This runtime of the demo can be decreased by using 2 or 3 mpi processes.\n",
     "```\n",
     "\n",
     "The computational geometry we would like to use is\n",

chapter2/ns_code2.py

@@ -6,7 +6,7 @@
 #       extension: .py
 #       format_name: light
 #       format_version: '1.5'
-#       jupytext_version: 1.16.4
+#       jupytext_version: 1.16.6
 #   kernelspec:
 #     display_name: Python 3 (ipykernel)
 #     language: python
@@ -22,7 +22,9 @@
 # To be able to solve this problem efficiently and ensure numerical stability, we will substitute our first order backward difference scheme with a Crank-Nicholson discretization in time, and a semi-implicit Adams-Bashforth approximation of the non-linear term.
 #
 # ```{admonition} Computationally demanding demo
-# This demo is computationally demanding, with a run-time up to 15 minutes, as it is using parameters from the DFG 2D-3 benchmark, which consists of 12800 time steps. It is adviced to download this demo and  not run it in a browser. This runtime of the demo can be increased by using 2 or 3 mpi processes.
+# This demo is computationally demanding, with a run-time up to 15 minutes, as it is using parameters from the DFG 2D-3 benchmark, which consists of 12800 time steps.
+# It is adviced to download this demo and  not run it in a browser.
+# This runtime of the demo can be decreased by using 2 or 3 mpi processes.
 # ```
 #
 # The computational geometry we would like to use is