相关论文: On the final limit of a transition matrix
An algorithm is presented for approximating arbitrary powers of a black box unitary operation, $\mathcal{U}^t$, where $t$ is a real number, and $\mathcal{U}$ is a black box implementing an unknown unitary. The complexity of this algorithm…
In this article, we introduce an ergodic optimization problem inspired by information theory, which can be presented informally as follows: given a factor map $\pi : (X, T) \to (Y, S)$ of topological dynamical systems, and a continuous…
Until now, Computer Scientists have concerned themselves with identifying efficient algorithms for solving the general case of some problem -- that is finding one which performs well when the size of the input tends to infinity. In this…
Entropy rate of sequential data-streams naturally quantifies the complexity of the generative process. Thus entropy rate fluctuations could be used as a tool to recognize dynamical perturbations in signal sources, and could potentially be…
We show that for many complex parameters a, the set of points that converge to infinity under iteration of the exponential map f(z)=e^z+a is connected. This includes all parameters for which the singular value escapes to infinity under…
The paper presents theorems on the calculation of the index of a singular point and at the infinity of monotone type mappings. These theorems cover basic cases when the principal linear part of a mapping is degenerate. Applications of these…
In this paper, an estimation of lower bound of topological entropy for coupled-expanding systems associated with transition matrices in compact Hausdorff spaces is given. Estimations of upper and lower bounds of topological entropy for…
Several interesting formulas concerning finite Hilbert transform and logarithmic integrals are proved with application in determining equilibrium measures, planar limits of analytic random matrix models with $1-$cut potential and solving…
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…
We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…
The aim of this paper is to propose an efficient adaptive finite element method for eigenvalue problems based on the multilevel correction scheme and inverse power method. This method involves solving associated boundary value problems on…
We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…
In this paper, we study an adaptive finite element method for multiple eigenvalue problems of a class of second order elliptic equations. By using some eigenspace approximation technology and its crucial property which is also presented in…
This paper presents new variants of the averaged alternating modified reflections (AAMR) method for the best approximation problem. Under a mild constraint qualification, we first show its weak convergence and then establish a convergence…
For a variant of the algorithm in [Pit19] (arXiv:1903.10816) to compute the approximate density or distribution function of a linear mixture of independent random variables known by a finite sample, it is presented a proof of the functional…
We derive a closed-form expression for the finite predictor coefficients of multivariate ARMA (autoregressive moving-average) processes. The expression is given in terms of several explicit matrices that are of fixed sizes independent of…
We provide a precise coupling of the finite circular beta ensembles and their limit process via their operator representations. We prove explicit bounds on the distance of the operators and the corresponding point processes. We also prove…
We consider the characterization and computation of H-infinity norms for a class of time-delay systems. It is well known that in the finite dimensional case the H-infinity norm of a transfer function can be computed using the connections…
We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.