相关论文: On the decay of the off-diagonal singular values i…

In this article, we investigate systems of generalized Schr\"odinger operators and their fundamental matrices. More specifically, we establish the existence of such fundamental matrices and then prove sharp upper and lower exponential decay…

Traces of inverse powers of a positive definite symmetric tridiagonal matrix give lower bounds of the minimal singular value of an upper bidiagonal matrix. In a preceding work, a formula for the traces which gives the diagonal entries of…

We give an intuitive method--using local, cyclic replica symmetry--to isolate exponential tree decay in truncated (connected) correlations. We give an expansion and use the symmetry to show that all terms vanish, except those displaying…

Decomposing tensors into orthogonal factors is a well-known task in statistics, machine learning, and signal processing. We study orthogonal outer product decompositions where the factors in the summands in the decomposition are required to…

In this paper we study nonlinear problems for Ornstein-Uhlenbeck operators \begin{align*} A\triangle v(x) + \left\langle Sx,\nabla v(x)\right\rangle + f(v(x)) = 0,\,x\in\mathbb{R}^d,\,d\geqslant 2, \end{align*} where the matrix…

A condition which guaranties the exponential decay of the solutions of the initial-boundary value problem for the damped wave equation is proved. A method for the effective computability of the coefficient of exponential decay is also…

In this paper, we are interested in matrix valued orthogonal polynomials on the real line with respect to exponential weights. We obtain strong asymptotics as the degree tends to infinity in different regions of the complex plane, as well…

The eigenvalue equation of a band or a block tridiagonal matrix, the tight binding model for a crystal, a molecule, or a particle in a lattice with random potential or hopping amplitudes: these and other problems lead to three-term…

Given (orthonormal) approximations $\tilde{U}$ and $\tilde{V}$ to the left and right subspaces spanned by the leading singular vectors of a matrix $A$, we discuss methods to approximate the leading singular values of $A$ and study their…

We prove a descent theorem of nearby cycle formula for Newton non-degenerate functions at the origin as well as its motivic version (without assuming the convenience condition). This is used in some papers without any proof although its…

Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…

Solving differential equations is one of the most computationally expensive problems in classical computing, occupying the vast majority of high-performance computing resources devoted towards practical applications in various fields of…

The cyclic reduction (CR) algorithm is an efficient method for solving quadratic matrix equations that arise in quasi-birth-death (QBD) stochastic processes. However, its convergence is not guaranteed when the associated matrix polynomial…

Considering a two-by-two block operator matrix system of Maxwell type, we present an elementary way of deducing exponential stability under minimal smoothness (and boundedness) requirements of the underlying domains when applications are…

We prove exponential decay of transverse correlations in the Spin O(N) model for arbitrary (non-zero) values of the external magnetic field and arbitrary spin dimension N > 1. Our result is new when N > 3, in which case no Lee-Yang theorem…

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

We study an asymptotic behaviour of the principal eigenvalue for an elliptic operator with large advection which is given by a gradient of a potential function. It is shown that the principal eigenvalue decays exponentially under the…

An algorithm of the tensor renormalization group is proposed based on a randomized algorithm for singular value decomposition. Our algorithm is applicable to a broad range of two-dimensional classical models. In the case of a square…

In this work, we present a method to exponentiate non-sparse indefinite low-rank matrices on a quantum computer. Given an operation for accessing the elements of the matrix, our method allows singular values and associated singular vectors…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…