An iterative method for computing a symplectic SVD-like decomposition

Abstract

In this paper, we present an effective iterative method for computing symplectic SVD-like decomposition for a 2n-by-m rectangular real matrix A. The main purpose here is a block-power iterative method with the ortho-symplectic SR decomposition in the normalization step. We compute an k-block symplectic SVD-like decomposition, namely A{sub k}=S{sub k}Σ{sub k}V{sub k}{sup T} where S{sub k}∈ℝ{sup 2n×2k} is symplectic and V{sub k}∈ℝ{sup m×2k} is orthogonal. For large matrices, we usually have to compute only part of eigenvalues. The main interest of the proposed method is to efficiently compute the desired number of ordered in magnitude eigenvalues of structured matrices.