Related papers: On the Complete Solution to the Most General Fifth…
In this paper a new method which is a generalization of the Ehrlich-Kjurkchiev method is developed. The method allows to find simultaneously all roots of the algebraic equation in the case when the roots are supposed to be multiple with…
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…
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…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…
In this article we give solution of the general quintic equation by means of the Rogers-Ramanujan continued fraction. More precisely we express a root of the quintic as a known algebraic function of the Rogers-Ramanujan continued fraction.
According to the Abel-Ruffini theorem, equations of degree equal to or greater than 5 cannot, in most cases, be solved by radicals. Due of this theorem we will present a formula that solves specific cases of sixth degree equations using…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We give the hypergeometric solutions of some algebraic equations including the general fifth degree equation.
The quintic equation with real coefficients $$x^5+5ax^3+5a^2x+b=0$$ is solved in terms of radicals and the results used to sum a hypergeometric series for several arguments.
Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…
In this paper, a family of variable-coefficient fifth-order KdV equations has been considered. By using an infinitesimal method based on the determination of the equivalence group, differential invariants and invariant equations are…
We present a scheme for finding all roots of an analytic function in a square domain in the complex plane. The scheme can be viewed as a generalization of the classical approach to finding roots of a function on the real line, by first…
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.
By introducing the generalized master function of order up to four together with corresponding weight function, we have obtained all quasi-exactly solvable second order differential equations. It is shown that these differntial equations…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
In this paper, we focus on clarifying the concept of solving equations of degree greater than six using continuous functions or hypergeometric functions and providing another proof of the non-existence of algebraic solutions for equations…
The generic monic polynomial of sixth degree features 6 a priori arbitrary coefficients. We show that if these 6 coefficients are appropriately defined in two different ways|in terms of 5 arbitrary parameters, then the 6 roots of the…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…