Results 161 to 170 of about 1,994 (184)

Some Properties for the Euclidean Distance Matrix and Positive Semidefinite Matrix Completion Problems

Journal of Global Optimization, 2003
This paper gives a variety of results on the Euclidean distance matrix completion problem, which is, if some entries of an \(n\times n\) matrix are specified, when can the rest of the matrix be filled in such that it is a matrix of distances between \(n\) points in some Euclidean space, and the related problem of completing a positive semidefinite ...
Hong-Xuan Huang, Zhian Liang, Panos M. Pardalos   +2 more
openaire   +1 more source

Completing a positive semidefinite matrix as a graph

IOSR Journal of Mathematics
This paper explores the completion of positive semidefinite (PSD) matrices through graph representation, emphasizing the fundamental properties of PSD matrices and their relevance in various applications, including statistics, machine learning, and optimization.
Hawa Ahmed Alrawayati, Ümit Tokeşer
openaire   +1 more source

Positive semidefiniteness of $$D_{\alpha }$$-matrix on some families of graphs

Computational and Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gui-Xian Tian, Hui-Lu Sun, Shu-Yu Cui
openaire   +2 more sources

On the Controllability of Matrix Pairs $( A, K )$ with K Positive Semidefinite, II

SIAM Journal on Matrix Analysis and Applications, 1994
A famous result of \textit{C. T. Chen} [SIAM J. Appl. Math. 25, 158-161 (1973; Zbl 0273.15009)] and \textit{H. K. Wimmer} [Linear Algebra Appl. 8, 337-343 (1974; Zbl 0288.15015)] asserts that, if the matrix \(K = AH = HA^*\) is positive semidefinite and if \((A,K)\) is a controllable pair of matrices, then \(A\) has no eigenvalues on the imaginary line
openaire   +2 more sources

Fallacies in computational testing of matrix positive definiteness/semidefiniteness

IEEE Transactions on Aerospace and Electronic Systems, 1990
The status of computational tests for establishing matrix positive semidefiniteness and positive definiteness is reviewed. Two pervasive real-time tests that have been used for many years in varied applications to ensure that computed covariances encountered in Kalman filter applications are positive definite and discussed.
openaire   +1 more source

Norm-preserving dilation theorems for a block positive semidefinite (definite) matrix

Linear and Multilinear Algebra, 2022
Xifu Liu
exaly  

Positive Semidefinite Matrix Factorization: A Connection With Phase Retrieval and Affine Rank Minimization

IEEE Transactions on Signal Processing, 2021
Dana Lahat, Vincent Tan, Cedric Fevotte   +2 more
exaly  

Characterization of a Positive Semidefinite Matrix

Econometric Theory, 1992
openaire   +1 more source

Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm

Applied Mathematics Letters, 2020
Xifu Liu
exaly  

On the rank minimization problem over a positive semidefinite linear matrix inequality

IEEE Transactions on Automatic Control, 1997
M Mesbahi
exaly