Skip to main content
Download PDF
- Main
A Decomposition Method for Weighted Least Squares Low-rank Approximation of Symmetric Matrices
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.
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%