Related papers: Explicit and recursive estimates of the Lambert W …
In the context of lattice walk enumeration in cones, we consider the number of walks in the quarter plane with fixed starting and ending points, prescribed step-set and given length. After renormalization, this number may be interpreted as…
We study the linear convergence of Frank-Wolfe algorithms over product polytopes. We analyze two condition numbers for the product polytope, namely the \emph{pyramidal width} and the \emph{vertex-facet distance}, based on the condition…
We propose a group theoretical method to study Isgur-Wise functions. A current matrix element splits into a heavy quark matrix element and an overlap of the initial and final clouds, related to the IW functions, that contain the long…
Despite the impressive numerical performance of the quasi-Newton and Anderson/nonlinear acceleration methods, their global convergence rates have remained elusive for over 50 years. This study addresses this long-standing issue by…
Little is known about the zeros of the Digamma function. Establishing some Weierstrassian infinite product representations for a given regularization of the Digamma function we find interesting sums of its zeros. In addition, we study the…
It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a…
The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…
This paper gives some results for the logarithm of the Riemann zeta-function and its iterated integrals. We obtain a certain explicit approximation formula for these functions. The formula has some applications, which are related with the…
Using only a limited number of computationally expensive functions, we show a way how to construct accurate and computationally efficient approximations of the Colebrook equation for flow friction. The presented approximations are based on…
We study very weak solutions to scalar Euler-Lagrange equations associated with quadratic convex functionals. We investigate whether $W^{1,1}$ solutions are necessarily $W^{1,2}_{\operatorname{loc}}$, which would make the theories by De…
Recent observational indications of an accelerating universe enhance the interest in studying models with a cosmological constant. We investigate cosmological expansion (FRW metric) with $\Lambda>0$ for a general linear equation of state…
We propose two numerical algorithms in the fully nonconvex setting for the minimization of the sum of a smooth function and the composition of a nonsmooth function with a linear operator. The iterative schemes are formulated in the spirit…
Weighted low rank approximation is a fundamental problem in numerical linear algebra, and it has many applications in machine learning. Given a matrix $M \in \mathbb{R}^{n \times n}$, a non-negative weight matrix $W \in \mathbb{R}_{\geq…
We provide a minimax optimal estimation procedure for F and W in matrix valued linear models Y = F W + Z where the parameter matrix W and the design matrix F are unknown but the latter takes values in a known finite set. The proposed finite…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
This paper considers the QBD approximation of a special class of two-dimensional reflecting random walks (2D-RRWs). A typical example of the 2D-RRWs is a two-node Jackson network with cooperative servers. The main contribution of this paper…
The work is devoted to the construction of a new interval arithmetic which would combine algorithmic efficiency and high quality estimation of the ranges of expressions.
For a matrix $W \in \mathbb{Z}^{m \times n}$, $m \leq n$, and a convex function $g: \mathbb{R}^m \rightarrow \mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\{0,1\}^n$. We will study separable convex functions and…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
We introduce the notion of Karamata regular operators, which is a notion of regularity that is suitable for obtaining concrete convergence rates for common fixed point problems. This provides a broad framework that includes, but goes…