LinBairstow algorithm for Polynomial Roots

02232022, 06:31 PM
Post: #5




RE: LinBairstow algorithm for Polynomial Roots
(02212022 11:53 AM)floppy Wrote: Thanks for the contribution. Does it differ from other existing programs in modules? and what are the advantages or disadvantages? All methods have some pros and cons. The usual caveats apply to Bairstow: lacking convergence and being unstable for polynomials of degrees above 8 or 10 (depending on the implementation and fp precision). When the method appears to be stuck and diverges, one can try to reset/perturb the parameters to continue the search. This can be done automatically. No method is immune to difficulties with higher degree polynomials and/or root multiplicities, see also Wilkinson's polynomial.  Rob "I count on old friends"  HP 71B,PrimeTi VOY200,Nspire CXII CASCasio fxCG50...Sharp PCG850,E500,2500,1500,14xx,13xx,12xx... 

« Next Oldest  Next Newest »

Messages In This Thread 
LinBairstow algorithm for Polynomial Roots  Namir  02162022, 12:56 PM
RE: LinBairstow algorithm for Polynomial Roots  floppy  02212022, 11:53 AM
RE: LinBairstow algorithm for Polynomial Roots  Namir  02212022, 10:18 PM
RE: LinBairstow algorithm for Polynomial Roots  Thomas Klemm  02222022, 11:02 PM
RE: LinBairstow algorithm for Polynomial Roots  robve  02232022 06:31 PM

User(s) browsing this thread: 1 Guest(s)