MATHICSE Technical Report : Bounds for the decay of the entries in inverses and Cauchy- Stieltjes functions of sparse, normal matrices
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper presents an algorithm and its implementation in the software package NCSOStools for finding sums of Hermitian squares and commutators decompositions for polynomials in noncommuting variables. The algorithm is based on noncommutative analogs of t ...
The contragredient transformation A bar right arrow P-1 AP-(inverted perpendicular) , B bar right arrow P-inverted perpendicular BP of two matrices A, B effects simultaneous similarity transformations of the products AB and BA. This work provides structure ...
Gaussian belief propagation (GaBP) is an iterative algorithm for computing the mean (and variances) of a multivariate Gaussian distribution, or equivalently, the minimum of a multivariate positive definite quadratic function. Sufficient conditions, such as ...
For a given skew symmetric real n x n matrix N, the bracket X, Y = XNY - YNX defines a Lie algebra structure on the space Sym(n, N) of symmetric n x n real matrices and hence a corresponding Lie-Poisson structure. The purpose of this paper is to inves ...
Many applications in computational science require computing the elements of a function of a large matrix. A commonly used approach is based on the the evaluation of the eigenvalue decomposition, a task that, in general, involves a computing time that scal ...
We construct families of integrable systems that interpolate between -dimensional harmonic oscillators and Neumann systems. This is achieved by studying a family of integrable systems generated by the Casimir functions of the Lie algebra of real skew-symme ...
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of th ...
n this paper we present an architecture for an MMSE filter matrix computation unit for signal detection in MIMO-OFDM communication systems. We propose to compute the required matrix inverse based on a Cholesky decomposition, followed by a Gauss-Jordan matri ...
We observe that polynomial measure modifications for families of univariate orthogonal polynomials imply sparse connection coefficient relations. We therefore propose connecting L (2) expansion coefficients between a polynomial family and a modified family ...
In this work we first focus on the Stochastic Galerkin approximation of the solution u of an elliptic stochastic PDE. We rely on sharp estimates for the decay of the coefficients of the spectral expansion of u on orthogonal polynomials to build a sequence ...
