Approximation of Gram-Schmidt Orthogonalization by Data Matrix
From MaRDI portal
Abstract: For a matrix with linearly independent columns, this work studies to use its normalization and itself to approximate its orthonormalization . We theoretically analyze the order of the approximation errors as and approach , respectively. Our conclusion is able to explain the fact that a high dimensional Gaussian matrix can well approximate the corresponding truncated Haar matrix. For applications, this work can serve as a foundation of a wide variety of problems in signal processing such as compressed subspace clustering.
This page was built for publication: Approximation of Gram-Schmidt Orthogonalization by Data Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6281522)