Related papers: Solving Kepler's equation with CORDIC double itera…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
The two-body Coulomb scattering problem is solved using the standard complex scaling method. The explicit enforcement of the scattering boundary condition is avoided. Splitting of the scattering wave function based on the Coulomb modified…
This paper describes the design and simulation of an 8-bit dedicated processor for calculating the Sine and Cosine of an Angle using CORDIC Algorithm (COordinate Rotation DIgital Computer), a simple and efficient algorithm to calculate…
We propose a novel approach to solve K-adaptability problems with convex objective and constraints and integer first-stage decisions. A logic-based Benders decomposition is applied to handle the first-stage decisions in a master problem,…
The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
The compensated quotient-difference (Compqd) algorithm is proposed along with some applications. The main motivation is based on the fact that the standard quotient-difference (qd) algorithm can be numerically unstable. The Compqd algorithm…
The classical Dinkelbach method (1967) solves fractional programming via a parametric approach, generating a decreasing upper bound sequence that converges to the optimum. Its important variant, the interval Dinkelbach method (1991),…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…
An algebraic non-perturbative approach is proposed for the analytical treatment of Schr\"{o}dinger equations with a potential that can be expressed in terms of an exactly solvable piece with an additional potential. Avoiding disadvantages…
Closed-Form Kepler solutions in projective coordinates are used to define a corresponding set of eight orbit elements and obtain their governing equations for arbitrarily-perturbed two-body dynamics. The elements and their dynamics are…
We derive the Cardano formula of cubic equations by completing the cube, and provide radical solutions to some algebraic equations of higher degree by completing powers. The main idea of completing powers arises from Harrison's center…
This document describes an algorithm to scale a complex vector by the reciprocal of a complex value. The algorithm computes the reciprocal of the complex value and then scales the vector by the reciprocal. Some scaling may be necessary due…
The coordinate rotation digital computer (CORDIC) is a shift-add based fast computing algorithm which has been found in many digital signal processing (DSP) applications. In this paper, a detailed error analysis based on mean square error…
In this paper, we present an iterative three-point method with memory based on the family of King's methods to solve nonlinear equations. This proposed method has eighth order convergence and costs only four function evaluations per…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
A mathematical model is given for the occurrence of preferred orbits and orbital velocities in a Keplerian system. The result can be extended into energies and other properties of physical systems. The values given by the model fit closely…
Quantum algorithms are built enabling to find Poincar\'e recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of…
The time integration of semilinear parabolic problems by exponential methods of different kinds is considered. A new algorithm for the implementation of these methods is proposed. The algorithm evaluates the operators required by the…
We obtain the rigorous WKB expansion to all orders for the radial Kepler problem, using the residue calculus in evaluating the WKB quantization condition in terms of a complex contour integral in the complexified coordinate plane. The…