• Title/Summary/Keyword: positive definite matrices

Search Result 45, Processing Time 0.027 seconds

ON SOME MATRIX INEQUALITIES

  • Lee, Hyun Deok
    • Korean Journal of Mathematics
    • /
    • v.16 no.4
    • /
    • pp.565-571
    • /
    • 2008
  • In this paper we present some trace inequalities for positive definite matrices in statistical mechanics. In order to prove the method of the uniform bound on the generating functional for the semi-classical model, we use some trace inequalities and matrix norms and properties of trace for positive definite matrices.

  • PDF

TWO INEQUALITIES INVOLVING HADAMARD PRODUCTS OF POSITIVE SEMI-DEFINITE HERMITIAN MATRICES

  • Cao, Chong-Guang;Yang, Zhong-Peng;Xian Zhang
    • Journal of applied mathematics & informatics
    • /
    • v.10 no.1_2
    • /
    • pp.101-109
    • /
    • 2002
  • We extend two inequalities involving Hadamard Products of Positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods we different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458-463(2000)] and B.-Y Wang et al in [Lin. Alg. Appl. 302-303: 163-172(1999)] .

Weighted Carlson Mean of Positive Definite Matrices

  • Lee, Hosoo
    • Kyungpook Mathematical Journal
    • /
    • v.53 no.3
    • /
    • pp.479-495
    • /
    • 2013
  • Taking the weighted geometric mean [11] on the cone of positive definite matrix, we propose an iterative mean algorithm involving weighted arithmetic and geometric means of $n$-positive definite matrices which is a weighted version of Carlson mean presented by Lee and Lim [13]. We show that each sequence of the weigthed Carlson iterative mean algorithm has a common limit and the common limit of satisfies weighted multidimensional versions of all properties like permutation symmetry, concavity, monotonicity, homogeneity, congruence invariancy, duality, mean inequalities.

SAOR METHOD FOR FUZZY LINEAR SYSTEM

  • Miao, Shu-Xin;Zheng, Bing
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.5_6
    • /
    • pp.839-850
    • /
    • 2008
  • In this paper, the symmetric accelerated overrelaxation (SAOR) method for solving $n{\times}n$ fuzzy linear system is discussed, then the convergence theorems in the special cases where matrix S in augmented system SX = Y is H-matrices or consistently ordered matrices and or symmetric positive definite matrices are also given out. Numerical examples are presented to illustrate the theory.

  • PDF

Geodesic Clustering for Covariance Matrices

  • Lee, Haesung;Ahn, Hyun-Jung;Kim, Kwang-Rae;Kim, Peter T.;Koo, Ja-Yong
    • Communications for Statistical Applications and Methods
    • /
    • v.22 no.4
    • /
    • pp.321-331
    • /
    • 2015
  • The K-means clustering algorithm is a popular and widely used method for clustering. For covariance matrices, we consider a geodesic clustering algorithm based on the K-means clustering framework in consideration of symmetric positive definite matrices as a Riemannian (non-Euclidean) manifold. This paper considers a geodesic clustering algorithm for data consisting of symmetric positive definite (SPD) matrices, utilizing the Riemannian geometric structure for SPD matrices and the idea of a K-means clustering algorithm. A K-means clustering algorithm is divided into two main steps for which we need a dissimilarity measure between two matrix data points and a way of computing centroids for observations in clusters. In order to use the Riemannian structure, we adopt the geodesic distance and the intrinsic mean for symmetric positive definite matrices. We demonstrate our proposed method through simulations as well as application to real financial data.

THE STEEPEST DESCENT METHOD AND THE CONJUGATE GRADIENT METHOD FOR SLIGHTLY NON-SYMMETRIC, POSITIVE DEFINITE MATRICES

  • Shin, Dong-Ho;Kim, Do-Hyun;Song, Man-Suk
    • Communications of the Korean Mathematical Society
    • /
    • v.9 no.2
    • /
    • pp.439-448
    • /
    • 1994
  • It is known that the steepest descent(SD) method and the conjugate gradient(CG) method [1, 2, 5, 6] converge when these methods are applied to solve linear systems of the form Ax = b, where A is symmetric and positive definite. For some finite difference discretizations of elliptic problems, one gets positive definite matrices that are almost symmetric. Practically, the SD method and the CG method work for these matrices. However, the convergence of these methods is not guaranteed theoretically. The SD method is also called Orthores(1) in iterative method papers. Elman [4] states that the convergence proof for Orthores($\kappa$), with $\kappa$ a positive integer, is not heard. In this paper, we prove that the SD method and the CG method converge when the $\iota$$^2$ matrix norm of the non-symmetric part of a positive definite matrix is less than some value related to the smallest and the largest eigenvalues of the symmetric part of the given matrix.(omitted)

  • PDF

POSITIVENESS FOR THE RIEMANNIAN GEODESIC BLOCK MATRIX

  • Hwang, Jinmi;Kim, Sejong
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.3
    • /
    • pp.917-925
    • /
    • 2020
  • It has been shown that the geometric mean A#B of positive definite Hermitian matrices A and B is the maximal element X of Hermitian matrices such that $$\(\array{A&X\\X&B}\)$$ is positive semi-definite. As an extension of this result for the 2 × 2 block matrix, we consider in this article the block matrix [[A#wijB]] whose (i, j) block is given by the Riemannian geodesics of positive definite Hermitian matrices A and B, where wij ∈ ℝ for all 1 ≤ i, j ≤ m. Under certain assumption of the Loewner order for A and B, we establish the equivalent condition for the parameter matrix ω = [wij] such that the block matrix [[A#wijB]] is positive semi-definite.

THE GENERALIZATION OF STYAN MATRIX INEQUALITY ON HERMITIAN MATRICES

  • Zhongpeng, Yang;Xiaoxia, Feng;Meixiang, Chen
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.673-683
    • /
    • 2009
  • We point out: to make Hermtian matrices A and B satisfy Styan matrix inequality, the condition "positive definite property" demanded in the present literatures is not necessary. Furthermore, on the premise of abandoning positive definite property, we derive Styan matrix inequality of Hadamard product for inverse Hermitian matrices and the sufficient and necessary conditions that the equation holds in our paper.

  • PDF

FACIAL STRUCTURES FOR SEPARABLE STATES

  • Choi, Hyun-Suk;Kye, Seung-Hyeok
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.3
    • /
    • pp.623-639
    • /
    • 2012
  • The convex cone $\mathbb{V}_1$ generated by separable states is contained in the cone $\mathbb{T}$ of all positive semi-definite block matrices whose block transposes are also positive semi-definite. We characterize faces of the cone $\mathbb{V}_1$ induced by faces of the cone $\mathbb{T}$ which are determined by pairs of subspaces of matrices.

BOUNDARIES OF THE CONE OF POSITIVE LINEAR MAPS AND ITS SUBCONES IN MATRIX ALGEBRAS

  • Kye, Seung-Hyeok
    • Journal of the Korean Mathematical Society
    • /
    • v.33 no.3
    • /
    • pp.669-677
    • /
    • 1996
  • Let $M_n$ be the $C^*$-algebra of all $n \times n$ matrices over the complex field, and $P[M_m, M_n]$ the convex cone of all positive linear maps from $M_m$ into $M_n$ that is, the maps which send the set of positive semidefinite matrices in $M_m$ into the set of positive semi-definite matrices in $M_n$. The convex structures of $P[M_m, M_n]$ are highly complicated even in low dimensions, and several authors [CL, KK, LW, O, R, S, W]have considered the possibility of decomposition of $P[M_m, M_n] into subcones.

  • PDF