A Generalized Singular Value Inequality for Heinz Means

author

Abstract:

In this paper we will generalize a singular value inequality that was proved before. In particular we obtain an inequality for numerical radius as follows: begin{equation*} 2 sqrt{t (1-t)} omega(t A^{nu}B^{1-nu}+(1-t)A^{1-nu}B^{nu}) leq omega(t A + (1- t) B), end{equation*} where, $ A $ and $ B $ are positive semidefinite matrices, $ 0 leq t leq 1 $ and $ 0 leq nu leq frac{3}{2}.$

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Singular Value Inequality for Heinz Means

We prove a matrix inequality for matrix monotone functions, and apply it to prove a singular value inequality for Heinz means recently conjectured by X. Zhan.

full text

Singular Value Inequalities for Heinz Means

We prove a matrix inequality for matrix monotone functions, and apply it to prove a singular value inequality for Heinz means recently conjectured by X. Zhan.

full text

Generalized Singular Value Thresholding

This work studies the Generalized Singular Value Thresholding (GSVT) operator Proxg (·), Proxg (B) = argmin X m ∑

full text

Generalized Singular Value Thresholding

This work studies the Generalized Singular Value Thresholding (GSVT) operator Proxg (·), Proxg (B) = argmin X m ∑

full text

Singular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD)

The singular value decomposition (SVD) is a generalization of the eigen-decomposition which can be used to analyze rectangular matrices (the eigen-decomposition is definedonly for squaredmatrices). By analogy with the eigen-decomposition, which decomposes a matrix into two simple matrices, the main idea of the SVD is to decompose a rectangular matrix into three simple matrices: Two orthogonal m...

full text

Singular value inequality and graph energy change

The energy of a graph is the sum of the singular values of its adjacency matrix. A classic inequality for singular values of a matrix sum, including its equality case, is used to study how the energy of a graph changes when edges are removed. One sharp bound and one bound that is never sharp, for the change in graph energy when the edges of a nonsingular induced subgraph are removed, are establ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 10  issue None

pages  23- 27

publication date 2015-10

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023