Related papers: Solving Kepler's equation CORDIC-like
In this paper we introduce the algorithm and the fixed point hardware to calculate the normalized singular value decomposition of a non-symmetric matrices using Givens fast (approximate) rotations. This algorithm only uses the basic…
We present and analyze a discontinuous Galerkin method for the numerical solution of a class of second-order linear mixed-type partial differential equations, i.e. equations that change their nature from elliptic to hyperbolic through the…
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…
We present a simple algebraic procedure that can be applied to solve a range of quantum eigenvalue problems without the need to know the solution of the Schr\"odinger equation. The procedure, presented with a pedagogical purpose, is based…
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…
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 power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
Everybody knows from school how to solve a quadratic equation of the form $x^2-px+q=0$ graphically. But this method can become tedious if several equations ought to be solved, as for each pair $(p,q)$ a new parabola has to be drawn.…
The true- and eccentric-anomaly parametrizations of the Kepler motion are generalized to quasiperiodic orbits by considering perturbations of the radial part of kinetic energy as a series in the negative powers of the orbital radius. A…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…
We present a quantum algorithm to solve systems of linear equations of the form $A\mathbf{x}=\mathbf{b}$, where $A$ is a tridiagonal Toeplitz matrix and $\mathbf{b}$ results from discretizing an analytic function, with a circuit complexity…
The present work proposes a well-balanced finite volume-type numerical method for the solution of non-conservative hyperbolic partial differential equations (PDEs) with source terms. The method is characterized, first, by the use of a…
The purpose of this article is to discuss the circle method and its quantitative role in understanding pointwise almost everywhere convergence phenomena for polynomial ergodic averaging operators. Specifically, we will use the circle method…
We consider a spacetime singularity at $t = 0$ arising in a Kasner-type metric that solves the gravitational equations modified by quantum effects of a conformal field theory (CFT). The resulting constraints can be solved efficiently when…
We provide a quasilinear time algorithm for the $p$-center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the graph $G=(V,E)$ with $n$ vertices, $m$ edges and hyperbolic…
For general finite temperature different from the Hawking one there appears a well known conical singularity in the Euclidean classical solution of gravitational equations. The method of regularizing the cone by regular surface is used to…
In this paper, we propose new linearly convergent second-order methods for minimizing convex quartic polynomials. This framework is applied for designing optimization schemes, which can solve general convex problems satisfying a new…
In this paper we develop convergence and acceleration theory for Anderson acceleration applied to Newton's method for nonlinear systems in which the Jacobian is singular at a solution. For these problems, the standard Newton algorithm…