Related papers: Solving Kepler's equation CORDIC-like
Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of…
For a set of points in $\mathbb{R}^d$, the Euclidean $k$-means problems consists of finding $k$ centers such that the sum of distances squared from each data point to its closest center is minimized. Coresets are one the main tools…
We propose an algorithm for general nonlinear conic programming which does not require the knowledge of the full cone, but rather a simpler, more tractable, approximation of it. We prove that the algorithm satisfies a strong global…
Determining kinetic rate constants is a highly relevant problem in biochemistry, so various methods have been designed to extract them from experimental data. Such methods have two main components: the experimental apparatus and the…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
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…
Solving complex optimization problems in engineering and the physical sciences requires repetitive computation of multi-dimensional function derivatives. Commonly, this requires computationally-demanding numerical differentiation such as…
In this paper we propose an algorithm for the numerical solution of arbitrary differential equations of fractional order. The algorithm is obtained by using the following decomposition of the differential equation into a system of…
Solving a quadratic equation $P(x)=ax^2+bx+c=0$ with real coefficients is known to middle school students. Solving the equation over the quaternions is not straightforward. Huang and So \cite{Huang} give a complete set of formulas, breaking…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
In this paper, a class of high order numerical schemes is proposed to solve the nonlinear parabolic equations with variable coefficients. This method is based on our previous work [10] for convection-diffusion equations, which relies on a…
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…
We propose to combine the Carleman estimate and the Newton method to solve an inverse source problem for nonlinear parabolic equations from lateral boundary data. The stability of this inverse source problem is conditionally logarithmic.…
We present an algorithm for L1-norm kernel PCA and provide a convergence analysis for it. While an optimal solution of L2-norm kernel PCA can be obtained through matrix decomposition, finding that of L1-norm kernel PCA is not trivial due to…
In this paper, we provide a procedure to solve the eigen solutions of Dirac equation with complicated potential approximately. At first, we solve the eigen solutions of a linear Dirac equation with complete eigen system, which approximately…
We illustrate a completely analytic approach to Mel'nikov theory, which is based on a suitable extension of a classical method, and which is parallel and -- at least in part -- complementary to the standard procedure. This approach can be…
We consider a single particle which is bound by a central potential and obeys the Dirac equation in d dimensions. We first apply the asymptotic iteration method to recover the known exact solutions for the pure Coulomb case. For a…
Two main aims of this paper are to develop a numerical method to solve an inverse source problem for parabolic equations and apply it to solve a nonlinear coefficient inverse problem. The inverse source problem in this paper is the problem…
Given a polynomial $p$ of degree $d$ and a bound $\kappa$ on a condition number of $p$, we present the first root-finding algorithms that return all its real and complex roots with a number of bit operations quasi-linear in $d…
This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…