summaryrefslogtreecommitdiff
path: root/tutorials/module_3/2_roots_optimization.md
diff options
context:
space:
mode:
authorChristian Kolset <christian.kolset@gmail.com>2025-09-12 17:24:40 -0600
committerChristian Kolset <christian.kolset@gmail.com>2025-09-12 17:24:40 -0600
commit18eb6dbfa545cdbb69103e312ccb0992d1b20b00 (patch)
treea601690e4ff90cb11032ddf43c6c794c829a18a1 /tutorials/module_3/2_roots_optimization.md
parent0c79ba277ff4afbb36613dfd366481b5e28cdf4e (diff)
Worked on module 3
Diffstat (limited to 'tutorials/module_3/2_roots_optimization.md')
-rw-r--r--tutorials/module_3/2_roots_optimization.md4
1 files changed, 1 insertions, 3 deletions
diff --git a/tutorials/module_3/2_roots_optimization.md b/tutorials/module_3/2_roots_optimization.md
index 8083260..e4224f1 100644
--- a/tutorials/module_3/2_roots_optimization.md
+++ b/tutorials/module_3/2_roots_optimization.md
@@ -39,7 +39,6 @@ Another approach may be to index the book and jump straight to the 'W' names how
When
-
# Bracketing Method
## Incremental Search
Incremental search
@@ -137,9 +136,8 @@ plt.legend()
plt.show()
```
-## False Position
-
+## False Position
# Open Methods
So far we looked at methods that require us to bracket a root before finding it. However, let's think outside of the box and ask ourselves if we can find a root with only 1 guess. Can we improve the our guess by if we have some knowledge of the function itself? The answer - derivatives.