On multivariate trace inequalities of Sutter, Berta, and Tomamichel
Related publications (35)
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.
A Quasi Toeplitz (QT) matrix is a semi-infinite matrix of the kind A=T(a)+E whereT(a)=(aj−i)i,j∈Z+, E=(ei,j)i,j∈Z+ is compact and the norms ∥a∥W=∑i∈Z∣a∣j and $|E|_{ ...
Evaluating the action of a matrix function on a vector, that is x=f(M)v, is an ubiquitous task in applications. When M is large, one usually relies on Krylov projection methods. In this paper, we provide effective choices for the pole ...
We revisit the problem of constraining the weak field limit of the gravitational lagrangian from S-matrix properties. From unitarity and Lorentz invariance of the S-matrix of massless gravitons, we derive on-shell gauge invariance to consist on the transve ...
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar way: Block column by block column, from left to right. The need for such an evaluation scheme arises naturally in the context of option pricing in polynomia ...
Low-rank tensor completion addresses the task of filling in missing entries in multidimensional data. It has proven its versatility in numerous applications, including context aware recommender systems and multivariate function learning. To handle large-sc ...
We analyze an expansion of the generalized block Krylov subspace framework of [Electron.\ Trans.\ Numer.\ Anal., 47 (2017), pp. 100-126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and con ...
Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the expo-nentiated gradient method with Armijo line search always converges to the optimum, if ...
The S=1 Affleck-Kennedy-Lieb-Tasaki (AKLT) quantum spin chain was the first rigorous example of an isotropic spin system in the Haldane phase. The conjecture that the S=3/2 AKLT model on the hexagonal lattice is also in a gapped phase has remained open, de ...
Let B-M : C x C -> C be a bilinear form B-M(p, q) - p(T)Mq, with an invertible matrix M is an element of C-2x2. We prove that any finite set S contained in an irreducible algebraic curve C of degree d in C determines Omega(d)(vertical bar S vertical bar(4/ ...
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured n×n matrix it can be computed in O(n3) operations. An interesting problem arises if the input matrix is a Toeplitz matrix, for exa ...