Skip to content

Commit 49df38d

Browse files
Fixed
1 parent 850944b commit 49df38d

File tree

2 files changed

+17
-10
lines changed

2 files changed

+17
-10
lines changed

README.md

Lines changed: 8 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -1,16 +1,17 @@
1-
# Numerical methods of solving nonlinear equations $f(x)=0$
2-
Implementation of main numerical methods for solving non-linear equations f(x)=0 with examples.
1+
# Root finding algorithms
2+
3+
Implementation of main numerical methods for solving non-linear equations f(x)=0. In English and French (fr) with examples.
34

45
1. Bisection method
56
2. Secant method
67
3. Newton's method
78
4. Fixed point method
89

9-
## Requirements
10-
- Python 3.x
11-
- Jupyter Notebook
12-
- Matplotlib
10+
Try launching the notebooks directly in your browser using Github's Codespaces!
11+
1312

1413
## References
15-
https://en.wikipedia.org/wiki/Root-finding_algorithm
14+
- . G.E. Karniadakis and R.M. Kirby, “Parallel Scientific Computing in C++ and MPI”, Cambridge University Press, March 2003.
15+
16+
- https://en.wikipedia.org/wiki/Root-finding_algorithm
1617

point_fixe.ipynb

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,12 @@
11
{
22
"cells": [
33
{
4+
"attachments": {},
45
"cell_type": "markdown",
56
"metadata": {},
67
"source": [
7-
"# Méthodes numériques de résolution d'équations non linéaires $f(x)=0$\n",
8-
"## Methode du point fixe"
8+
"# Root finding algorithms\n",
9+
"## Fixed-point iteration"
910
]
1011
},
1112
{
@@ -72,7 +73,12 @@
7273
"name": "python",
7374
"nbconvert_exporter": "python",
7475
"pygments_lexer": "ipython3",
75-
"version": "3.5.2"
76+
"version": "3.10.4 (main, Nov 29 2022, 20:00:25) [GCC 9.4.0]"
77+
},
78+
"vscode": {
79+
"interpreter": {
80+
"hash": "3ad933181bd8a04b432d3370b9dc3b0662ad032c4dfaa4e4f1596c548f763858"
81+
}
7682
}
7783
},
7884
"nbformat": 4,

0 commit comments

Comments
 (0)