Normal degree
Karl Gustafson · Numerical Linear Algebra with Applications · 2004
Abstract The H‐normal degree n(A,H) associated with GCG‐LS algorithms is shown to be independent of H, thereby correcting an incompleteness in the literature. The normal degree n(A) for any normalizable matrix A when n(A)>1 is shown to sometimes occur sharply in the interval $\sqrt{m}$ ≦n(A)≦m−1, where m is the degree of A's minimum polynomial, thereby clarifying previous estimates in the literature. Copyright © 2004 John Wiley & Sons, Ltd.