|
|||||||||||||
|
|||||||||||||
A Decomposition Method for Weighted Least Squares Low-rank Approximation of Symmetric Matrices Jan de Leeuw, Department of Statistics, UCLA
ABSTRACT: We discuss an alternating least squares algorithm that uses both decomposition and block relaxation to find the optimal positive semidefinite approxation of given rank p to a known symmetric matrix of order n. Each iteration of the algorithm involves minimizing n quartics and solving n secular equations of order p.
SUGGESTED CITATION:
| |||||||||||||
|
|||||||||||||