From cd59cd9fd7b75288afcc091d7caaaa6146d4129b Mon Sep 17 00:00:00 2001 From: u7062654 Date: Thu, 14 Jan 2021 18:02:48 +1100 Subject: [PATCH 1/8] [numba] trial, please ignore --- lectures/numba.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/numba.md b/lectures/numba.md index dd90e086..3ded2a50 100644 --- a/lectures/numba.md +++ b/lectures/numba.md @@ -555,7 +555,7 @@ Now let's see how fast it runs: %time calculate_pi() ``` -If we switch of JIT compilation by removing `@njit`, the code takes around +If we switch offf JIT compilation by removing `@njit`, the code takes around 150 times as long on our machine. So we get a speed gain of 2 orders of magnitude--which is huge--by adding four From 7dbc29cb3edf085985d49c9a9d15855fb6f08054 Mon Sep 17 00:00:00 2001 From: u7062654 Date: Thu, 14 Jan 2021 18:04:32 +1100 Subject: [PATCH 2/8] [numba] typo --- lectures/numba.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/numba.md b/lectures/numba.md index 3ded2a50..a763fb06 100644 --- a/lectures/numba.md +++ b/lectures/numba.md @@ -555,7 +555,7 @@ Now let's see how fast it runs: %time calculate_pi() ``` -If we switch offf JIT compilation by removing `@njit`, the code takes around +If we switch off JIT compilation by removing `@njit`, the code takes around 150 times as long on our machine. So we get a speed gain of 2 orders of magnitude--which is huge--by adding four From 76a3c3d5cacaf5933cae9efda604509d21d7bec0 Mon Sep 17 00:00:00 2001 From: u7062654 Date: Fri, 15 Jan 2021 14:28:20 +1100 Subject: [PATCH 3/8] [scipy] add usful feature of Numpy comparing to other libraries --- lectures/numba.md | 2 +- lectures/scipy.md | 3 ++- 2 files changed, 3 insertions(+), 2 deletions(-) diff --git a/lectures/numba.md b/lectures/numba.md index a763fb06..dd90e086 100644 --- a/lectures/numba.md +++ b/lectures/numba.md @@ -555,7 +555,7 @@ Now let's see how fast it runs: %time calculate_pi() ``` -If we switch off JIT compilation by removing `@njit`, the code takes around +If we switch of JIT compilation by removing `@njit`, the code takes around 150 times as long on our machine. So we get a speed gain of 2 orders of magnitude--which is huge--by adding four diff --git a/lectures/scipy.md b/lectures/scipy.md index 06d95f79..7555f690 100644 --- a/lectures/scipy.md +++ b/lectures/scipy.md @@ -63,7 +63,8 @@ from numpy.fft import fft, ifft from numpy.lib.scimath import * ``` -However, it's more common and better practice to use NumPy functionality explicitly +However, it's more common and better practice to use NumPy functionality explicitly. One good feature of Numpy is it has a faster processing time than other Python libraries. + ```{code-cell} python3 import numpy as np From b6cfffdd5e7619a79fe78b9b9f940bc77ef6270b Mon Sep 17 00:00:00 2001 From: u7062654 Date: Fri, 15 Jan 2021 14:38:34 +1100 Subject: [PATCH 4/8] [numpy] 11.8 Recursion --- lectures/scipy.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/scipy.md b/lectures/scipy.md index 7555f690..d5bb41e5 100644 --- a/lectures/scipy.md +++ b/lectures/scipy.md @@ -443,7 +443,7 @@ We leave you to investigate the [set of available routines](http://docs.scipy.or (sp_ex1)= ### Exercise 1 -Previously we discussed the concept of {ref}`recursive function calls `. +In Chapter 16 we will discuss the concept of {ref}`recursive function calls `. Try to write a recursive implementation of homemade bisection function {ref}`described above `. From 0dd8919ec1539c994ee92d654349d2847e1f4df1 Mon Sep 17 00:00:00 2001 From: u7062654 Date: Fri, 15 Jan 2021 14:54:53 +1100 Subject: [PATCH 5/8] [scipy] Recursion --- lectures/numba.md | 2 +- lectures/scipy.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/lectures/numba.md b/lectures/numba.md index dd90e086..a763fb06 100644 --- a/lectures/numba.md +++ b/lectures/numba.md @@ -555,7 +555,7 @@ Now let's see how fast it runs: %time calculate_pi() ``` -If we switch of JIT compilation by removing `@njit`, the code takes around +If we switch off JIT compilation by removing `@njit`, the code takes around 150 times as long on our machine. So we get a speed gain of 2 orders of magnitude--which is huge--by adding four diff --git a/lectures/scipy.md b/lectures/scipy.md index d5bb41e5..3bdc067d 100644 --- a/lectures/scipy.md +++ b/lectures/scipy.md @@ -443,7 +443,7 @@ We leave you to investigate the [set of available routines](http://docs.scipy.or (sp_ex1)= ### Exercise 1 -In Chapter 16 we will discuss the concept of {ref}`recursive function calls `. +In Chapter 16, we will discuss the concept of {ref}`recursive function calls `. Try to write a recursive implementation of homemade bisection function {ref}`described above `. From bb56dd09bf1b602d63c2db3c84e3ad5277254780 Mon Sep 17 00:00:00 2001 From: u7062654 Date: Sat, 16 Jan 2021 15:39:13 +1100 Subject: [PATCH 6/8] [scipy] ammended previous PR --- lectures/scipy.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/scipy.md b/lectures/scipy.md index 3bdc067d..74545159 100644 --- a/lectures/scipy.md +++ b/lectures/scipy.md @@ -63,7 +63,7 @@ from numpy.fft import fft, ifft from numpy.lib.scimath import * ``` -However, it's more common and better practice to use NumPy functionality explicitly. One good feature of Numpy is it has a faster processing time than other Python libraries. +However, it's more common and better practice to use NumPy functionality explicitly. As it has a faster processing time rather than implicitly via SciPy. ```{code-cell} python3 From 23cddf2d07b68cee9c0b064092ee8f1841d2b619 Mon Sep 17 00:00:00 2001 From: mmcky Date: Mon, 20 Sep 2021 11:16:40 +1000 Subject: [PATCH 7/8] remove Chapter 16 --- lectures/scipy.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/scipy.md b/lectures/scipy.md index 74545159..dfd7415c 100644 --- a/lectures/scipy.md +++ b/lectures/scipy.md @@ -443,7 +443,7 @@ We leave you to investigate the [set of available routines](http://docs.scipy.or (sp_ex1)= ### Exercise 1 -In Chapter 16, we will discuss the concept of {ref}`recursive function calls `. +In {ref}`this lecture `, we will discuss the concept of {ref}`recursive function calls `. Try to write a recursive implementation of homemade bisection function {ref}`described above `. From bc8998eb54df0442fe92cdb846a66b553acaf337 Mon Sep 17 00:00:00 2001 From: John Stachurski Date: Mon, 20 Sep 2021 13:11:05 +1000 Subject: [PATCH 8/8] Update scipy.md --- lectures/scipy.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/scipy.md b/lectures/scipy.md index a0b19210..6d643d2d 100644 --- a/lectures/scipy.md +++ b/lectures/scipy.md @@ -63,7 +63,7 @@ from numpy.fft import fft, ifft from numpy.lib.scimath import * ``` -However, it's more common and better practice to use NumPy functionality explicitly. As it has a faster processing time rather than implicitly via SciPy. +However, it's more common and better practice to use NumPy functionality explicitly. ```{code-cell} python3