Computing mixed Schatten norm of completely positive maps

Computing p → q norm for matrices is a classical problem in computational mathematics and power iteration is a well-known method for computing p → q norm for a matrix with nonnegative entries. Here we define an equivalent iteration method for computing S_p → S_q norm for completely positive maps where S_p is the Schatten p norm. We generalize almost all of the definitions, properties, lemmas, etc. in the matrix setting to completely positive maps and prove an important theorem in this setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2020

Computing the norm of nonnegative matrices and the log-Sobolev constant of Markov chains

We analyze the global convergence of the power iterates for the computat...
research
03/25/2022

On the performance of preconditioned methods to solve L^p-norm phase unwrapping

In this paper, we analyze and evaluate suitable preconditioning techniqu...
research
05/20/2020

Monte Carlo Estimators for the Schatten p-norm of Symmetric Positive Semidefinite Matrices

We present numerical methods for computing the Schatten p-norm of positi...
research
03/20/2013

Algorithms for Irrelevance-Based Partial MAPs

Irrelevance-based partial MAPs are useful constructs for domain-independ...
research
01/25/2019

The conjugate gradient algorithm on well-conditioned Wishart matrices is almost deteriministic

We prove that the number of iterations required to solve a random positi...
research
06/23/2022

Hausdorff Distance between Norm Balls and their Linear Maps

We consider the problem of computing the (two-sided) Hausdorff distance ...
research
11/19/2021

Impact of spatial coarsening on Parareal convergence

We study the impact of spatial coarsening on the convergence of the Para...

Please sign up or login with your details

Forgot password? Click here to reset