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


An updating algorithm for subspace tracking
Authors:Stewart  GW
Affiliation:Dept. of Comput. Sci., Maryland Univ., College Park, MD;
Abstract:In certain signal processing applications it is required to compute the null space of a matrix whose rows are samples of a signal with p components. The usual tool for doing this is the singular value decomposition. However, the singular value decomposition has the drawback that it requires O(p3) operations to recompute when a new sample arrives. It is shown that a different decomposition, called the URV decomposition, is equally effective in exhibiting the null space and can be updated in O( p2) time. The updating technique can be run on a linear array of p processors in O(p) time
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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