The Tri-section Method for solving non-linear equations

The trisection method is a modification of the bisection method for solving a nonlinear equation f(x) = 0.
Steps for solution:
1) Starting with an interval [𝑎0 , 𝑏0 ] such that: f(𝑎0 ). f(𝑏0 ) < 0
𝒃𝟎 +𝒂𝟎
Obtaining the solution as 𝒙𝟎 = (The midpoint)
𝟐
Dividing the interval into three sub-intervals: [𝑎0 , 𝑐0 ], [𝑐0 , 𝑑0 ] and [𝑑0 , 𝑏0 ],
where,
𝑏0 − 𝑎0
𝑐0 = 𝑎0 +
3
𝑏0 − 𝑎0
𝑑0 = 𝑎0 + 2( )
3
2) Working on the sub-interval containing the root and putting its terminals as [𝑎1 , 𝑏1 ]
Such that:
If f(𝑎0 ).f(𝑐0 ) < 0 , then [𝑎1 , 𝑏1 ]= [𝑎0 , 𝑐0 ]
If f(𝑐0 ).f(𝑑0 ) < 0 , then [𝑎1 , 𝑏1 ]= [𝑐0 , 𝑑0 ]
If f(𝑑0 ).f(𝑏0 ) < 0 , then [𝑎1 , 𝑏1 ]= [𝑑0 , 𝑏0 ]
𝒃𝟏 +𝒂𝟏
Calculating the solution 𝒙𝟏 =
𝟐
Then, dividing the interval [𝑎1 , 𝑏1 ] into three sub-intervals: [𝑎1 , 𝑐1], [𝑐1, 𝑑1 ] and [𝑑1 , 𝑏1 ],
where,
𝑏1 − 𝑎1
𝑐1 = 𝑎1 +
3
𝑏1 − 𝑎1
𝑑1 = 𝑎1 + 2( )
3
3) Working on the sub-interval containing the root and putting its terminals as [𝑎2 , 𝑏2 ]
Such that:
If f(𝑎1 ).f(𝑐1) < 0 , then [𝑎2 , 𝑏2 ] = [𝑎1 , 𝑐1]
If f(𝑐1).f(𝑑1 ) < 0 , then [𝑎2 , 𝑏2 ] = [𝑐1, 𝑑1 ]
If f(𝑑1 ).f(𝑏1 ) < 0 , then [𝑎2 , 𝑏2 ] = [𝑑1 , 𝑏1 ]
𝒃𝟐 +𝒂𝟐
Calculating the solution 𝒙𝟐 =
𝟐
Then, dividing the interval [𝑎2 , 𝑏2 ] into three sub-intervals: [𝑎2 , 𝑐2 ], [𝑐2 , 𝑑2 ] and [𝑑2 , 𝑏2 ],
where,
𝑏2 − 𝑎2
𝑐2 = 𝑎2 +
3
𝑏2 − 𝑎2
𝑑2 = 𝑎2 + 2( )
3
4) Similarly, we will perform the same steps as (2 and 3) for the next iterations (i=3,4,…) till the solution
𝒃𝒊 +𝒂𝒊
𝒙𝒊 = converges at a certain accuracy (k).
𝟐