Related papers: Evaluation of complex-valued error-like functions …
An exponential time-integrator scheme of second-order accuracy based on the predictor-corrector methodology, denoted PCEXP, is developed to solve multi-dimensional nonlinear partial differential equations pertaining to fluid dynamics. The…
Forward-backward methods are a very useful tool for the minimization of a functional given by the sum of a differentiable term and a nondifferentiable one and their investigation has experienced several efforts from many researchers in the…
Computational efficient evaluation of penalized estimators of multivariate exponential family distributions is sought. These distributions encompass among others Markov random fields with variates of mixed type (e.g. binary and continuous)…
Two quadrature-based algorithms for computing the matrix fractional power $A^\alpha$ are presented in this paper. These algorithms are based on the double exponential (DE) formula, which is well-known for its effectiveness in computing…
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…
We present a generic scheme to construct corrected trapezoidal rules with spectral accuracy for integral operators with weakly singular kernels in arbitrary dimensions. We assume that the kernel factorization of the form,…
In this paper we will discuss two variants of an inexact feasible interior point algorithm for convex quadratic programming. We will consider two different neighbourhoods: a (small) one induced by the use of the Euclidean norm which yields…
A computationally efficient method to solve non-convex programming problems with linear equality constraints is presented. The proposed method is based on a recursively feasible and descending sequential convex programming procedure proven…
In this paper, we propose a numerical method for computing Hadamard finite-part integrals with an integral-power singularity at an endpoint, the part of the divergent integral which is finite as a limiting procedure. In the proposed method,…
An a posteriori estimate for the error of a standard Krylov approximation to the matrix exponential is derived. The estimate is based on the defect (residual) of the Krylov approximation and is proven to constitute a rigorous upper bound on…
A problem of identification of piecewise-constant unknown parameters of a linear regression equation (LRE) is considered. Such parameters change their values over the interval of the regressor finite (rather than persistent) excitation. To…
Value function approximation has demonstrated phenomenal empirical success in reinforcement learning (RL). Nevertheless, despite a handful of recent progress on developing theory for RL with linear function approximation, the understanding…
We prove simple general formulas for expectations of functions of a L\'evy process and its running extremum. Under additional conditions, we derive analytical formulas using the Fourier/Laplace inversion and Wiener-Hopf factorization, and…
In this article, we analyse the Kantorovich type exponential sampling operators and its linear combination. We derive the Voronovskaya type theorem and its quantitative estimates for these operators in terms of an appropriate K-functional.…
Take a random variable X with some finite exponential moments. Define an exponentially weighted expectation by E^t(f) = E(e^{tX}f)/E(e^{tX}) for admissible values of the parameter t. Denote the weighted expectation of X itself by r(t) =…
In this paper, we introduce a multiscale framework based on adaptive edge basis functions to solve second-order linear elliptic PDEs with rough coefficients. One of the main results is that we prove the proposed multiscale method achieves…
We study the convergence analysis of continuous-time dynamical systems associated with optimization methods for strongly convex functions. Recent works have proposed systematic constructions of Lyapunov functions for such analysis, while…
Value Iteration is a widely used algorithm for solving Markov Decision Processes (MDPs). While previous studies have extensively analyzed its convergence properties, they primarily focus on convergence with respect to the infinity norm. In…
A common technique in reinforcement learning is to evaluate the value function from Monte Carlo simulations of a given policy, and use the estimated value function to obtain a new policy which is greedy with respect to the estimated value…
First-order methods are often analyzed via their continuous-time models, where their worst-case convergence properties are usually approached via Lyapunov functions. In this work, we provide a systematic and principled approach to find and…