Math Help - Bisection method

1. Bisection method

The function f(x) = sin(pi*x) has zero at every integer. If -1 < a < 0 and 2 < b < 3, show that it converges to 0 if a + b < 2.

So p1 = (a1 + b1) / 2 for those restrictions which is (-1 + 2) / 2 = 1/2 and (-1 + 3) / 2 = 1 and 1/2 < p1 < 1.

1 > f(p1) > 0 so a2 = a1 = a and b2 = p1.

I found out that the solution is p = 0 because it is the only zero of f in [a2, b2] but how do I actually get it? What do I choose for b2 = p1 and a2 = a? Since both of them are a range. -1 < a2 < 0 and 1/2 < b2 < 1. I'd understand it if I started off with a = something and b = something

p = p2 = (a2 + b2) / 2 = ? = 0.

2. Originally Posted by JackRyder
The function f(x) = sin(pi*x) has zero at every integer. If -1 < a < 0 and 2 < b < 3, show that it converges to 0 if a + b < 2.

So p1 = (a1 + b1) / 2 for those restrictions which is (-1 + 2) / 2 = 1/2 and (-1 + 3) / 2 = 1 and 1/2 < p1 < 1.

1 > f(p1) > 0 so a2 = a1 = a and b2 = p1.

I found out that the solution is p = 0 because it is the only zero of f in [a2, b2] but how do I actually get it? What do I choose for b2 = p1 and a2 = a? Since both of them are a range. -1 < a2 < 0 and 1/2 < b2 < 1. I'd understand it if I started off with a = something and b = something

p = p2 = (a2 + b2) / 2 = ? = 0.
If a real function $f(x)$ is continuous on an interval $[u,v]$ and $f(u)f(v)<0$ then the bisection method converges to a zero of $f(x)$ in the interval $[u,v].$

So it is sufficient to show that $f(a)f(p1)<0$.

(By the way why do we end with $[a,p1]$ after the first step rather than $[p1,b]$ ? )

CB

3. But how do you choose which is a and which is b.

p = (a + b) / 2 so if both a and b aren't specific numbers but a range, how do you choose a and b to get that p.

Part b of the question is: a + b > 2 and p1 = (a + b) / 2 so 1 < p1 < 1. Thus f(p1) < 0 so a2 = p1 and b2 = b1 = b. The only zero in [a2, b2] is p = 2 so convergence will be to 2. So how do you get p2 = p = 2?

4. Originally Posted by JackRyder
But how do you choose which is a and which is b.

p = (a + b) / 2 so if both a and b aren't specific numbers but a range, how do you choose a and b to get that p.

Part b of the question is: a + b > 2 and p1 = (a + b) / 2 so 1 < p1 < 1. Thus f(p1) < 0 so a2 = p1 and b2 = b1 = b. The only zero in [a2, b2] is p = 2 so convergence will be to 2. So how do you get p2 = p = 2?
The conditions given for use of the bisection method are not satisfied by a and b, since the function is negative for both. This mean (a,b) contains 0 or an even non-zero number of roots (this is because it is continuous, the bisection method finds point at which the function changes sign and fortunatly this particular function does not have a root which kisses the x-axis).

CB
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 8, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8165184259414673, "perplexity": 245.555422955907}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-10/segments/1394678696015/warc/CC-MAIN-20140313024456-00044-ip-10-183-142-35.ec2.internal.warc.gz"}