Approximate minimum norm subspace projection of least squares weights without an SVD
نویسندگان
چکیده
A QR based technique is presented for estimating the approximate numerical rank and corresponding signal subspace of a matrix together with the subspace projection of the least squares weights. Theoretical difficulties associated with conventional QR factorisation are overcome by applying the technique of RowZeroing QR to the covariance matrix. Thresholding is simplified compared with the use of the data matrix as the diagonal value spectrum is sharpened and the subspace estimate is improved. An approximation to the minimum norm solution for the projection of the least squares weight onto the signal subspace of the data is obtained simply, without performing an SVD.
منابع مشابه
Fast Spectral Low Rank Matrix Approximation
In this paper, we study subspace embedding problem and obtain the following results: 1. We extend the results of approximate matrix multiplication from the Frobenius norm to the spectral norm. Assume matrices A and B both have at most r stable rank and r̃ rank, respectively. Let S be a subspace embedding matrix with l rows which depends on stable rank, then with high probability, we have ‖ASSB−A...
متن کاملResidual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
Minimum residual norm iterative methods for solving linear systems Ax = b can be viewed as, and are often implemented as, sequences of least squares problems involving Krylov subspaces of increasing dimensions. The minimum residual method (MINRES) [C. Paige and M. Saunders, SIAM J. Numer. Anal., 12 (1975), pp. 617–629] and generalized minimum residual method (GMRES) [Y. Saad and M. Schultz, SIA...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملModel reduction of large-scale systems by least squares
In this paper we introduce an approximation method for model reduction of large-scale dynamical systems. This is a projection which combines aspects of the SVD and Krylov based reduction methods. This projection can be efficiently computed using tools from numerical analysis, namely the rational Krylov method for the Krylov side of the projection and a lowrank Smith type iteration to solve a Ly...
متن کاملSpace-time least-squares Petrov-Galerkin projection for nonlinear model reduction
This work proposes a space–time least-squares Petrov–Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov– )Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed me...
متن کامل