Cauchy
Author: M. Del Hierro
Date: Mars 2007

Déplacez le point x0 et observez la convergence de la suite x0,x1,x2...

Modifiez la fonction f, et testez l'algorithme

g(x) = 1 - x x + x
x_0 = Point(xAxis)
a_0 = OrthogonalLine(x_0, xAxis)
A_0 = Intersect(g, a_0, (1.471629213483146, 0.30593667150612314))
f(x) = 1 - x x
b_0 = Line(A_0, xAxis)
B_0 = Intersect(b_0, diag)
a_1 = OrthogonalLine(B_0, xAxis)
x_1 = Intersect(a_1, xAxis)
A_1 = Intersect(g, a_1, (0.30593667150612314, 1.2123394245338777))
b_1 = Line(A_1, xAxis)
B_1 = Intersect(b_1, diag)
a_2 = OrthogonalLine(B_1, xAxis)
x_2 = Intersect(xAxis, a_2)
A_2 = Intersect(g, a_2, (1.2123394245338777, 0.742572544254744))
b = Line(A_2, xAxis)
B_2 = Intersect(diag, b)
c = OrthogonalLine(B_2, xAxis)
x_3 = Intersect(xAxis, c)
v_0 = Segment(x_0, A_0)
d = Segment(A_0, B_0)
v_1 = Segment(B_0, A_1)
h_1 = Segment(A_1, B_1)
v_2 = Segment(B_1, A_2)
h_2 = Segment(A_2, B_2)