Fast simultaneous orthogonal reduction to triangular matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 2, 2009, Pages 316-330

  Oseledets, I V ^a   Savostyanov, D V ^a   Tyrtyshnikov, E E ^a  

^a INSTITUTE OF NUMERICAL MATHEMATICS   (Russian Federation)

Author keywords

Convergence estimates; Fast algor ithms; Simultaneous reduction of matrices

Indexed keywords

CONVERGENCE ESTIMATES; EIGENVALUE PROBLEM; FINITE SEQUENCE; GAUSS-NEWTON ALGORITHM; GENERALIZED EIGENVALUE PROBLEMS; LOCAL CONVERGENCE; NUMERICAL EXAMPLE; ORTHOGONAL TRANSFORMATIONS; SIMULTANEOUS REDUCTION; SQUARE MATRICES; TRIANGULAR MATRICES; UPPER TRIANGULAR MATRICES;

EIGENVALUES AND EIGENFUNCTIONS; SWITCHING SYSTEMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 68149182713     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/060650738     Document Type: Article

References (14)

1. A. BUNSE-GERSTNER, R. BYERS, AND V. MEHRMANN, Numerical methods for simultaneous diagonalization, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 927-949.
2. J.-F. CARDOSO AND A. SoULOUMIAC, Jacobi angles for simultaneous diagonalization,SIAM J. Matrix Anal. Appl., 17 (1996), pp. 161-164.
3. M. CHU, A continuous Jacobi-like approach to the simultaneous reduction of real matrices, Linear Algebra Appl., 147 (1991), pp. 75-96.
4. C. DAVIS AND W. KAHAN, Some new bounds on perturbation of subspaces, Bull. Amer. Math. Soc., 75 (1969), pp. 863-868.
5. A.-J. VAN DER Veen AND A. PAULRAJ, An analytical constant modulus algorithm, IEEE Trans. Signal Process., 44 (1996), pp. 1136-1155.
6. R. GRANAT, B. KÅGSTRÖM, AND D. KRESSNER, Computing periodic deflating subspaces associated with a specified set of eigenvalues, BIT, 47 (2007), pp. 763-791.
7. B. KÅGSTRÖM AND D. KRESSNER, Multishift variants of the QZ algorithm with aggressive early deflation, SIAM J. Matrix Anal. Appl., 29 (2006), pp. 199-227.
8. L. D. LATHAUWER AND J. CASTAING, Blind identification of underdetermined mixtures by simultaneous matrix diagonalization, IEEE Trans. Signal Process., 55 (2008), pp. 1096-1105.
9. L. D. LATHAUWER, B. De MOOR, AND J. VANDERWALLE, Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition,SIAMJ.Matrix Anal. Appl., 26 (2004), pp. 295-327.
10. C. B. MOLER AND G. W. STEWART, An algorithm for gen eralized matrix eigenvalue problems, SIAM J. Numer. Anal., 10 (1973), pp. 241-256.
11. G. W. STEWART AND J. G. SUN, Matrix Perturbation Theory, Comput.Sci.Sci.Comput., Academic Press, Boston, MA, 1990.
12. A. YEREDOR, Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation, IEEE Trans. Signal Process., 50 (2002), pp. 1545-1553.
13. A. YEREDOR, On using exact joint diagonalization for noniterative approximate joint diagonalization, Signal Process. Lett., 12 (2005), pp. 645-6 48.
14. A. ZlEHE, M. KAWANABE, S. HAMERLING, AND K.-R. MULLER, A fast algorithm for joint diagonalization with non-orthogonal transformations and its application to blind source separation, J. Mach. Learn. Res., 5 (2004), pp. 801-818.