Related papers: Solving Kepler's equation via Smale's $\alpha$-the…
The classical Kramer sampling theorem establishes general conditions that allow the reconstruction of functions by mean of orthogonal sampling formulae. One major task in sampling theory is to find concrete, non trivial realizations of this…
Given a fixed $\alpha \in (0,1)$, we study the inverse problem of recovering the isometry class of a smooth closed and connected Riemannian manifold $(M,g)$, given the knowledge of a source-to-solution map for the fractional Laplace…
In this work we analyze a solution that mimics the Bardeen solution with a cosmological constant surrounded by quintessence. We show that this solution can be obtained by Einstein equations coupled with nonlinear electrodynamics. We also…
A new method for solving the Bethe-Salpeter equation is developed. It allows to find the Bethe-Salpeter amplitudes both in Minkowski and in Euclidean spaces and, as a by product, the light-front wave function. The method is valid for any…
We propose a fast proximal Newton-type algorithm for minimizing regularized finite sums that returns an $\epsilon$-suboptimal point in $\tilde{\mathcal{O}}(d(n + \sqrt{\kappa d})\log(\frac{1}{\epsilon}))$ FLOPS, where $n$ is number of…
Building on a classification of zeros of cubic equations due to the $12$-th century Persian mathematician Sharaf al-Din Tusi, together with Smale's theory of {\it point estimation}, we derive an efficient recipe for computing high-precision…
We apply Feynman's principle, ``The same equations have the same solutions'', to Kepler's problem and show that Newton's dynamics in a properly curved 3-D space is identical with that described by Einstein's theory in the 3-D optical…
We consider an algorithm to approximate complex-valued periodic functions $f(e^{i\theta})$ as a matrix element of a product of $SU(2)$-valued functions, which underlies so-called quantum signal processing. We prove that the algorithm runs…
We consider the problem of approximation of a continuous function $f$ defined on a compact metric space $X$ by elements from a sum of two algebras. We prove a de la Vall\'{e}e Poussin type theorem, which estimates the approximation error…
In this paper we design a new primal-dual algorithm for the classic discrete optimization problem of maximizing a monotone submodular function subject to a cardinality constraint achieving the optimal approximation of $(1-1/e)$. This…
In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the…
A highly efficient and simple to implement Monte Carlo algorithm is proposed for the evaluation of the Renyi entanglement entropy(REE) of quantum dimer model(QDM) at the Rokhsar-Kivelson(R-K) point. It makes possible the evaluation of REE…
We extend the domain of the Karcher mean $\Lambda$ of positive operators on a Hilbert space to $L^1$-Borel probability measures on the cone of positive operators equipped with the Thompson part metric. We establish existence and uniqueness…
The Simpson's formula is obtained by approximating the integral of a function on some interval by the integral of the quadratic polynomial determined by the function. However, a multidimensional analogue of the formula has not been given as…
We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…
Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…
In this paper, we propose a monotone approximation scheme for a class of fully nonlinear degenerate partial integro-differential equations (PIDEs) which characterize the nonlinear $\alpha$-stable L\'{e}vy processes under sublinear…
Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path…