Related papers: Evaluating a double integral using Euler's method …
We extend the classical primal-dual interior point method from the Euclidean setting to the Riemannian one. Our method, named the Riemannian interior point method, is for solving Riemannian constrained optimization problems. We establish…
Sturm-Liouville problems are abundant in the numerical treatment of scientific and engineering problems. In the present contribution, we present an efficient and highly accurate method for computing eigenvalues of singular Sturm-Liouville…
In this paper I give an evaluation of a functional integral by means of a series in functional derivatives, first of all we propose a differential equation of first order and solve it by iterative methods, to obtain a series for the…
Randomization has been applied to Hamiltonian simulation in a number of ways to improve the accuracy or efficiency of product formulas. Deterministic product formulas are often constructed in a symmetric way to provide accuracy of even…
We propose a two-sample extended empirical likelihood for inference on the difference between two p-dimensional parameters defined by estimating equations. The standard two-sample empirical likelihood for the difference is Bartlett…
The calculation of exclusive observables beyond the one-loop level requires elaborate techniques for the computation of multi-leg two-loop integrals. We discuss how the large number of different integrals appearing in actual two-loop…
We study the bias of classical quantile regression and instrumental variable quantile regression estimators. While being asymptotically first-order unbiased, these estimators can have non-negligible second-order biases. We derive a…
We discuss dynamical aspects of an analysis of the two--centre problem started in [15]. The perturbative nature of our approach allows us to foresee applications to the three--body problem.
This article is concerned with a new method for the approximate evaluation of Fourier sine and cosine transforms. We develop and analyse a new quadrature rule for Fourier sine and cosine transforms involving transforming the integral to one…
A novel algorithm is proposed for the interpolation step of the Guruswami-Sudan list decoding algorithm. The proposed method is based on the binary exponentiation algorithm, and can be considered as an extension of the Lee-O'Sullivan…
A well-known problem in computing some matrix functions iteratively is the lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Suppose the matrix exponential…
The quest for an algorithm that solves an $n\times n$ linear system in $O(n^2)$ time complexity, or $O(n^2 \text{poly}(1/\epsilon))$ when solving up to $\epsilon$ relative error, is a long-standing open problem in numerical linear algebra…
An alternative methodology to evaluate two-electron-repulsion integrals based on numerical approximation is proposed. Computational chemistry has branched into two major fields with methodologies based on quantum mechanics and classical…
We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers. The algorithms are much more accurate than the famous fast inverse square root algorithm and have the same or…
A practical and new Runge--Kutta numerical scheme for stochastic differential equations is explored. Numerical examples demonstrate the strong convergence of the method. The first order strong convergence is then proved using Ito integrals…
In this article we present first an algorithm for calculating the determining equations associated with so-called ``nonclassical method'' of symmetry reductions (a la Bluman and Cole) for systems of partial differentail equations. This…
In this paper, we propose and analyze the extrapolation method and asymptotically exact a posterior error estimate for eigenvalues of the Morley element. We establish an asymptotic expansion of eigenvalues, and prove an optimal result for…
In this paper, we consider the Euler method for backward stochastic Volterra integral equations. First, we approximate the original equation by a family of backward stochastic equations (BSDEs, for short). Then we solve the BSDEs by the…
After characterizing the integrable discrete analogue of the Euler's elastica, we focus our attention on the problem of approximating a given discrete planar curve by an appropriate discrete Euler's elastica. We carry out the fairing…
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…