Related papers: Characterization of deferred type statistical conv…
In this paper we consider a large class of many-variable polynomials which contains generalisations of the classical Hermite, Laguerre, Jacobi and Bessel polynomials as special cases, and which occur as the polynomial part in the…
We propose accelerated versions of the operator Sinkhorn iteration for operator scaling using successive overrelaxation. We analyze the local convergence rates of these accelerated methods via linearization, which allows us to determine the…
It is well known that not every summability property for non linear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to…
We propose a method for solving constrained fixed point problems involving compositions of Lipschitz pseudo contractive and firmly nonexpansive operators in Hilbert spaces. Each iteration of the method uses separate evaluations of these…
In this paper, we introduce a Stancu type generalization of the q-Favard-Szasz operators, estimate the rates of statistical convergence and study the local approximation properties of these operators.
We present an algorithm to compute $\mathrm{LCLM}$-decompositions for linear differentials operators with coefficients in the rational function field of characteristic $p$, $\mathbb{F}_{p^n}(t)$. We show that for an operator $L$ of order…
Divergence-form operators with random coefficients homogenize over large scales. Over the last decade, an intensive research effort focused on turning this asymptotic statement into quantitative estimates. The goal of this note is to review…
The Chernoff approximation method is a powerful and flexible tool of functional analysis, which allows in many cases to express exp(tL) in terms of variable coefficients of a linear differential operator L. In this paper, we prove a theorem…
Let $\mathbb{P}$ be the complete metric space consisting of positive invertible operators on an infinite-dimensional Hilbert space with the Thompson metric. We introduce the notion of operator means of probability measures on $\mathbb{P}$,…
Iterative algorithms are of utmost importance in decision and control. With an ever growing number of algorithms being developed, distributed, and proprietarized, there is a similarly growing need for methods that can provide classification…
The aim of this paper consists of providing summation formulas for the $k$-Fibonacci numbers ($k \in \mathbb{Z}$, $k \geq 2$) and their asymptotic equivalents in terms of generalized binomial coefficients. Our main tools are the Lagrange…
We consider hyperbolicity preserving operators with respect to a new linear operator representation on $\mathbb{R}[x]$. In essence, we demonstrate that every Hermite and Laguerre multiplier sequence can be diagonalized into a sum of…
Global information about dynamical systems can be extracted by analysing associated infinite-dimensional transfer operators, such as Perron-Frobenius and Koopman operators as well as their infinitesimal generators. In practice, these…
A new type of combinations of Bernstein operators is given in [1]. Here, we introduce another one, which can be used to approximate the functions with singularities. The direct and inverse results of the weighted approximation of this new…
We examine the linear convergence rates of variants of the proximal point method for finding zeros of maximal monotone operators. We begin by showing how metric subregularity is sufficient for linear convergence to a zero of a maximal…
In this paper, we investigate Durrmeyer-type generalizations of maximum-minimum neural network operators. The primary objective of this study is to establish the convergence of these operators in the $L^{p}$ norm for functions $f\in…
Two-grid theory plays a fundamental role in the design and analysis of multigrid methods. This paper is devoted to a new convergence analysis of two-grid methods for singular and symmetric positive semidefinite systems. Specifically, we…
We consider the approximation of weakly T-coercive operators. The main property to ensure the convergence thereof is the regularity of the approximation (in the vocabulary of discrete approximation schemes). In a previous work the existence…
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p <…
We introduce descent methods to the study of strong approximation on algebraic varieties. We apply them to two classes of varieties defined by P(t)=N_{K/k}(z): firstly for quartic extensions of number fields K/k and quadratic polynomials…