Related papers: An Algorithm for Solving Solvable Polynomial Equat…
We present an empirical-yet-rigorous approach for solving a wide class of functional equations, thereby automating many results that previously required considerable human ingenuity and human labor.
We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…
Suppose that $f(x)=x^4+Ax^3+Bx^2+Ax+1\in {\mathbb Z}[x]$. We say that $f(x)$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\theta^3\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…
In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of…
The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…
After Abel Ruffini theorem and Galois Theory the search for a method or formula to solve quintic equation ends. This paper discuss about the radical solution of quintic equation using a method that could be proved in some simple steps. A…
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 our preceding paper, we have proposed an algorithm for obtaining finite-norm solutions of higher-order linear ordinary differential equations of the Fuchsian type [\sum_m p_m (x) (d/dx)^m] f(x) = 0 (where p_m is a polynomial with…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…
Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…
In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…
In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…
Let $f(x)=x^{12}+ax^6+b \in \mathbb{Q}[x]$ be an irreducible polynomial, $g_4(x)=x^4+ax^2+b$, $g_6(x)=x^6+ax^3+b$, and let $G_4$ and $G_6$ be the Galois group of $g_4(x)$ and $g_6(x)$, respectively. Building upon known characterizations of…
The paper deals with the resolution of third and fourth degree equations by means of radicals. It is a survey of some historical details about this fundamental problem. Moreover, it explains practical methods for the resolution of third and…
The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. In a recent work [A. Sidi, Generalization of the secant method for nonlinear equations. {\em Appl. Math. E-Notes},…
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm BISOLVE. BISOLVE is a classical elimination method which first projects the solutions of a system onto the $x$-…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings…