![]() They are based on sharing the interval among three threads. This report states two implementations of Brent-Dekker. If the found solution in an iteration is not in the interval (a,b), we use bisection method. We find c, a new possible solution of the function using as that method prescribes, using the previously obtained feasible solutions. Using any of these implementations, we can find the root of a function known to lie between a and b (which are initially guessed) and is taken as the initial interval range for that implementation. I have also designed a better sequential method than Brent-Dekker. In this work, I have implemented and parallelized the Brent-Dekker Method. This algorithm uses Secant, Inverse Quadratic Interpolation or bisection Method as required. Brent-Dekker is one such method combining the bisection method, secant method and inverse quadratic interpolation method. As roots of a function are not exactly computable or expressible in closed form, root-finding algorithms provide approximations to roots, expressed either as floating point numbers or as small isolating intervals. A root of a function f is a number x such that f(x) = 0. Indian Institute of Technology(IIT), Hyderabad, Kandi, Sangareddy, Telangana State, 502285, India AbstractĪ root-finding algorithm is for finding roots of continuous functions. Gitam Deemed to be University, Rushikonda, Visakhapatnam, 530045, India Implementation of Brent-Dekker and A Better Root Finding Method and Brent-Dekker Method's Parallelization ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
December 2022
Categories |