Related papers: Weak convergence of the periodic multiplicative Se…

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

The quantum mechanical weak value $A_w=\left\langle \phi|A|\psi \right \rangle / \left\langle \phi | \psi \right\rangle$ of an observable $A$ is a measurable quantity associated with an observable $A$ and pre- and post-selected states…

Mirror fermions with masses around the weak scale could break dynamically the electroweak symmetry if they were coupled with a new strong interaction. The purpose of this talk is to show what sort of dynamics are needed in order to render…

This paper presents an algorithm tailored for the efficient recovery of sparse probability measures incorporating $\ell_0$-sparse regularization within the probability simplex constraint. Employing the Bregman proximal gradient method, our…

We study the discrete eigenvalues emerging from the threshold of the essential spectrum of one or two-dimensional Schr\"odinger operators with complex-valued $ L^p $-potentials in a weak coupling regime. We derive necessary and sufficient…

We define a new notion of weak containment for joinings, and we show that this notion implies an inequality between relative Rokhlin entropies. This leads to new upper bounds to Rokhlin entropy. We also use this notion to study how Pinsker…

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

Matrix completion is a well-studied problem with many machine learning applications. In practice, the problem is often solved by non-convex optimization algorithms. However, the current theoretical analysis for non-convex algorithms relies…

It is shown how mixed finite element methods for symmetric positive definite eigenvalue problems related to partial differential operators can provide guaranteed lower eigenvalue bounds. The method is based on a classical compatibility…

A novel algorithm for the recovery of low-rank matrices acquired via compressive linear measurements is proposed and analyzed. The algorithm, a variation on the iterative hard thresholding algorithm for low-rank recovery, is designed to…

In the past decades, weak convergence theory for stochastic processes has become a standard tool for analyzing the asymptotic properties of various statistics. Routinely, weak convergence is considered in the space of bounded functions…

In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…

We establish spectral convergence results of approximations of unbounded non-selfadjoint linear operators with compact resolvents by operators that converge in generalized strong resolvent sense. The aim is to establish general assumptions…

We offer an umbrella type result which extends weak convergence of the classical empirical process on the line to that of more general processes indexed by functions of bounded variation. This extension is not contingent on the type of…

Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…

Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…

In recent years weak values have been used to explore interesting quantum features in novel ways. In particular, the real part of the weak value of the momentum operator has been widely studied, mainly in connection with (nonlocal) Bohmian…

Convergence of the Kalman filter is best analyzed by studying the contraction of the Riccati map in the space of positive definite (covariance) matrices. In this paper, we explore how this contraction property relates to a more fundamental…

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem. We obtain the first provably good…

We prove the method of power iteration for matrices with at most finite entries from the Levi-Civita field $\mathcal C$ under the assumption that there exists an eigenvalue with the strictly largest in absolute value complex part. In this…