相关论文: Chaotic Root-Finding for a Small Class of Polynomi…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
Conditions are given for the second-order linear differential equation P3 y" + P2 y'- P1 y = 0 to have polynomial solutions, where Pn is a polynomial of degree n. Several application of these results to Schroedinger's equation are…
We deal with a mechanism of generating distributional chaos in planar nonautonomous ODEs and try to measure chaosity in terms of topological entropy. It is based on the interplay between simple periodic solutions. We prove the existence of…
We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…
In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…
in the last decade, studies of chaotic system are more often used for classical choatic system than for quantum chaotic system, there are many ways of observing the chaotic system such us analyzing the frequency with Fourier transform or…
We investigate the structure of solutions of boundary value problems for a one-dimensional nonlinear system of pseudodifferential equations describing the dynamics (rolling) of p-adic open, closed, and open-closed strings for a scalar…
The class of differential-equation eigenvalue problems $-y''(x)+x^{2N+2}y(x)=x^N Ey(x)$ ($N=-1,0,1,2,3,...$) on the interval $-\infty<x<\infty$ can be solved in closed form for all the eigenvalues $E$ and the corresponding eigenfunctions…
We consider new polynomially solvable cases of the well-known Quadratic Assignment Problem involving coefficient matrices with a special diagonal structure. By combining the new special cases with polynomially solvable special cases known…
We determine the roots in F_{q^3} of the polynomial X^{2q^k+1} + X + c for each positive integer k and each c in F_q, where q is a power of 2. We introduce a new approach for this type of question, and we obtain results which are more…
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 consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
In this paper we derive a number of exact solutions of the discrete equation $$x_{n+1}x_{n-1}+x_n(x_{n+1}+x_{n-1})= {-2z_nx_n^3+(\eta-3\delta^{-2}-z_n^2)x_n^2+\mu^2\over (x_n+z_n+\gamma)(x_n+z_n-\gamma)},\eqno(1)$$ where $z_n=n\delta$ and…
In a 2011 paper published in the journal "Asian Journal of Algebra"(see reference[1]), the authors consider, among other equations,the diophantine equations 2xy=n(x+y) and 3xy=n(x+y). For the first equation, with n being an odd positive…
In this note we study the number of real roots of a wide class of random orthogonal polynomials with gaussian coefficients. Using the method of Wiener Chaos we show that the fluctuation in the bulk is asymptotically gaussian, even when the…
There are four division algebras over $\mathbb{R}$, namely real numbers, complex numbers, quaternions, and octonions. Lack of commutativity and associativity make it difficult to investigate algebraic and geometric properties of octonions.…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…