The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 61 – 80 of 138

Showing per page

Matrix inequalities involving the Khatri-Rao product

Xian Zhang, Zhong Peng Yang, Chong-Guang Cao (2002)

Archivum Mathematicum

We extend three inequalities involving the Hadamard product in three ways. First, the results are extended to any partitioned blocks Hermitian matrices. Second, the Hadamard product is replaced by the Khatri-Rao product. Third, the necessary and sufficient conditions under which equalities occur are presented. Thereby, we generalize two inequalities involving the Khatri–Rao product.

On a bound on algebraic connectivity: the case of equality

Stephen J. Kirkland, Neumann, Michael, Bryan L. Shader (1998)

Czechoslovak Mathematical Journal

In a recent paper the authors proposed a lower bound on 1 - λ i , where λ i , λ i 1 , is an eigenvalue of a transition matrix T of an ergodic Markov chain. The bound, which involved the group inverse of I - T , was derived from a more general bound, due to Bauer, Deutsch, and Stoer, on the eigenvalues of a stochastic matrix other than its constant row sum. Here we adapt the bound to give a lower bound on the algebraic connectivity of an undirected graph, but principally consider the case of equality in the bound when...

Currently displaying 61 – 80 of 138