Related papers: Matrix scaling and explicit doubly stochastic limi…
We present a new perspective on the celebrated Sinkhorn algorithm by showing that is a special case of incremental/stochastic mirror descent. In order to see this, one should simply plug Kullback-Leibler divergence in both mirror map and…
Let $X$ be a matrix sampled uniformly from the set of doubly stochastic matrices of size $n\times n$. We show that the empirical spectral distribution of the normalized matrix $\sqrt{n}(X-{\mathbf {E}}X)$ converges almost surely to the…
The $n\times n$ doubly stochastic matrices constitute a polytope in $\mathbb{R}^{n^2}$, and by Birkhoff's theorem, its vertex set coincides with the set of order-$n$ permutation matrices.\\ A tristochastic array is an $n \times n\times n$…
Recently, matrix-valued time series data have attracted significant attention in the literature with the recognition of threshold nonlinearity representing a significant advance. However, given the fact that a matrix is a two-array…
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 define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partial row and column sums extending from each end of the row or…
In many problems in Computational Physics and Chemistry, one finds a special kind of sparse matrices, termed "banded matrices". These matrices, which are defined as having non-zero entries only within a given distance from the main…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
The problem of finding a $k \times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show…
For solving the continuous Sylvester equation, a class of the multiplicative splitting iteration method is presented. We consider two symmetric positive definite splittings for each coefficient matrix of the continuous Sylvester equations…
For an $n\times n$ diagonally dominant matrix $T=(t_{i,j})_{n\times n}$ with positive elements satisfying certain bounding conditions, we propose to use a diagonal matrix $S=(s_{i,j})_{n\times n}$ to approximate the inverse of $T$, where…
An exponential representation of the S-matrix provides a natural framework for understanding the semi-classical limit of scattering amplitudes. While sharing some similarities with the eikonal formalism it differs from it in details.…
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers.…
Given a random matrix A with eigenvalues between -1 and 1, we analyze the number of iterations needed to solve the linear equation (I-A)x=b with the Neumann series iteration. We give sufficient conditions for convergence of an upper bound…
The problem of the limit shape of large alternating sign matrices (ASMs) is addressed by studying the emptiness formation probability (EFP) in the domain-wall six-vertex model. Assuming that the limit shape arises in correspondence to the…
Several methods for computing the action of the matrix exponential $\mathrm{e}^{\boldsymbol{A}} \boldsymbol{b}$ are expressed by substituting $\boldsymbol{A}$ into a rational approximation of the scalar exponential function. The error of…
An all orders formula for the $S$-matrix for 2 $\rightarrow$ 2 scattering in large N Chern-Simons theory coupled to a fundamental scalar has recently been conjectured. We find a scaling limit of the theory in which the pole in this…
Given a matrix model, by combining the Schwinger-Dyson equations with positivity constraints on its solutions, in the large $N$ limit one is able to obtain explicit and numerical bounds on its moments. This technique is known as…
Using an elaborate set of simulational tools and statistically optimized methods of data analysis we investigate the scaling behavior of the correlation lengths of three-dimensional classical O($n$) spin models. Considering…
Motivated by the recent contribution \cite{BB17} we study the scaling limit behavior of a class of one-dimensional stochastic differential equations which has a unique attracting point subject to a small additional repulsive perturbation.…