1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
{
"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 Central Difference method [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",
"## System of Equations\n",
"\n",
"Guassian Method LU Decomposition\n",
"\n",
"## Numerical Integration\n",
"\n",
"Midpoint Trapezoidal Romberg Gaussian 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-Kutte\n",
"\n",
"[ReadMore](https://pythonnumericalmethods.studentorg.berkeley.edu/notebooks/chapter22.00-ODE-Initial-Value-Problems.html)"
],
"id": "508fb71a-8f30-4cb3-88f8-28b45a334596"
}
],
"nbformat": 4,
"nbformat_minor": 5,
"metadata": {}
}
|
