Further inequalities involving the Khatri-Rao product

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela Some Inequalities for the Khatri - Rao Product of Matrices

Several inequalities for the Khatri-Rao product of complex positive definite Hermitian matrices are established, and these results generalize some known inequalities for the Hadamard and Khatri-Rao products of matrices.

متن کامل

Inequalities Involving Khatri-rao Products of Positive Semidefinite Hermitian Matrices

In this paper, we obtain some matrix inequalities in Löwner partial ordering for Khatri-Rao products of positive semidefinite Hermitian matrices. Furthermore, we generalize the Oppenheim’s inequality, with which we will improve some recent results.

متن کامل

Matrix Equalities and Inequalities Involving Khatri-rao and Tracy-singh Sums

The Khatri-Rao and Tracy-Singh products for partitioned matrices are viewed as generalized Hadamard and generalized Kronecker products, respectively. We define the KhatriRao and Tracy-Singh sums for partitioned matrices as generalized Hadamard and generalized Kronecker sums and derive some results including matrix equalities and inequalities involving the two sums. Based on the connection betwe...

متن کامل

On the Restricted Isometry of the Columnwise Khatri-Rao Product

The columnwise Khatri-Rao product of two matrices is an important matrix type, reprising its role as a structured sensing matrix in many fundamental linear inverse problems. Robust signal recovery in such inverse problems is often contingent on proving the restricted isometry property (RIP) of a certain system matrix expressible as a Khatri-Rao product of two matrices. In this work, we analyze ...

متن کامل

Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product

The matricized-tensor times Khatri-Rao product (MTTKRP) computation is the typical bottleneck in algorithms for computing a CP decomposition of a tensor. In order to develop high performance sequential and parallel algorithms, we establish communication lower bounds that identify how much data movement is required for this computation in the case of dense tensors. We also present sequential and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2009

ISSN: 0024-3795

DOI: 10.1016/j.laa.2008.12.004