A function trisection that finds the root of a polynomial
A function trisection that finds the root of a polynomial
(OP)
I need to write a function trisection that finds the roots of a polynomial by breaking the interpolation interval {[a,b] into 3 on each iteration. There are four input parameters, a row matrix with the coefficients of the polynomial, a, b, and the desired error. There are two output parameters, root: the root of the equation and n, the number of iterations. Any help is appreciated.





RE: A function trisection that finds the root of a polynomial
Cheers
Greg Locock
New here? Try reading these, they might help FAQ731-376: Eng-Tips.com Forum Policies http://eng-tips.com/market.cfm?
RE: A function trisection that finds the root of a polynomial
TTFN

FAQ731-376: Eng-Tips.com Forum Policies
RE: A function trisection that finds the root of a polynomial
Why don't you start with the Bisection method. It's efficient, and only takes about 20 lines of code. ...
Fe (IronX32)
RE: A function trisection that finds the root of a polynomial
http:/
few of us can afford to browes engineering tips from work these days, good luck
RE: A function trisection that finds the root of a polynomial
Fe (IronX32)
RE: A function trisection that finds the root of a polynomial
I guess the alternative is a truncated newton's or secant method