University of Waterloo

Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and ...
IEEE

Generalizations of the Rayleigh quotient iteration for the iterative refinement of the eigenvectors of real symmetric matrices

Abstract: We present new algorithms for refining the estimates of the eigenvectors of a real symmetric matrix. Using techniques from calculus, we show that the algorithms converge locally cubically ...
JSTOR Daily

On Rank Estimation in Symmetric Matrices: The Case of Indefinite Matrix Estimators

This is a preview. Log in through your library . Abstract In this paper we consider estimating the rank of an unknown symmetric matrix based on a symmetric, asymptotically normal estimator of the ...
IEEE

Robust Low-Rank Tensor Constrained Orthogonal Symmetric Non-Negative Matrix Factorization for Multi-Layer Networks Community Detection

Abstract: In multi-layer network community detection, the goal is to group nodes into distinct clusters based on their connection strengths. Currently, many existing methods do not fully leverage the ...
JSTOR Daily

Proof of Conjectures About the Expected Values of the Elementary Symmetric Functions of a Noncentral Wishart Matrix

This paper provides proof of conjectures about the expected values of the jth elementary symmetric function of the roots (i.e. $E(\operatorname{tr}_j A)$) of a non ...