The endpoint bounds printed in this part are false. Take , and , which obey . The characteristic polynomial isIt has and , so it has a real root strictly between and , outside the first printed interval. There is a unique eigenvalue in the transpose's isolated first disc of radius , identifying it as the first eigenvalue. Similarly and give a root above , violating the last printed interval. The approximate three roots are , and .
There is nevertheless a corrected enclosure proving the claimed reality. Under the stated condition write . The large first row disc is disjoint from the large last column disc, since their centres are apart and their radii are both . Every eigenvalue lies both in the row union and in the column union. It cannot belong to both large discs, so it lies in at least one of the fixed small discsThese fixed discs are pairwise disjoint. At each contains one eigenvalue. Eigenvalues depend continuously, as a multiset, on the entries; throughout the connected allowed interval no eigenvalue can move between these separated fixed sets while remaining in their union. Thus each still contains one, counted with multiplicity. Complex-conjugate pairing now proves each is real. The valid conclusion isThe source's stronger width at both endpoints does not persist after adding the corner entry; it was valid for the unperturbed matrix only.
The enclosure method is Complementary row and column Gershgorin isolation.
Articles by others on the same topic
There are currently no matching articles.