numerical analysis- new root finding algorithm



This study presents an improvement to the secant method by reconstruction, in numerical analysis,the secant
method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root
of a function F .The secant method can be thought of as a finite difference approximation of Newton’s
method. However the method was developed independently of Newton’s method and predated the latter by
over 3000 years.
Secant method which its convergence is superlinear is used in combination with bisection and inverse
quadratic interpolation in Brent’s and Zhang’s method wich are one of the most powerful root finding
algorithms.the new method presented in this study represents so much advantages in root finding algorithm
for non-linear equations, compared to the secant method , this uses secant lines from 2 circles in each
iteration, it then requires only one initial guess and its convergence is quadratic, this new method could
replace the secant method in Brent’s and Zhang’s method to make the algorithm more quick and more
efficient,some experimental tests presented in this study compares the performance of this new method to
the secant method.

you can see the file below:

marouane’s method



for mathematical interest : Approval of twin prime numbers conjecture and GoldBach conjecture


This study presents a new primer number finding algorithm,a prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.A natural number greater than 1 that is not a prime number is called a composite number,in this study we’ll build an algorithmthat can find all the consecutive prime numbers in a given interval, we’ll se testing examples , in the second part of this study we’ll prove the twin prime numbers conjecture and give an equation that can find percentage of prime numbers in given intervalthe file contains 13 pages in PDF format , it can be downloaded below.

the second file presents a prove of GoldBach conjecture which is one of the oldest and best-known unsolved problems in number theory and in all of mathematics.It states:Every even integer greater than 2 can be expressed as the sum of two primes.In this study I’ll prove that this conjecture is true.