The fastest exact algorithms for the isolation of the real roots of a polynomial equation

Computing ◽  
1980 ◽  
Vol 24 (4) ◽  
pp. 299-313 ◽  
Author(s):  
A. G. Akritas
Keyword(s):  
Polynomial Equation ◽  
Exact Algorithms ◽  
The Real ◽  
Real Roots ◽  
Roots Of A Polynomial

On the Confluence of Three Shock Waves in a Perfect Gas

1964 ◽  
Vol 15 (2) ◽  
pp. 181-197 ◽  
Author(s):  
L. F. Henderson
Keyword(s):  
Shock Waves ◽  
Equations Of Motion ◽  
Polynomial Equation ◽  
Physical Significance ◽  
Multiple Roots ◽  
Perfect Gas ◽  
The Real ◽  
Real Roots ◽  
Degenerate Shock

SummaryThe paper deals with the behaviour of three shock waves meeting at a point in a perfect gas. It is shown that the equations of motion can be reduced to a single polynomial equation of degree 10. The real roots of this equation are studied to determine their physical significance. In addition, the appearance of degenerate shock systems is shown to be associated with the formation of certain multiple roots of the polynomial equation.

Computing the real roots of a polynomial by the exclusion algorithm

1993 ◽  
Vol 4 (1) ◽  
pp. 1-24 ◽  
Author(s):  
Jean-Pierre Dedieu ◽  
Jean-Claude Yakoubsohn
Keyword(s):  
The Real ◽  
Real Roots ◽  
Roots Of A Polynomial

Improved Iterative Methods for Solving High Order Polynomial Equations

2010 ◽  
Vol 143-144 ◽  
pp. 1122-1126
Author(s):  
Dian Xuan Gong ◽  
Ling Wang ◽  
Chuan An Wei ◽  
Ya Mian Peng
Keyword(s):  
Adaptive Algorithm ◽  
Real Root ◽  
Polynomial Equation ◽  
Polynomial Equations ◽  
The Real ◽  
Real Roots ◽  
Order Polynomial ◽  
Root Isolation ◽  
Sturm Theorem ◽  
Real Root Isolation

Many calculations in engineering and scientific computation can summarized to the problem of solving a polynomial equation. Based on Sturm theorem, an adaptive algorithm for real root isolation is shown. This algorithm will firstly find the isolate interval for all the real roots rapidly. And then approximate the real roots by subdividing the isolate intervals and extracting subintervals each of which contains one real root. This method overcomes all the shortcomings of dichotomy method and iterative method. It doesn’t need to compute derivative values, no need to worry about the initial points, and could find all the real roots out parallelly.

On Graeffe's Method for Complex Roots of Algebraic Equations

1924 ◽  
Vol 22 (2) ◽  
pp. 83-87 ◽  
Author(s):  
S. Brodetsky ◽  
G. Smeal
Keyword(s):  
Nineteenth Century ◽  
Real Axis ◽  
Practical Method ◽  
Algebraic Equations ◽  
Argand Diagram ◽  
Considerable Difficulty ◽  
The Real ◽  
Real Roots ◽  
Bipolar Coordinates ◽  
Complex Roots

The only really useful practical method for solving numerical algebraic equations of higher orders, possessing complex roots, is that devised by C. H. Graeffe early in the nineteenth century. When an equation with real coefficients has only one or two pairs of complex roots, the Graeffe process leads to the evaluation of these roots without great labour. If, however, the equation has a number of pairs of complex roots there is considerable difficulty in completing the solution: the moduli of the roots are found easily, but the evaluation of the arguments often leads to long and wearisome calculations. The best method that has yet been suggested for overcoming this difficulty is that by C. Runge (Praxis der Gleichungen, Sammlung Schubert). It consists in making a change in the origin of the Argand diagram by shifting it to some other point on the real axis of the original Argand plane. The new moduli and the old moduli of the complex roots can then be used as bipolar coordinates for deducing the complex roots completely: this also checks the real roots.

scholarly journals An Efficient Method to Find Solutions for Transcendental Equations with Several Roots

2015 ◽  
Vol 2015 ◽  
pp. 1-4 ◽  
Author(s):  
Rogelio Luck ◽  
Gregory J. Zdaniuk ◽  
Heejin Cho
Keyword(s):  
Null Space ◽  
Heat Conduction Problem ◽  
Hankel Matrix ◽  
Polynomial Equation ◽  
Transient Heat Conduction ◽  
Transcendental Equation ◽  
Integral Theorem ◽  
Transient Heat Conduction Problem ◽  
Cauchy’S Integral Theorem ◽  
Roots Of A Polynomial

This paper presents a method for obtaining a solution for all the roots of a transcendental equation within a bounded region by finding a polynomial equation with the same roots as the transcendental equation. The proposed method is developed using Cauchy’s integral theorem for complex variables and transforms the problem of finding the roots of a transcendental equation into an equivalent problem of finding roots of a polynomial equation with exactly the same roots. The interesting result is that the coefficients of the polynomial form a vector which lies in the null space of a Hankel matrix made up of the Fourier series coefficients of the inverse of the original transcendental equation. Then the explicit solution can be readily obtained using the complex fast Fourier transform. To conclude, the authors present an example by solving for the first three eigenvalues of the 1D transient heat conduction problem.

scholarly journals Fractional Newton-Raphson Method

2021 ◽  
Vol 8 (1) ◽  
pp. 1-13
Author(s):  
A. Torres-Hernandez ◽  
F. Brambila-Paz
Keyword(s):  
Fractional Calculus ◽  
Iterative Method ◽  
Complex Numbers ◽  
Initial Condition ◽  
The Real ◽  
Complex Roots ◽  
Newton Raphson ◽  
Roots Of A Polynomial ◽  
Raphson Method

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n, with n ∈ N. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In the present work, we explain an iterative method that is created using the fractional calculus, which we will call the Fractional Newton-Raphson (F N-R) Method, which has the ability to enter the space of complex numbers given a real initial condition, which allows us to find both the real and complex roots of a polynomial unlike the classical Newton-Raphson method.

Sign in / Sign up

Export Citation Format

Share Document