A fast algorithm for the recursive calculation of dominant singular subspaces

✍ Scribed by N. Mastronardi; M. Van Barel; R. Vandebril

• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 412 KB
• Volume: 218
• Category: Article
• ISSN: 0377-0427
• DOI: 10.1016/j.cam.2006.12.032

✦ Synopsis

In many engineering applications it is required to compute the dominant subspace of a matrix A of dimension m × n, with m?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: