Related papers: Diverging orbits for the Ehrlich-Aberth and the We…

The dual configuration of the original one is proposed for the orbit design of Taiji spacecrafts. In terms of these two configurations of Taiji, an algorithm is devised to expand the unperturbed Keplerian orbits of spacecrafts to infinite…

A new algebraic method to find two special types of exact traveling wave solutions and the solitary type solutions to some conformable fractional partial differential equations is proposed. The two special types of solutions given by the…

We consider divergent orbits of the group of diagonal matrices in the space of lattices in Euclidean space. We define two natural numerical invariants of such orbits: The discriminant - an integer - and the type - an integer vector. We then…

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.

We find all spectral type differential equations satisfied by the symmetric generalized ultraspherical polynomials which are orthogonal on the interval [-1,1] with respect to the classical symmetric weight function for the Jacobi…

Quaternions, introduced by Hamilton in 1843 as a generalization of complex numbers, have found, in more recent years, a wealth of applications in a number of different areas which motivated the design of efficient methods for numerically…

The Eberlein method is a Jacobi-type process for solving the eigenvalue problem of an arbitrary matrix. In each iteration two transformations are applied on the underlying matrix, a plane rotation and a non-unitary elementary…

We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…

The method of geodesic deviations provides analytic approximations to geodesics in arbitrary background space-times. As such the method is a useful tool in many practical situations. In this note we point out some subtleties in the…

In gravitational microlensing formalism and for modeling binary light curves, the key step is solving the binary lens equation. Currently, a combination of the Newton's and Laguerre's methods which was first introduced by Skowron \& Gould…

We present four types of infinitely many exactly solvable Fokker-Planck equations, which are related to the newly discovered exceptional orthogonal polynomials. They represent the deformed versions of the Rayleigh process and the Jacobi…

We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…

We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…

Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…

This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…

In this paper, we prove some general convergence theorems for the Picard iteration in cone metric spaces over a solid vector space. As an application, we provide a detailed convergence analysis of the Weierstrass iterative method for…

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…

The Gibbons-Werner method for the gravitational deflection angle of unbound particles in static spherically symmetric spacetimes is based on Jacobi metric and Gauss-Bonnet theorem. When it is extended to bound massive particles, there…