β Scribed by T.N. Lucas
No coin nor oath required. For personal study only.
A numerical technique is presented which evaluates the roots of polynomials with real coeficients. Features of the method include no complex arithmetic requirements, no need to guess at initial quadratic factor estimates, multiple or nearly equal roots being easily dealt with and a high degree of flexibility in coping with non-convergent iterations. The method is simple to use and is based upon a Routh Array-type algorithm familiar to control engineers. Numerical examples demonstrate its application to various polynomials.
π SIMILAR VOLUMES
A new procedure is proposed for interpolation and extrapolation of functions by a root of a low=degree polynomial. Three examples of the application of the procedure are presented. The rms error in representing SCF surfaces ranges from 2 cal/mole (linear HCN) to 0.23 kcal/mole (C2v MgH2 triplet).
An algorithm is suggested which performs fast calculations of all the roots of a polynomial with maximal computer accuracy using, as the only primary information, the coefficients and the degree of the polynomial. The algorithm combines global as well as local convergences, i.e. it ensures a rapid h