Related papers: Solving Kepler's equation CORDIC-like
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
Starting with an exact and simple geodesic, we generate approximate geodesics by summing up higher-order geodesic deviations within a General Relativistic setting, without using Newtonian and post-Newtonian approximations. We apply this…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
A pure two-body problem has seven integrals including the Kepler energy, the Laplace vector, and the angular momentum vector. However, only five of them are independent. When the five independent integrals are preserved, the two other…
We present a simple method to obtain the solution of a few orbital problems: the Kepler problem, the modified Kepler problem by the addition of an inverse square potential and linear force.
We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP. We…
The complete elliptic integral of the first and second kind, K(k) and E(k), appear in a multitude of physics and engineering applications. Because there is no known closed-form, the exact values have to be computed numerically. Here,…
A new anomaly detection method called kernel outlier detection (KOD) is proposed. It is designed to address challenges of outlier detection in high-dimensional settings. The aim is to overcome limitations of existing methods, such as…
We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…
Outlier recognition is a fundamental problem in data analysis and has attracted a great deal of attention in the past decades. However, most existing methods still suffer from several issues such as high time and space complexities or…
Standard discontinuous Galerkin methods, based on piecewise polynomials of degree $ \qq=0,1$, are considered for temporal semi-discretization for second order hyperbolic equations. The main goal of this paper is to present a simple and…
The asymptotic iteration method is used to find exact and approximate solutions of Schroedinger's equation for a number of one-dimensional trigonometric potentials (sine-squared, double-cosine, tangent-squared, and complex cotangent).…
Single scale quantities, as anomalous dimensions and hard scattering cross sections, in renormalizable Quantum Field Theories are found to obey difference equations of finite order in Mellin space. It is often easier to calculate fixed…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
Solution of Helmholtz equation with impedance boundary condition on finite interval is equivalently reformulated as steady state of initial boundary value problem for first order hyperbolic system of partial differential equations.…
The paper suggests a preconditioning type method for fast solving of elliptic equations with oscillating quasiperiodic coefficients $A_\epsilon$ specified by the small parameter $\epsilon>0$. We use an iteration method generated by an…
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.…