Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I know Graeffe's method to approximate roots is great, but people always find troubles when they convert the root in n-th-root form into base 10 form by hand, for example, a large number in 64-th-root.

What is a more modern way of getting numerical solution/roots of polynomial in base 10 than this by hand? I prefer a method that you could control the accuracy in terms of significant digit

Graeffe's method - http://mat.iitm.ac.in/home/sryedida/public_html/caimna/transcendental/polynomial%20methods/direct.html

Now a bounty is offered to address all the concerns.

share|improve this question
    
There are a lot of modern methods (in this respect, Graffe root-squaring is relatively ancient, but there have been improvements even to it, such as the one by Sebastião e Silva), but I don't believe they're that easily done by hand. On the other hand, if you have some amount of stamina, I think the quotient-difference (QD) algorithm might be something you can use manually. It's quite slow to converge, so one often uses Newton-Raphson afterwards once the results from QD start to agree to a few or so digits. (QD is definitely a more recent development than root squaring, though!) –  J. M. Apr 25 '12 at 16:35
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.