Simultaneous multidiagonalization for the CS decomposition |
| |
Authors: | Kingston Kang William Lothian Jessica Sears Brian D Sutton |
| |
Institution: | 1. Department of Mathematics, Randolph-Macon College, PO Box 5005, Ashland, VA, 23005, USA
|
| |
Abstract: | When an orthogonal matrix is partitioned into a two-by-two block structure, its four blocks can be simultaneously bidiagonalized. This observation underlies numerically stable algorithms for the CS decomposition and the existence of CMV matrices for orthogonal polynomial recurrences. We discover a new matrix decomposition for simultaneous multidiagonalization, which reduces the blocks to any desired bandwidth. Its existence is proved, and a backward stable algorithm is developed. The resulting matrix with banded blocks is parameterized by a product of Givens rotations, guaranteeing orthogonality even on a finite-precision computer. The algorithm relies heavily on Level 3 BLAS routines and supports parallel computation. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|