Recent content by Benx

µ, is the smallest root of the sixth degree polynomial f(µ). The general shape of the graph of this equation shows that the real roots will be distributed as follows: 1 root < a1 < 2 (possible) roots < a2 < 2 (possible) roots < a3 < 1 root.

Hello, There is no error on derivative function! Newton-Raphson is not indicated for this case. first we compute u_bound an l_bound: //Get upper bound on mu u_bound1 = a1-fabs(b1); u_bound2 = a2-fabs(b2); u_bound3 = a3-fabs(b3); u_bound = u_bound1; if...

Newton-Raphson

Newton-Raphson Hello, You can see algorithm, available in Text file of project. So, I want to know if the algorithm is implemented properly. Best regards Benx

Ok, I will attach a vbproject to this message.

Hello, I do not found the same result as example given in the book, i don't know were is the failure. I think is better to see the code. or the algorithms "function and it's derivative". Benx

Hello, I am progamming in Visual Basic 6, need help to resolve equation using Newton-Raphson method. My program is running, but not properly! Thank you.