Abstract
Numerical techniques are presented for computing the roots of polynomial equations. By applying the recommended scaling and inversion rules, the basic Bistrow and Newton-Raphson iterative techniques can be applied with great reliability. Both a high degree of accuracy and rapid convergence are realized. Numerical examples are shown to illustrate the pitfalls and to show how these are circumvented by application of the recomended procedures.
- 1 HILDEBRAND, F. B. Introduction to Numerical Analysis, pp. 472-475. McGraw-Hill Book Co., New York, 1956. Google ScholarDigital Library
Index Terms
- On programming the numerical solution of polynomial equations
Recommendations
Numerical solution of distributed order fractional differential equations
In this paper a method for the numerical solution of distributed order FDEs (fractional differential equations) of a general form is presented. The method applies to both linear and nonlinear equations. The Caputo type fractional derivative is employed. ...
Taylor polynomial solution of hyperbolic type partial differential equations with constant coefficients
The purpose of this study is to give a Taylor polynomial approximation for the solution of hyperbolic type partial differential equations with constant coefficients. The technique used is an improved Taylor matrix method, which has been given for ...
Sylvester Equations and the numerical solution of partial fractional differential equations
We develop a new matrix-based approach to the numerical solution of partial differential equations (PDE) and apply it to the numerical solution of partial fractional differential equations (PFDE). The proposed method is to discretize a given PFDE as a ...
Comments