# Pre Search root

5 replies to this topic

### #1udvat

Valued Member

• Members
• 111 posts

Posted 30 November 2008 - 11:50 AM

For a function, I want to calculate the range where one root exists. For example, f(x) has a root in subrange [a1,b1], another root in subrange[a2,b2] in a total range of [X,Y]. Is any such algorithm available to calculate the ranges?

### #2Reedbeta

DevMaster Staff

• 5307 posts
• LocationBellevue, WA

Posted 30 November 2008 - 07:04 PM

Can you give us any more details about the function? For a completely general function, this sort of thing is not really possible. However if you have a specific class of functions you are interested in (such as polynomials) then it may be possible.
reedbeta.com - developer blog, OpenGL demos, and other projects

### #3Sol_HSA

Senior Member

• Members
• 510 posts
• LocationNowhere whenever

Posted 01 December 2008 - 06:53 AM

Or how about not posting schoolwork assignments?
http://iki.fi/sol - my schtuphh

### #4udvat

Valued Member

• Members
• 111 posts

Posted 01 December 2008 - 06:55 AM

My desired function is 10sin(x)-x=0.

### #5Reedbeta

DevMaster Staff

• 5307 posts
• LocationBellevue, WA

Posted 01 December 2008 - 09:28 AM

Well I'll give you a hint.

You know (or should know) that sin(x) is always between -1 and 1. Given this, you should be able to calculate a range of x values where that function could possibly have roots.

Once you've done that, you can use what you know about where the roots of sin(x) are to estimate how many roots your function could have and ranges where they could be.
reedbeta.com - developer blog, OpenGL demos, and other projects

### #6udvat

Valued Member

• Members
• 111 posts

Posted 01 December 2008 - 09:28 AM

I found the method "Bracketing method" in the following link

http://civilwares.fr...a92657_ch05.pdf

It works fine for my purpose. Thanks to all.

#### 1 user(s) are reading this topic

0 members, 1 guests, 0 anonymous users