Related papers: Solving Kepler's equation with CORDIC double itera…
This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…
Years ago S. Weinberg suggested the "Quasi-Particle" method (Q-P) for iteratively solving an integral equation, based on an expansion in terms of sturmian functions that are eigenfunctions of the integral kernel. An improvement of this…
The accelerated Kepler problem is obtained by adding a constant acceleration to the classical two-body Kepler problem. This setting models the dynamics of a jet-sustaining accretion disk and its content of forming planets as the disk loses…
In a recent MNRAS article, Raposo-Pulido and Pelaez (RPP) designed a scheme for obtaining very close seeds for solving the elliptic Kepler Equation with the classical and the modified Newton-Rapshon methods. This implied an important…
Convergence problems in coupled-cluster iterations are discussed, and a new iteration scheme is proposed. Whereas the Jacobi method inverts only the diagonal part of the large matrix of equation coefficients, we invert a matrix which also…
We consider secular perturbations of nearly Keplerian two-body motion under a perturbing potential that can be approximated to sufficient accuracy by expanding it to second order in the coordinates. After averaging over time to obtain the…
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…
This paper analyzes a special instance of nonsymmetric algebraic matrix Riccati equations arising from transport theory. Traditional approaches for finding the minimal nonnegative solution of the matrix Riccati equations are based on the…
A series of robust and optimal mixed methods based on two mixed formulations of the fourth-order elliptic singular perturbation problem are developed in this paper. First, a mixed method based on a second-order system is proposed without…
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
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…
For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…
A popular intermediary in the theory of artificial satellites is obtained after the elimination of parallactic terms from the J2-problem Hamiltonian. The resulting quasi-Keplerian system is in turn converted into the Kepler problem by a…
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…
The sufficient conditions for existence and uniqueness of continuous solutions of the Volterra operator equations of the first kind with piecewise continuous kernel are derived. The asymptotic approximation of the parametric family of…
We study analytically and experimentally certain symplectic and time-reversible N-body integrators which employ a Kepler solver for each pair-wise interaction, including the method of Hernandez & Bertschinger (2015). Owing to the Kepler…
The hodograph of the Kepler-Coulomb problem, that is, the path traced by its velocity vector, is shown to be a circle and then it is used to investigate other properties of the motion. We obtain the configuration space orbits of the problem…
The inverse power method is a numerical algorithm to obtain the eigenvectors of a matrix. In this work, we develop an iteration algorithm, based on the inverse power method, to numerically solve the Schr\"odinger equation that couples an…
In many applications and physical phenomena, bivariate signals are polarized, i.e. they trace an elliptical trajectory over time when viewed in the 2D planes of their two components. The smooth evolution of this elliptical trajectory,…
We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…