首页 | 本学科首页   官方微博 | 高级检索  
     检索      


An algorithm and a stability theory for downdating the ULV decomposition
Authors:Jesse L Barlow  Peter A Yoon  Hongyuan Zha
Institution:(1) Department of Computer Science and Engineering, The Pennsylvania State University, 16802-6106 University Park, PA, USA
Abstract:An alternative to performing the singular value decomposition is to factor a matrixA into 
$$A = U\left( {\begin{array}{*{20}c}   C  \\   0  \\ \end{array} } \right)V^T $$
, whereU andV are orthogonal matrices andC is a lower triangular matrix which indicates a separation between two subspaces by the size of its columns. These subspaces are denoted byV = (V 1,V 2), where the columns ofC are partitioned conformally intoC = (C 1,C 2) with VerbarC 2 Verbar F le epsi. Here epsi is some tolerance. In recent years, this has been called the ULV decomposition (ULVD).If the matrixA results from statistical observations, it is often desired to remove old observations, thus deleting a row fromA and its ULVD. In matrix terms, this is called a downdate. A downdating algorithm is proposed that preserves the structure in the downdated matrix 
$$\bar C$$
to the extent possible. Strong stability results are proven for these algorithms based upon a new perturbation theory.The research of Jesse L. Barlow and Hongyuan Zha was supported by the National Science Foundation under grant no. CCR-9201612(Barlow) and CCR-9308399(Zha). The research of Peter A. Yoon was supported by the Office of Naval Research under the Fundamental Research Initiatives Program. Peter A. Yoon also has an appointment with the Applied Research Laboratory, The Pennsylvania State University, University Park, PA 16802, USA
Keywords:Orthogonal decomposition  downdating  error analysis  subspaces
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号