相关论文: Analytical formula for the roots of the general co…

We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…

This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…

This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…

In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…

We suggest a closed solution for the roots of polynomial trinomial algebraic equation $$z^n+xz^{n-1}-1=0$$ with an appropriate $x$. This solution is a minor modification to the work of Mikhalkin (Mikhalkin E N, 2006. On solving general…

In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…

The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.

In this paper we show that Cardanos formula for the solution of cubic equations can be reduced to expressions involving only square roots if the real root is rational.

The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…

New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…

In this paper, we present a new method for solving standard quaternion equations. Using this method we reobtain the known formulas for the solution of a quadratic quaternion equation, and provide an explicit solution for the cubic…

An observation by J-P. Serre implies that cubic polynomials are unique among generic monic polynomials of degree 2 or higher in that they have a root that is a power series in the discriminant of the polynomial. We provide formulas for this…

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

We show that every monic polynomial of degree three with complex coefficients and no repeated roots is either a (vertical and horizontal) translation of $y=x^3$ or can be composed with a linear function to obtain a Ramanujan cubic. As a…

We consider a sequence of sums of powers of the the roots of the cubic equation characterizing the Tribonacci sequences and derive its relationship with a particular Tribonacci sequence. Then we make a conjecture on the possible…

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…

It appears that, along with many of my friends and colleagues, I had been brainwashed by the great and tragic lives of Abel and Galois to believe that no general formulas are possible for roots of equations higher than quartic. This seemed…

In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.