An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- 1 April 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 16 (2) , 359-367
- https://doi.org/10.1137/0716028
Abstract
This paper describes an algorithm for reducing a real matrix A to block diagonal form by a real similarity transformation. The columns of the transformation corresponding to a block span a reducing subspace of A, and the block is the representation of A in that subspace with respect to the basis. The algorithm attempts to control the condition of the transformation matrices, so that the reducing subspaces are well conditioned and the basis vectors are numerically independent.Keywords
This publication has 5 references indexed in Scilit:
- Algorithm 506: HQR3 and EXCHNG: Fortran Subroutines for Calculating and Ordering the Eigenvalues of a Real Upper Hessenberg Matrix [F2]ACM Transactions on Mathematical Software, 1976
- Matrix Eigensystem Routines — EISPACK GuideLecture Notes in Computer Science, 1976
- An algorithm for numerical determination of the structure of a general matrixBIT Numerical Mathematics, 1970
- Computing invariant subspaces of a general matrix when the eigensystem is poorly conditionedMathematics of Computation, 1970
- Perturbation theory for linear operatorsPublished by Springer Nature ,1966