Exted the root finding capability by adding a function to numerically evaluate root upto specified precission

[gr8geek]

We will be using regular falsi combined with newton raphson and bisection method to find the root .It is beneficial in two ways as 1.It can be used to test/verify the roots obtained by step by step solver 2. It can be used to find the roots of transcendental equation Example: find_root(expression,lower bound,upper bound,decimal place precission) find_root(cos(x)-x*e^x,0,1,4) Answer=0.5177

[ZouvikPan]

I would like to work on this.

[gr8geek]

I have already started some work on this and trying to make it more fail-safe and efficient, I will be sharing my work with you after my semester exams are over(i am into my exams).

[gr8geek]

it seems simple but NR algorithm could fail at times which should be handled by other algorithms ( bisection or regular falsi which can yet fail at other cases) and they have a different asymptotic rate of convergence

[ZouvikPan]

Actually I have been working on this already. Lets's work together on this then. I think Newton Raphson alone won't be able to do the job of finding roots.

[gr8geek]

Sure