Abstract
An algorithm, proposed by V. N. Kublanovskaya, for solving the complete eigenvalue problem of a degenerate (that is defective and/or derogatory) matrix, is studied theoretically and numerically. It uses successiveQR-factorizations to determine annihilated subspaces.
An adaptation of the algorithm is developed which, applied to a matrix with a very ill-conditioned eigenproblem, computes a degenerate matrix. The difference between these matrices is small, measured in the spectral norm. The degenerate matrix will appear in a standard form, whose eigenvalues and principal vectors can be computed in a numerically stable manner.
Numerical examples are given.
Similar content being viewed by others
References
H. Bowdler, R. S. Martin, C. Reinsch, and J. H. Wilkinson,The QR and QL-algorithms for symmetric matrices, Handbook series Linear Algebra, Num. Math.11, 293–306 (1968).
Ch. Davis and W. M. Kahan,The rotation of eigenvectors by a perturbation — III, Tech. Rep. No. 6, Univ. of Toronto Comp. Sc. (1968).
C. A. Desoer and B. H. Whalen,A note on pseudoinverses, J. SIAM 11, 442–447 (1963).
D. K. Faddeev, V. N.Kublanovskaya, and V. N. Faddeeva, Lineinye algebraičeskie sistemy s pryamougolnymi matricami, Trans. Int. Summer School on Comp. Meth., Kiev 1966, V. 1, 16–75, Moscow 1968.
D. K. Faddeev, V. N. Kublanovskaya, and V. N. Faddeeva,Sur les systèmes linéaires algébriques de matrices rectangularies et mal-conditionnées, Colloq. Int. du C.N.R.S. Besancon 1966, No. 165, 161–170, Paris 1968.
D. K. Faddeev, V. N. Kublanovskaya, and V. N. Faddeeva,O rešenii lineinyh algebraičeskih sistem s pryamougolnymi matricami, Tr. Mat. Inst. Steklova 96, 79–92 (1968).
Ky Fan,Maximum properties and inequalities for the eigenvalues of completely continuous operators, Proc. Nat. Acad. Sci. 37, 760–766 (1951).
J. G. F. Francis,The QR Transformation, Comp. J. 4, 265–271, 332–345 (1961).
I. C. Gohberg, M. G. Krein,Introduction to the theory of linear nonselfadjoint operators, Moscow 1965, Transl. AMS Tr. Vol. 18, Providence, Rhode Island, 1969.
G. H. Golub,Least squares, singular values and matrix approximations, Aplikace Matematiky 13, 44–51 (1968).
T. Kato,Perturbation theory for linear operators, Springer Verlag, Berlin · Heidelberg · New York, 1966.
V. N. Kublanovskaya,On a method of solving the complete eigenvalue problem for a degenerate matrix, Z. Vyčisl. Mat. mat. Fiz. 6, 611–620 (1966), Transl. in USSR Comp. Math. and Math. Phys. 6:4, 1–14 (1968).
A. Ruhe,Properties of a matrix with a very ill-conditioned eigenproblem, Num. Math. 15, 57–60, (1970).
J. M. Varah,The computation of bounds for the invariant subspaces of a general matrix operator, Stanford Tech. Rep. CS 66, (1967).
J. M. Varah,The calculation of the eigenvectors of a general complex matrix by inverse iteration, Math. Comp. 22, 785–791 (1968).
J. M. Varah,Rigorous machine bounds for the eigensystem of a general complex matrix, Math. Comp. 22, 793–801 (1968).
J. M. Varah,Computing invariant subspaces of a general matrix when the eigensystem is poorly conditioned, Math. Comp. 24, 137–149 (1970).
P. Å. Wedin,On pseudoinverses of perturbed matrices, Lund Un. Comp. Sc. Tech. Rep. 1969.
J. H. Wilkinson,The algebraic eigenvalue problem, Clarendon Press, Oxford 1965.
A. Ruhe,Perturbation bounds for means of eigenvalues and invariant subspaces, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ruhe, A. An algorithm for numerical determination of the structure of a general matrix. BIT 10, 196–216 (1970). https://doi.org/10.1007/BF01936867
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01936867