Update ns_code2.ipynb

chapter2/ns_code2.ipynb

@@ -13,7 +13,7 @@
     "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 increased 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. 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",
     "```\n",
     "\n",
     "The computational geometry we would like to use is\n",