نتایج جستجو برای: positive semidefinite matrices
تعداد نتایج: 730691 فیلتر نتایج به سال:
A real square matrix A is said to be Lyapunov diagonally semistable if there exists a positive definite diagonal matrix D, called a Lyapunov scaling factor of A, such that the matrix AD + DAT is positive semidefinite, Lyapunov diagonally semistable matrices play an important role in applications in several disciplines, and have been studied in many matrix theoretical papers, see for example [2]...
In this chapter we study cones in the real Hilbert spaces of Hermitian matrices and real valued trigonometric polynomials. Based on an approach using such cones and their duals, we establish various extension results for positive semidefinite matrices and nonnegative trigonometric polynomials. In addition, we show the connection with semidefinite programming and include some numerical experiments.
Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with the same pattern that have a positive semidefinite completion. Efficient large-scale algorithms for evaluating these barriers and their derivati...
Restoring Definiteness via Shrinking, with an Application to Correlation Matrices with a Fixed Block
Indefinite approximations of positive semidefinite matrices arise in many data analysis applications involving covariance matrices and correlation matrices. We propose a method for restoring positive semidefiniteness of an indefinite matrix M0 that constructs a convex linear combination S(α) = αM1 + (1− α)M0 of M0 and a positive semidefinite target matrix M1. In statistics, this construction fo...
The positive semidefinite rank of a nonnegative (m×n)-matrix S is the minimum number q such that there exist positive semidefinite (q × q)-matrices A1, . . . , Am, B1, . . . , Bn such that S(k, l) = trA∗kBl. The most important lower bound technique on nonnegative rank only uses the zero/nonzero pattern of the matrix. We characterize the power of lower bounds on positive semidefinite rank based ...
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
Abstract. The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a 1 graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by 2 G. It is shown that for a connected graph of order at least two, no vertex is in every zero forcing set. The positive 3 semidefinite zero forcing number Z+(G) is introduced, and ...
Let A,B,C be n× n positive semidefinite matrices. It is known that det(A+ B + C) + detC ≥ det(A+ C) + det(B + C), which includes det(A+B) ≥ detA+ detB as a special case. In this article, a relation between these two inequalities is proved, namely, det(A+ B + C) + detC − (det(A+ C) + det(B + C)) ≥ det(A+ B)− (detA+ detB).
In this note we characterize polynomial numerical hulls of matrices $A in M_n$ such that$A^2$ is Hermitian. Also, we consider normal matrices $A in M_n$ whose $k^{th}$ power are semidefinite. For such matriceswe show that $V^k(A)=sigma(A)$.
in this note we characterize polynomial numerical hulls of matrices $a in m_n$ such that$a^2$ is hermitian. also, we consider normal matrices $a in m_n$ whose $k^{th}$ power are semidefinite. for such matriceswe show that $v^k(a)=sigma(a)$.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید