
Accession Number : AD0715000
Title : A Least Squares Decomposition Theorem with Applications to Data Compaction.
Descriptive Note : Technical rept.,
Corporate Author : CALIFORNIA UNIV LOS ANGELES NUMERICAL ANALYSIS RESEARCH
Personal Author(s) : Glassman,Bernard A.
Report Date : 1970
Pagination or Media Count : 80
Abstract : The subject of this dissertation is a family of algorithms which can be used as a method of data compaction. The algorithms are developed and their properties discussed with regard to matrix compaction. The basis of the algorithms is a least squares decomposition theorem which supplies analytic expressions for obtaining approximations to the matrix entries. In developing the decomposition theorem, a subring of matrices, bimatrices, is used and their properties are described. A MoorePenrose generalized inverse developed as a function of bimatrices is used in the solution of the least squares problem. This dissertation also contains discussions of the error matrices produced by the algorithms, the compaction ratios of the algorithms and the convergence properties of the algorithms. (Author)
Descriptors : (*MATRICES(MATHEMATICS), NUMERICAL ANALYSIS), ITERATIONS, APPROXIMATION(MATHEMATICS), LEAST SQUARES METHOD, ALGORITHMS, THEOREMS, THESES
Subject Categories : Statistics and Probability
Distribution Statement : APPROVED FOR PUBLIC RELEASE