Hello!!!!
I have to implement the bisection method.At each step of this method my code should print the current approximation _{x_{k}} and f(_{x_{k}}).....The program should end if the number of iterations surpass the maximum number of iterations,or if one or both of these conditions :
| _{x_{k}}-_{x_{k-1}} | < ε and | f(_{x_{k}}) | < ε stand.
So,do my program has to print the first _{x_{k}} for which: | _{x_{k}}-_{x_{k-1}} | < ε and | f(_{x_{k}}) | < ε ??
Question bisection method
Moderators: gmalivuk, Moderators General, Prelates
Re: Question bisection method
Could you give me an example of the results of the bisection method,so that I can check my output??For example if we have the function pow(x,3)+2*pow(x,2)+3,which has to be the output?
- Yakk
- Poster with most posts but no title.
- Posts: 11129
- Joined: Sat Jan 27, 2007 7:27 pm UTC
- Location: E pur si muove
Re: Question bisection method
I'm sorry, but did you mistake this forum for your course homework help forum?
One of the painful things about our time is that those who feel certainty are stupid, and those with any imagination and understanding are filled with doubt and indecision - BR
Last edited by JHVH on Fri Oct 23, 4004 BCE 6:17 pm, edited 6 times in total.
Last edited by JHVH on Fri Oct 23, 4004 BCE 6:17 pm, edited 6 times in total.
Re: Question bisection method
I just want to know using the criteria I wrote before if my program should print the first xk where the termination criteria are satisfied...and I wanted to have an example so that I can compare with my results...
Re: Question bisection method
Regarding the first question, it seems more like a clarification for your prof/grader to make, rather than something for random forum folk.
As for the second, I suspect that wikipedia has all the answers, although I haven't checked.
As for the second, I suspect that wikipedia has all the answers, although I haven't checked.
Who is online
Users browsing this forum: Bing [Bot] and 12 guests