Results 171 to 180 of about 49,764 (200)
Some of the next articles are maybe not open access.
Cholesky decomposition of a positive semidefinite matrix with known kernel
Applied Mathematics and Computation, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dostál, Zdeněk +3 more
openaire +3 more sources
A note on Hermitian positive semidefinite matrix polynomials
Linear Algebra and its Applications, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Friedland, A. Melman
openaire +1 more source
Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
SIAM Journal on Matrix Analysis and Applications, 1993The authors study the problem of finding the closest Hermitian positive semidefinite Toeplitz matrix of a given rank to an arbitrary given matrix (in the Frobenius norm = Hilbert-Schmidt norm). They introduce two methods, one is based on using a special orthonormal basis in the space of Hermitian Toeplitz matrices and the second is a modified ...
Suffridge, T. J., Hayden, T. L.
openaire +1 more source
On the Positive Semidefinite Nature of a Certain Matrix Expression
Canadian Journal of Mathematics, 1964By "positive definite matrices" or, briefly, definite matrices, we mean in this note self-adjoint matrices all the characteristic values of which are positive. Alternatively, they can be defined as matrices, all the hermitian quadratic forms of which are real and positive.
Wigner, Eugene P., Yanase, M. M.
openaire +2 more sources
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 ...
Huang, Hong-Xuan +2 more
openaire +1 more source
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 ...
Huang, Hong-Xuan +2 more
openaire +1 more source
Actuarial Risk Matrices: The Nearest Positive Semidefinite Matrix Problem
North American Actuarial Journal, 2017The manner in which a group of insurance risks are interrelated is commonly presented via a correlation matrix. Actuarial risk correlation matrices are often constructed using output from disparate modeling sources and can be subjectively adjusted, for example, increasing the estimated correlation between two risk sources to confer reserving prudence ...
Stefan Cutajar +2 more
openaire +1 more source
Completing a positive semidefinite matrix as a graph
IOSR Journal of MathematicsThis 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
The unique square root of a positive semidefinite matrix
International Journal of Mathematical Education in Science and Technology, 2006An easy way to present the uniqueness of the square root of a positive semidefinite matrix is given.
Koeber, Martin, Schäfer, Uwe
openaire +1 more source
The Probability that a (partial) matrix is positive semidefinite
1998Assuming that a ij is distributed uniformly in [—1,1] and a ii = 1, we compute the probability that a symmetric matrix A = [a ij ] 171-1 j=1 is positive semidefinite. The probability is also computed if A is a Toeplitz matrix. Finally, some results for partial matrices are presented.
C. R. Johnson, G. Nævdal
openaire +1 more source
Cones of real positive semidefinite matrices associated with matrix stability
Linear and Multilinear Algebra, 1988Three cones of real positive semidefinite matrices are discussed. Characterizations for Lyapunov diagonal semistability and for Lyapunov diagonal near stability of matrices in terms of these cones are obtained. Also, a relation between Lyapunov diagonal semistability and D-stability is established.
Daniel Hershkowitz, Dafna Shasha
openaire +1 more source

