An algorithm for computing the eigenstructure of a regular matrix polynomial. (English) Zbl 0618.65028
An algorithm for separating ranges and nullspaces of a general matrix pencil using LU decompositions is described. It is an alternative to the orthogonal factorizations used by other authors as e.g. B. Kågström [SIAM J. Sci. Stat. Comput. 7, 185-211 (1986; Zbl 0593.65027)] and P. Van Dooren [Linear Alg. Appl. 27, 103-140 (1979; Zbl 0416.65026)].
Reviewer: A.Ruhe
MSC:
| 65F15 | Numerical computation of eigenvalues and eigenvectors of matrices |
| 15A18 | Eigenvalues, singular values, and eigenvectors |
| 15A54 | Matrices over function rings in one or more variables |
References:
| [1] | Golub, G. H.; Van Loan, C. F., Matrix Computation (1983), North Oxford Academic · Zbl 0559.65011 |
| [2] | Kublanovskaya, V., On an approach to the solution of the generalized latent value problem for λ-Matrices, SIAM J. Numer. Anal., 7, 532-537 (1970) · Zbl 0225.65048 |
| [3] | Lancaster, P., Lambda-Matrices and Vibrating Systems (1966), Pergamon: Pergamon Oxford · Zbl 0146.32003 |
| [4] | Moler, C.; Stewart, G., An algorithm for the generalized matrix eigenvalue problem, SIAM J. Numer. Anal., 10, 241-256 (1973) · Zbl 0253.65019 |
| [5] | Peters, G.; Wilkinson, J., Ax = λBx and the generalized eigenproblem, SIAM J. Numer. Anal., 7, 479-492 (1970) · Zbl 0276.15016 |
| [6] | Ruhe, A., Algorithms for the nonlinear eigenvalue problem, SIAM J. Numer. Anal., 10, 674-689 (1973) · Zbl 0261.65032 |
| [7] | Van Dooren, P., The computation of Kornecker’s canonical form of singular pencil, Linear Algebra Appl., 27, 103-140 (1979) · Zbl 0416.65026 |
| [8] | Van Dooren, P.; Dewilde, P., The eigenstructure of an arbitrary polynomial matrix: Computational aspects, Linear Algebra Appl., 50, 545-579 (1983) · Zbl 0507.65008 |
| [9] | Wilkinson, J. H., The Algebraic Eigenvalue Problem (1965), Clarendon: Clarendon Oxford · Zbl 0258.65037 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
