Related papers: Solving Kepler's equation with CORDIC double itera…
Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause…
We explain the solution of the following two problems: obtaining of Kepler's laws from Newton's laws (so called two bodies problem) and obtaining the fourth Newton's law (the formula for gravitation) as a corollary of Kepler's laws. This…
Different approaches to solve the spinor-spinor Bethe-Salpeter (BS) equation in Euclidean space are considered. It is argued that the complete set of Dirac matrices is the most appropriate basis to define the partial amplitudes and to solve…
In this paper, an efficient method is presented for solving three dimensional Volterra integral equations of the second kind with continuous kernel. Shifted Chebyshev polynomial is applied to approximate a solution for these integral…
A method is introduced for solving Einstein's equations using two distinct coordinate systems. The coordinate basis vectors associated with one system are used to project out components of the metric and other fields, in analogy with the…
Symplectic integrators separate a problem into parts that can be solved in isolation, alternately advancing these sub-problems to approximate the evolution of the complete system. Problems with a single, dominant mass can use mixed-variable…
The paper studies the existence of periodic solutions of a perturbed relativistic Kepler problem of the type \begin{equation*} \dfrac{\mathrm{d}}{\mathrm{d}t}\left(\frac{m\dot{x}}{\sqrt{1-|\dot{x}|^{2}/c^{2}}}\right) =…
The Dirac equation for H$_2^+$ is solved numerically using an iterative method proposed by Kutzelnigg [Z. Phys. 11, 15 (1989]. The four-component wavefunction is expanded in a newly introduced kinetically balanced exponential basis set. The…
In this paper we propose a generic algorithm to calculate the rotation parameters of CORDIC angles required for the Discrete Cosine Transform algorithm (DCT). This leads us to increase the precision of calculation meeting any accuracy.Our…
In this paper, a double-pivot simplex method is proposed. Two upper bounds of iteration numbers are derived. Applying one of the bounds to some special linear programming (LP) problems, such as LP with a totally unimodular matrix and Markov…
Instead of using local field equations - like the Dirac equation for spin-1/2 and the Klein-Gordon equation for spin-0 particles - one could try to use non-local field equations in order to describe scattering processes. The latter…
This paper presents new quadrature rules for functions in a reproducing kernel Hilbert space using nodes drawn by a sampling algorithm known as randomly pivoted Cholesky. The resulting computational procedure compares favorably to previous…
In this paper, we propose a novel Anderson's acceleration method to solve nonlinear equations, which does \emph{not} require a restart strategy to achieve numerical stability. We propose the greedy and random versions of our algorithm.…
We develop a novel primal-dual algorithm to solve a class of nonsmooth and nonlinear compositional convex minimization problems, which covers many existing and brand-new models as special cases. Our approach relies on a combination of a new…
An iterative formula based on Newton Method alone is presented for the iterative solutions of equations that ensures convergence in cases where the traditional Newton Method may fail to converge to the desired root. In addition, the method…
The LMS algorithm is one of the most successful adaptive filtering algorithms. It uses the instantaneous value of the square of the error signal as an estimate of the mean-square error (MSE). The LMS algorithm changes (adapts) the filter…
We present a family of modified Hermite integrators of arbitrary order possessing superior behaviour for the integration of Keplerian and near-Keplerian orbits. After recounting the derivation of Hermite N-body integrators of arbitrary…
This paper presents a modified iterative approach to solve the variational inequality problem using the double inertial technique in the context of a real Hilbert space. Our iterative technique involves a projection onto a generalized…
This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a…
We present experimental and theoretical results on a method that applies a numerical solver iteratively to solve several non-negative quadratic programming problems in geometric optimization. The method gains efficiency by exploiting the…