diff options
Diffstat (limited to 'tutorials/module_2/notebook_2/intro_to_numerical_methods.ipynb')
| -rw-r--r-- | tutorials/module_2/notebook_2/intro_to_numerical_methods.ipynb | 53 |
1 files changed, 53 insertions, 0 deletions
diff --git a/tutorials/module_2/notebook_2/intro_to_numerical_methods.ipynb b/tutorials/module_2/notebook_2/intro_to_numerical_methods.ipynb new file mode 100644 index 0000000..eb45ad7 --- /dev/null +++ b/tutorials/module_2/notebook_2/intro_to_numerical_methods.ipynb @@ -0,0 +1,53 @@ +{ + "cells": [ + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "# Numerical Methods\n", + "\n", + "Engineering\n", + "\n", + "## What is a numerical method?\n", + "\n", + "Numerical methods are techniques that transform mathematical problems\n", + "into forms that can be solved using arithmetic and logical operations.\n", + "Because digital computers excel at these computations, numerical methods\n", + "are often referred to as computer mathematics.\n", + "\n", + "## Numerical Differentiation\n", + "\n", + "Forwards difference Backwards difference\n", + "\n", + "[Read\n", + "More](https://pythonnumericalmethods.studentorg.berkeley.edu/notebooks/chapter20.00-Numerical-Differentiation.html)\n", + "\n", + "## Roots and Optimization\n", + "\n", + "Incremental Search Bisection Modified Secant Newton-Raphson\n", + "\n", + "## Numerical Integration\n", + "\n", + "Trapezoidal\n", + "\n", + "Simpson’s Rule\n", + "\n", + "[Read\n", + "More](https://pythonnumericalmethods.studentorg.berkeley.edu/notebooks/chapter21.00-Numerical-Integration.html)\n", + "\n", + "## Numerical Solutions of Ordinary Differential Equations\n", + "\n", + "Euler’s Method - Forward - Backwards\n", + "\n", + "Runge-Kutta Method\n", + "\n", + "[Read\n", + "More](https://pythonnumericalmethods.studentorg.berkeley.edu/notebooks/chapter22.00-ODE-Initial-Value-Problems.html)" + ], + "id": "47b4ca7c-5bc4-4436-9ecd-ab541d2a2bcc" + } + ], + "nbformat": 4, + "nbformat_minor": 5, + "metadata": {} +} |
