
doi: 10.1137/0109009
The reduction of a matrix which has several roots is treated. For example, when a characteristic root of a matrix A of order n is known, it is possible, by any of sev eral known methods, to replace A by a matrix B, n-1 of whose roots are the yet unknown roots of A, and such that either B is of order n-1, or else its remaining root is zero. It is shown that the vector iterates approach an invariant subspace belonging to these roots, and even when the roots are close, the corresponding invariant subspace is more stably separable from the complementary invariant subspace than are the principal vectors from one another within the subspace. By repeated application of the equations listed, the invariant subspaces can be peeled off and the problem reduced, at each step, to one of lower order. (N.W.R.)
linear algebra, polynomials, forms, theory of invariants
linear algebra, polynomials, forms, theory of invariants
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
