用户名: 密码: 验证码:
A fast algorithm for the recursive calculation of dominant singular subspaces
详细信息查看全文 | 推荐本文 |
摘要
In many engineering applications it is required to compute the dominant subspace of a matrix A of dimension me="mml103">method=retrieve&_udi=B6TYH-4N3GFH7-1&_mathId=mml103&_user=1067359&_cdi=5619&_rdoc=6&_acct=C000050221&_version=1&_userid=10&md5=94002a9231b08902772c4d692cf7d4dc" title="Click to view the MathML source" alt="Click to view the MathML source">m×n, with me="mml104">method=retrieve&_udi=B6TYH-4N3GFH7-1&_mathId=mml104&_user=1067359&_cdi=5619&_rdoc=6&_acct=C000050221&_version=1&_userid=10&md5=8c9ef96e5b379eb02424d8379e04b591" title="Click to view the MathML source" alt="Click to view the MathML source">mmg src="http://www.sciencedirect.com/scidirimg/entities/2aa2.gif" alt="not double greater-than sign" title="not double greater-than sign" border="0">n. Often the matrix A is produced incrementally, so all the columns are not available simultaneously. This problem arises, e.g., in image processing, where each column of the matrix A represents an image of a given sequence leading to a singular value decomposition-based compression [S. Chandrasekaran, B.S. Manjunath, Y.F. Wang, J. Winkeler, H. Zhang, An eigenspace update algorithm for image analysis, Graphical Models and Image Process. 59 (5) (1997) 321–332]. Furthermore, the so-called proper orthogonal decomposition approximation uses the left dominant subspace of a matrix A where a column consists of a time instance of the solution of an evolution equation, e.g., the flow field from a fluid dynamics simulation. Since these flow fields tend to be very large, only a small number can be stored efficiently during the simulation, and therefore an incremental approach is useful [P. Van Dooren, Gramian based model reduction of large-scale dynamical systems, in: Numerical Analysis 1999, Chapman & Hall, CRC Press, London, Boca Raton, FL, 2000, pp. 231–247].

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700