Preprint
Article

This version is not peer-reviewed.

On Schur Forms for Matrices with Simple Eigenvalues

A peer-reviewed article of this preprint also exists.

Submitted:

10 October 2024

Posted:

10 October 2024

You are already at the latest version

Abstract
In this paper we consider the standard Schur problem for a square matrix A, namely the similarity unitary transformation of A into upper Schur form containing the eigenvalues of A on its diagonal. Since the profound work of Issai Schur (1909), this is a fundamental issue in the theory and applications of matrices. Nevertheless, certain details concerning the Schur problem need further clarification especially in connection with the perturbation analysis of the Schur decomposition relative to perturbations in A. In particular, the concept of regular solution to the perturbed Schur form is introduced and illustrated by several examples. We also introduce the concepts of diagonally spectral matrices and of quasi-Schur condensed forms of a matrix A, and show that they may be much less sensitive to perturbations in A.
Keywords: 
;  ;  ;  ;  

1. Introduction and Notation

The Schur decomposition of general square matrix and its generalizations are major tools both in the theory and applications of matrix analysis [5]. In this paper we consider the main definitions and properties of the Schur decomposition of a square matrix which are important from the point of view of the perturbation analysis. We also introduce new concepts in this field. A number of examples is given for illustration of the results presented. This is a specific issue and we shall need a large number of notations. For convenience of the reader the general notations are gathered below in this section, while some specific notations appear further in the text. Some of the matrix notations are inspired by the language of the program system MATLAB [10].
Let Z = { 0 , ± 1 , ± 2 , } be the set of integers and m , n Z , where m n . We denote by
Z [ m , n ] = { k Z : m k n }
(or by m : n ) the set of n m + 1 integers m , m + 1 , , n . We write Z [ m , m ] = m and Z [ n , m ] = when n > m . The set of real (resp. complex) numbers is denoted by R (resp. C R × R ) and i = 1 is the imaginary unit. A complex number z is written as z = x + i y with x , y R , or z = | z | exp ( i φ ) , where | z | = x 2 + y 2 is the absolute value and φ ( π , π ] is the angle of z. The complex conjugate of z is denoted as z ¯ = x i y = | z | exp ( i φ ) .
The sign function sign : R Z [ 1 , 1 ] for scalar arguments is defined as sign ( x ) = 1 , sign ( x ) = 0 and sign ( x ) = 1 for x < 0 , x = 0 and x > 0 , resp. The sign function for real n-tuples x = ( x 1 , x 2 , , x n ) is defined by the expression
sign ( x ) = k = 1 n 2 1 k sign ( x k ) .
The lexicographical order ≺ for n-tuples is defined as x x ˜ , x = x ˜ and x x ˜ if sign ( x x ˜ ) < 0 , sign ( x x ˜ ) = 0 and sign ( x x ˜ ) > 0 , resp. Otherwise speaking, x x ˜ when either x 1 < x ˜ 1 , or there exists m Z [ 2 , n ] such that x k = x ˜ k for k Z [ 1 , m 1 ] and x m < x ˜ m . We write x x ˜ if either x x ˜ or x = x ˜ . We use this lexicographical order for complex numbers z = x + i y written as real pairs ( x , y ) and for pairs ( m , n ) of integers m , n Z . For example, for the fourth roots { ± 1 , ± i } of 1, we have 1 i i 1 .
We denote by C ( m , n ) (resp. R ( m , n ) ) the space of m × n complex (resp. real) matrices A = [ A ( i , j ) ] with elements A ( i , j ) and we set C ( n ) = C ( n , n ) , R ( n ) = R ( n , n ) . The column m-vector b C ( m , 1 ) with elements b i = b ( i ) is written as b = [ b 1 ; b 2 ; ; b m ] , while the row n-vector c C ( 1 , n ) with elements c j = c ( j ) is denoted as c = [ c 1 , c 2 , , c n ] . A quantity z C R is said to be genuinely complex. A vector or a matrix is genuinely complex if at least one of its elements is complex.
The identity n × n matrix is denoted as I n R ( n ) . The element I n ( i , j ) of I n is the Kronecker delta symbol d ( i , j ) = 1 sign 2 ( i j ) . The zero m × n matrix is denoted as O m , n R ( m , n ) with O n = O n , n , or simply as O. We denote by L n R ( n ) the strictly lower triangular matrix with ones below its main diagonal and zeros otherwise, i.e. L n ( i , j ) = 1 if i > j and L n ( i , j ) = 0 if i j . The elementary matrix with element 1 in position ( p , q ) and zero otherwise is denoted as E p , q R ( m , n ) , i.e. E p , q ( i , j ) = d ( i , p ) d ( j , q ) .
The absolute value of the matrix A C ( m , n ) is the matrix | A | R ( m , n ) with elements | A | ( i , j ) = | A ( i , j ) | . The transpose of the matrix A C ( m , n ) is denoted A C ( n , m ) and has elements A ( i , j ) = A ( j , i ) . The complex conjugate transpose of A C ( m , n ) is denoted by A H C ( n , m ) and has elements A H ( i , j ) = A ( j , i ) ¯ . The i-th row and the j-th column of A are denoted as A ( i , : ) C ( 1 , n ) and A ( : , j ) C ( m , 1 ) , respectively. For A , B C ( m , n ) we denote by A B C ( m , n ) the element-wise product of A and B, i.e. ( A B ) ( i , j ) = A ( i , j ) B ( i , j ) . The spectral and the Frobenius norms of the matrix A C ( m , n ) are denoted as A and A F , resp.
The spectrum spect ( A ) of the matrix A C ( n ) is the collection, or the multiset, of the eigenvalues λ k ( A ) C of A, k Z [ 1 , n ] , counted according to their algebraic multiplicities. With certain abuse of notation we write spect ( A ) C in the general case, and spect ( A ) R in the case when all eigenvalues of A are real.
The multiplicative group of unitary matrices U C ( n ) such that U H U = I n is denoted by U ( n ) . The group of orthonormal matrices U R ( n ) such that U U = I n is denoted as O ( n ) . For A C ( n ) we denote by Low ( A ) = A L n and Diag ( A ) = A I n the strictly lower triangular and the diagonal parts of A, respectively. If x is an n-vector with elements x ( i ) C then diag ( x ) C ( n ) is the matrix with elements diag ( x ) ( i , j ) = x ( i ) d ( i , j ) .
The set of upper triangular matrices A = A Low ( A ) is denoted as T ( n ) C ( n ) , while the set of diagonal matrices A = Diag ( A ) is denoted as D ( n ) T ( n ) . For n 2 the group of diagonal matrices of the form
diag ( 1 , exp ( i φ 2 ) , , exp ( i φ n ) ) ,
where φ k R , is denoted as D * ( n ) U ( n ) .
If K is a finite set then card ( K ) is the number of its elements. The set of ( n 1 ) -tuples of pairs { ( i 1 , j 1 ) , ( i 2 , j 2 ) , , ( i n 1 , j n 1 ) } of integers i k Z [ 1 , n 1 ] , j k Z [ 2 , n ] , where i k < j k , is denoted as K ( n ) .
Finally we set ν n = n ( n 1 ) / 2 and
μ n = card ( K ( n ) ) = ( ν n ) ! / ( n 1 ) !
In particular ν 4 = 6 and μ 4 = 6 ! / 3 ! = 20 . Unspecified matrix block are denoted by star. The end of definitions, examples and propositions is marked by □.

2. Condensed Schur Forms

Let an arbitrary matrix A C ( n ) , n 2 , be given. Then according to the famous Schur theorem [13] there exists a factorization A = U T U H of the matrix A, where U U ( n ) and T T ( n ) .
Definition 1. 
The pair
( U , T ) U ( n ) × T ( n ) , T = U H A U ,
is said to be a Schur decomposition (SD), or an upper triangular unitary decomposition of the matrix A. The matrix T is referred to as a condensed Schur form (ConSF), or an upper triangular form of A. The columns of the unitary matrix U form a Schur basis for C ( n , 1 ) relative to A. □
Thus defined the condensed Schur form T of A is not unique. Hence the condensed Schur forms are not canonical but rather quasi-canonical. If A R ( n ) and if the spectrum of A is real then the transformation matrix may be chosen as U O ( n ) and we have T = U A U R ( n ) . If A R ( n ) and the spectrum of A is genuinely complex then a real block Schur form with 1 × 1 and 2 × 2 diagonal blocks may also be constructed.
Next we define two sets of matrices depending on the matrix A which play an important role in our analysis. Denote
U ( A ) = { U U ( n ) : U H A U T ( n ) } U ( n )
and
T ( A ) = { U H A U : U U ( A ) } T ( n ) .
Thus U ( A ) U ( n ) is the set of unitary matrices transforming the matrix A into ConSF, and T ( A ) is the set of ConSF of A. For matrices A R ( n ) with real spectra we denote
O ( A ) = { U O ( n ) : U A U T ( n ) } O ( n ) .
In general the set U ( A ) is not a group and not even a groupoid, i.e. U 1 , U 2 U ( A ) does not imply U 1 U 2 U ( A ) .
The most important (actually, the only important) property of the ConSF T of the matrix A is that its diagonal elements are the eigenvalues of A, i.e. T ( k , k ) = λ k ( A ) , k Z [ 1 , n ] . Because of the only condition Low ( T ) = 0 the matrix T is only a condensed form (rather than a canonical form) of A relative to the similarity action U ( n ) × C ( n ) T ( n ) , defined by ( U , A ) U H A U , of the group U ( n ) on the set C ( n ) .
Definition 2. 
The problem of finding the ConSF (1) is referred to as the Schur problem (SP) for the matrix A C ( n ) . The general solution of the SP is the set
Schur ( A ) = ( U , U H A U ) : U U ( n ) , U H A U T ( n ) U ( A ) × T ( A )
of all ConSF of A. A pair ( U , T ) Schur ( A ) is a particular solution of the SP for the matrix A. □
Sometimes the matrices U and T in a ConSF of A are written as U ( A ) and T ( A ) to emphasize their dependence on A. This dependence, however, is not functional. Indeed, the transformation matrix U ( A ) is always not unique, e.g. ( U , T ) Schur ( A ) implies ( U , T ) Schur ( A ) . With exception of the case A = λ I n , λ C , when it is fulfilled T ( A ) = A , the upper triangular unitary equivalent form T ( A ) of A is also not unique. For the latter choice of A we have Schur ( A ) = U ( n ) × { A } .
All upper triangular unitary equivalent forms of a given matrix are unitary similar. In particular the next proposition is a direct corollary of the definitions, see e.g. [14].
Proposition 1. 
Let Π 1 = ( U 1 , T 1 ) and Π 2 = ( U 2 , T 2 ) be two solutions of the SP for A. Then T 2 = U 2 H U 1 T 1 U 1 H U 2 . □
Proof. It suffices to observe that A = U 1 T 1 U 1 H = U 2 T 2 U 2 H . □
Definition 3. 
The solutions Π 1 and Π 2 are said to be diagonally equal if Diag ( T 1 ) = Diag ( T 2 ) , and diagonally different if Diag ( T 1 ) Diag ( T 2 ) . □
The next proposition is generally known since 1933 and is attributed to H. Röseler, see e.g. [[14], Theorem 2.3]. It gives sufficient and “almost necessary” conditions for diagonal equality of the solutions of the Schur problem. The formulation and proof of the results given below are slightly different from the known ones.
Proposition 2. 
The following assertions hold true.
  • If V = U 1 H U 2 D * ( n ) then the solutions Π 1 and Π 2 are diagonally equal.
  • If the matrix A has pair-wise distinct eigenvalues and the solutions Π 1 and Π 2 are diagonally equal then V D * ( n ) .□
Proof. To prove 1 note that the condition V D * ( n ) is equivalent to the existence of a matrix D D * ( n ) such that U 2 = U 1 D . In this case
T 1 ( i , j ) = D ( i , i ) D ( j , j ) ¯ T 2 ( i , j ) , T 1 ( i , i ) = T 2 ( i , i )
and Diag ( T 1 ) = Diag ( T 2 ) .
To prove 2 we use the fact that T 1 V = V T 2 . Partition the matrices in this equality as
T 1 = λ * 0 Λ , T 2 = λ * 0 * , V = μ u v W ,
where λ spect ( A ) , Λ C ( n 1 ) , μ C , W C ( n 1 ) and * is a matrix block of corresponding size. We have
T 1 V = * * Λ v Λ W , V T 2 = λ μ * λ v *
and comparing the (2,1)-blocks of these matrices we get Λ v = λ v . Since λ spect ( Λ ) we obtain v = 0 . Hence | μ | = 1 , u = 0 and V = diag ( μ , W ) . Now the proof is completed by induction. □
The MATLAB® command [U,T] = schur(A) computes a particular solution ( U , T ) of the SP for the matrix A C ( n ) . The aim of the computation of the ConSF T of a general matrix A C ( n ) is to determine the eigenvalues of A as the diagonal elements of T. But the Schur problem may be defined also for matrices A which are already in ConSF, i.e. A T ( n ) . For such matrices the above MATLAB® command computes the solution ( I n , A ) of the Schur problem for A. At the same time the Schur problem for A T ( n ) has infinitely many solutions. In order to tie them down we introduce the following definition.
Definition 4. 
If A T ( n ) then the pair ( I n , A ) is called the principal solution of the Schur problem for A. □
Without additional assumptions the matrix T T ( n ) is only a condensed form rather than a canonical form of A relative to the similarity action of U ( n ) . The only (albeit most important) invariants for this action which, revealed by the matrix T, are the eigenvalues λ k ( A ) = T ( k , k ) , k Z [ 1 , n ] , of the matrix A which appear on the diagonal of T.
The definition of complete invariants and canonical forms for the similarity action of U ( n ) on C ( n ) , see [14], is more subtle and is not considered in full detail here. Further on we consider, among others, only a partial formulation of Schur canonical forms for generic matrices A, see also [1,9] and [3]. Note that from point of view of applications the condensed forms provide the same advantages as the canonical forms. Moreover, strict canonical forms of the matrix A are rarely (if ever) used in practice since they are usually defined by complicated conditions and procedures and are more sensitive to perturbations in A.
Let U U ( A ) and D D * ( n ) . Then U D U ( A ) as well. Thus we have c U U ( A ) , where c C , | c | = 1 , and U U ( A ) in particular. This fact has an important implication. The diameter of the set U ( A ) , i.e. the maximum of U V for U , V U ( A ) , is equal to 2 and is achieved for U U ( A ) and V = U U ( A ) .
Given the matrix A C ( n ) , neither the ConSF T T ( n ) of A nor the transformation matrix U U ( n ) are unique in general. In fact, the ConSF T of A C ( n ) is unique if and only if A = λ I n , where λ C . In this case T = A and U U ( n ) is an arbitrary unitary matrix, or, equivalently, T ( A ) = { A } and U ( A ) = U ( n ) .
If A has at least two different eigenvalues then we have a set T ( A ) of ConSF T with different ordering of the eigenvalues of A on the diagonal of T. The ConSF also differ in their strictly upper triangular parts.
Suppose that spect ( A ) consists of m n pair-wise disjoint elements λ 1 , λ 2 , , λ m with multiplicities n 1 , n 2 , , n m , where n 1 + n 2 + + n m = n . Then there are
N = N ( n 1 , n 2 , , n m ) = n ! n 1 ! n 2 ! n m !
different orderings of the elements T ( k , k ) on the diagonal Diag ( T ) of the ConSF T, or N diagonally different solutions of the SP for A.
Here one of the ConSF of A is the block matrix T = [ T k , l ] with T k , l C ( n k , n l ) and T ( k , k ) T ( n k ) , where Diag ( T k , k ) = λ k I k . In the generic case m = n we have N ( 1 , 1 , , 1 ) = n ! diagonally different ConSF, while in the “most non-generic” case m = 1 we have N ( n ) = 1 and all ConSF are diagonally equal.

3. Canonical Schur Forms for Generic Matrices

In this section we summarize and reformulate some of the results concerning Schur canonical forms for the unitary similarity action of U ( n ) on the set C ( n ) . The canonical Schur form T T ( n ) of the matrix A C ( n ) is a ConSF with additional conditions imposed on its elements, see [14] and the references therein. We consider only generic matrices A with pair-wise disjoint eigenvalues for which the solution ( U , T ) of the Schur problem is continuous as a function of the matrix A. At the same time the Schur basis U for condensed forms (and hence for canonical forms as well) of a matrix A with multiple eigenvalues may be discontinuous as a function of A.
Definition 5. 
For A C ( n ) the set
Or [ A , U ( n ) ] = { U H A U : U U ( n ) } C ( n )
is called the equivalence class, or orbit, of the matrix A relative to the similarity action of the unitary group U ( n ) . □
Obviously B Or [ A , U ( n ) ] implies A Or [ B , U ( n ) ] and vice versa. Let A C ( n ) and C T ( n ) be certain sets.
Definition 6. 
The matrices A , B C ( n ) are said to be unitary equivalent (denoted as A B ) if B Or [ A , U ( n ) ] .□
Definition 7. 
The function γ : A C is said to be a canonical form for the similarity action of the group U ( n ) on the set A when the equality γ ( A ) = γ ( B ) holds if and only if A B . □
Thus the canonical form γ : A C is a complete invariant [6] for the similarity action of the group U ( n ) on the set A but the opposite, of course, is not true. The canonical form γ thus defined is a function. Informally, we also say that the image γ ( A ) T ( n ) of the matrix A under γ is a unitary canonical form, or Schur form, of A.
Definition 8. 
The subset A of C ( n ) is said to be closed in the Zariski topology [6] if it is the union of the zeros of a system of polynomials in z C ( n ) . The subset A C ( n ) is said to be open in the Zariski topology if its complement C ( n ) A C ( n ) is closed in this topology. □
Definition 9. 
A property P of a matrix A C ( n ) is said to be generic if it is fulfilled on a subset A C ( n ) which is open in the Zariski topology. □
Informally, the matrix A is said to be generic relative to a given property if this property is generic.
Proposition 3. 
The following properties of a matrix A C ( n ) are generic.
  • The matrix A is totally different from any fixed matrix A 0 C ( n ) , i.e. A ( k , l ) A 0 ( k , l ) for k , l Z [ 1 , n ] ; in particular A ( k , l ) 0 for any given pair ( k , l ) .
  • The matrix A is not normal, i.e. A H A A A H ; in particular the matrix A is not unitary.
  • The singular values of the matrix A are positive and pair-wise different; in particular rank ( A ) = n .
  • The eigenvalues λ k of the matrix A satisfy the inequalities Re ( λ k ) Re ( λ l ) and Im ( λ k ) Im ( λ l ) for k l ; in particular λ k λ l for k l and the Jordan canonical form of A is diagonal.
  • Any ConSF T of the matrix A has nonzero and pair-wise different elements on and above its diagonal, i.e. T ( k , l ) 0 and T ( i , j ) T ( k , l ) for i j , k l and ( i , j ) ( k , l ) . □

4. Geometry of Schur Canonical Sets

Let ω = ( ω 1 , ω 2 , , ω n ) : Z [ 1 , n ] Z [ 1 , n ] be a permutation of the integers 1 , 2 , , n and recall that Z [ 1 , n 1 ] = { 1 , 2 , , n 1 } and Z [ 2 , n ] = { 2 , 3 , , n } . Set Z n = Z [ 1 , n 1 ] × Z [ 2 , n ] .
Below we describe a possible set of canonical forms for the similarity action of the group U ( n ) on the subset C ( n ) of matrices with pair-wise disjoint eigenvalues. Let K ( n ) Z n n 1 be the set of ( n 1 ) -tuples
{ ( i 1 , j 1 ) , ( i 2 , j 2 ) , , ( i n 1 , j n 1 ) }
of integer pairs p k = ( i k , j k ) , k Z [ 1 , n 1 ] , where i k < j k . There are μ n such ( n 1 ) -tuples, see Table 1. Later on we shall define three important types of such sets.
Definition 10. 
The conjugate pair of the pair p = ( i , j ) Z n is
p τ = ( i , j ) τ = ( n + 1 j , n + 1 i ) Z n
The pair p is self-conjugate if p τ = p .□
Obviously, the pair ( i , j ) is self-conjugate if and only if i + j = n + 1 .
Definition 11. 
The conjugate  ( n 1 ) -tuple of the ( n 1 ) -tuple θ = ( p 1 , p 2 , , p n 1 ) , where p k = ( i k , j k ) , k Z [ 1 , n 1 ] , is
θ τ = p 1 τ , p 2 τ , , p n 1 τ .
The ( n 1 ) -tuple θ is self-conjugate if θ τ = θ . □
The conjugation for pairs p and ( n 1 ) -tuples θ is an involution, i.e. ( ( i , j ) τ ) τ = ( i , j ) and ( θ τ ) τ = θ . It corresponds to reflection relative to the anti-diagonal ( 1 , n ) , ( 2 , n 1 ) , , ( n , 1 ) of n × n arrays.
Definition 12. 
The set K ( n ) has the following important subsets.
  • The set K 1 ( n ) K ( n ) is of type 1 if its elements are of the form
    { ( i 1 , 1 ) , ( i 2 , 2 ) , , ( i n 1 , n 1 ) }
  • The set K 2 ( n ) K ( n ) is of type 2 if its elements are of the form
    { ( 1 , j 1 ) , ( 2 , j 2 ) , , ( n 1 , j n 1 ) }
  • The set K 3 ( n ) = K ( n ) ( K 1 ( n ) K 2 ( n ) ) K ( n ) is of type 3 if it is neither of type 1 nor of type 2. □
Note that the elements of the set K 1 ( n ) are conjugate to the elements of the set K 2 ( n ) .
Proposition 4. 
The intersection K 1 ( n ) K 2 ( n ) has a single element
θ @ = { ( 1 , 2 ) , ( 2 , 3 ) , , ( n 1 , n ) }
which is a self-conjugate ( n 1 ) -tuple.□
Definition 13. 
The elements of the set K 1 ( n ) K 2 ( n ) are said to be proper. The elements of the set K 3 ( n ) are said to be improper. □
There are ( n 1 ) ! elements in each of the sets K 1 ( n ) and K 2 ( n ) and one joint element of K 1 ( n ) and K 2 ( n ) . Thus we have
card ( K 1 ( n ) K 2 ( n ) ) = ( n 1 ) ! + ( n 1 ) ! 1 = 2 ( n 1 ) ! 1 card ( K 3 ( n ) ) = μ n 2 ( n 1 ) ! + 1
Example 1. 
For n = 2 there is μ 2 = 1 pair of indexes ( 1 , 2 ) and it is proper. For n = 3 there are μ 3 = 3 sets of pairs of indexes
{ ( 1 , 2 ) , ( 1 , 3 ) } , { ( 1 , 2 ) , ( 2 , 3 ) } , { ( 1 , 3 ) , ( 2 , 3 ) }
and all they are proper. For n = 4 there are μ 4 = 20 triples of pairs of indexes of which 11 are proper, namely
{ ( 1 , 2 ) , ( 2 , 3 ) , ( 3 , 4 ) } , { ( 1 , 2 ) , ( 1 , 3 ) , ( 1 , 4 ) } , { ( 1 , 4 ) , ( 2 , 4 ) , ( 3 , 4 ) } { ( 1 , 2 ) , ( 1 , 3 ) , ( 2 , 4 ) } , { ( 1 , 3 ) , ( 2 , 4 ) , ( 3 , 4 ) } , { ( 1 , 2 ) , ( 1 , 3 ) , ( 3 , 4 ) } { ( 1 , 3 ) , ( 2 , 3 ) , ( 3 , 4 ) } , { ( 1 , 2 ) , ( 2 , 3 ) , ( 2 , 4 ) } , { ( 1 , 4 ) , ( 2 , 3 ) , ( 3 , 4 ) } { ( 1 , 4 ) , ( 2 , 3 ) , ( 3 , 4 ) } , { ( 1 , 2 ) , ( 2 , 3 ) , ( 1 , 4 ) }
and 9 are improper, namely
{ ( 1 , 3 ) , ( 2 , 3 ) , ( 3 , 4 ) } , { ( 1 , 3 ) , ( 1 , 4 ) , ( 2 , 4 ) } , { ( 1 , 2 ) , ( 1 , 4 ) , ( 3 , 4 ) } { ( 1 , 2 ) , ( 1 , 3 ) , ( 2 , 4 ) } , { ( 1 , 3 ) , ( 2 , 4 ) , ( 3 , 4 ) } , { ( 1 , 2 ) , ( 1 , 3 ) , ( 3 , 4 ) } { ( 1 , 2 ) , ( 1 , 3 ) , ( 2 , 3 ) } , { ( 1 , 3 ) , ( 1 , 4 ) , ( 3 , 4 ) } , { ( 1 , 2 ) , ( 1 , 4 ) , ( 2 , 4 ) }
Proposition 5. 
The minimal and maximal elements relative to the order relation ≺ on the set K 2 ( n ) are
θ 1 = { ( 1 , 2 ) , ( 1 , 3 ) , , ( 1 , n ) }
and
θ ( n 1 ) ! = θ @ = { ( 1 , 2 ) , ( 2 , 3 ) , , ( n 1 , n ) } ,
resp. The minimal and maximal elements of the set K 1 ( n ) are θ @ and
θ 2 ( n 1 ) ! 1 = { ( 1 , n ) , ( 2 , n ) , , ( n 1 , n ) }
resp.
Now we are in position to define a possible set of Schur canonical forms S T ( n ) for generic matrices A C ( n ) . There are n ! ( 2 ( n 1 ) ! 1 ) such sets. The multiplier n ! comes from the different orderings of the (simple) eigenvalues of A on the diagonal of S. The multiplier 2 ( n 1 ) ! 1 corresponds to different choices of proper ( n 1 ) -tuples
{ ( i 1 , j 1 ) , ( i 2 , j 2 ) , , ( i n 1 , j n 1 ) }
such that the elements S ( i k , j k ) , k Z [ 1 , n 1 ] , of S are positive.
If we assume that the eigenvalues of S are ordered as λ 1 λ 2 λ n then there remain 2 ( n 1 ) ! 1 sets of Schur canonical forms. Note that any fixed ordering of the (simple) eigenvalues of A on the diagonal of S is preserved only by unitary similarity transformations with matrices U, such that U ( k , k ) = exp ( i φ k ) , k Z [ 1 , n ] .
If in particular we choose a given ( n 1 ) -tuple, say
{ ( 1 , 2 ) , ( 2 , 3 ) , , ( n 1 , n ) } K 1 ( n ) K 2 ( n )
then the set of Schur canonical forms is uniquely fixed. In this case the Schur canonical forms have the form
λ 1 * * 0 λ 2 * 0 0 λ n 1 0 0 0 λ n
where ⊕ denotes a positive element. Two other Schur canonical forms are
λ 1 0 λ 2 * * 0 0 λ n 1 * 0 0 0 λ n , λ 1 * * 0 λ 2 * 0 0 λ n 1 0 0 0 λ n
Note that there is a similar problem with Jordan canonical forms of matrices A C relative to general similarity transformations. Usually it is assumed that different orderings of the Jordan blocks do not produce different Jordan forms. Formally this means that the Jordan canonical form of A is not a single block-diagonal matrix J C ( n ) but a class of block-diagonal matrices, which are permutationally equivalent to J.
Definition 14. 
A set C T ( n ) of Schur canonical forms T T ( n ) for generic matrices A C ( n ) and a fixed ( n 1 ) -tuple
{ ( i 1 , j 1 ) , ( i 2 , j 2 ) , , ( i n 1 , j n 1 ) } K 1 K 2
is characterized as follows.
  • The n diagonal elements of the matrix T are ordered as
    T ( 1 , 1 ) T ( 2 , 2 ) T ( n , n ) .
  • The n 1 elements T ( i 1 , j 1 ) , T ( i 2 , j 2 ) , , T ( i n 1 , j n 1 ) of T over the diagonal are real and positive.□
Of course, we may choose the elements T ( i k , j k ) to be real and negative as well, or to have angles equal to a fixed value φ 0 ( π , π ] , etc.
A matrix A C with eigenvalues λ 1 λ 2 λ n may be transformed into Schur canonical form C T ( n ) by the next three steps.
  • The matrix A is transformed into any Schur condensed form T 1 = U 1 H A U 1 T ( n ) by a matrix U 1 U ( n ) . Numerically this is done by the QR algorithm [5]. For this purpose the code schur from MATLAB® may be used [10].
  • A condensed Schur form T 2 = U 2 H T 1 U 2 T ( n ) is constructed so that T 2 ( k , k ) = λ k , k Z [ 1 , n ] . This may be done by several complex plane rotations, which interchange the positions of two diagonal elements T 1 ( i , i ) and T 1 ( j , j ) of T 1 such that i < j but T ( i , i ) > T ( j , j ) , see e.g. [5].
  • A diagonal matrix U 3 U ( n ) with elements U 3 ( 1 , 1 ) = 1 , U 3 ( k , k ) = exp ( i φ k ) , φ k R , k Z [ 2 , n ] , is chosen so that the matrix T = U 3 H T 2 U 3 has positive elements in positions ( i k , j k ) .
We recall that to introduce Schur canonical forms in the set C ( n ) relative to the similarity action of U ( n ) we use the lexicographical order ≺ on C R × R . For z k = x k + i y k C , where x k , y k R , k = 1 , 2 , we write z 1 z 2 if either x 1 < x 2 , or x 1 = x 2 and y 1 < y 2 .
There are
μ n = ν n n 1 , ν n = n ( n 1 ) / 2 ,
sets of generic canonical forms C k T ( n ) , k Z [ 1 , μ n ] , for A C ( n ) . The values of μ n for small values of n are given at Table 1.
There are μ n different pairs of p k = ( i k , j k ) , 1 i < j n . They are ordered lexicographically according to the rule ( i 1 , j 1 ) ( i 2 , j 2 ) if either i 1 < i 2 , or i 1 = i 2 and j 1 < j 2 . We may order the pairs p k as p 1 p 2 p μ n , where
k = k n ( i , j ) = j + n ( i 1 ) i ( i + 1 ) 2 .
Thus we have the chain of inequalities
( 1 , 2 ) ( 1 , 3 ) ( 1 , n ) ( 2 , 3 ) ( 2 , n ) ( n 2 , n 1 ) ( n 2 , n ) ( n 1 , n )
It follows from (2) that for n fixed and any k Z [ 1 , ν n ] there exists a unique integer i = i n ( k ) such that a n ( i ) k b n ( i ) , where
a n ( i ) = 1 + ( i 1 ) ( 2 n i ) 2 , b n ( i ) = i ( 2 n i 1 ) 2 .
The integer i n ( k ) may be defined from
a n ( i n ( k ) ) = max i { a n ( i ) k }
or
b n ( i n ( k ) ) = min i { b n ( i ) k } .
Finally set
j n ( k ) = k n ( i n ( k ) 1 ) + i n ( k ) ( i n ( k ) + 1 ) 2 .
Thus we have defined a bijection
( i , j ) k = k n ( i , j ) , k ( i , j ) = ( i n ( k ) , j n ( k ) ) ,
between the ordered sets of integers Z [ 1 , ν n ] and integer pairs ( i , j ) , where 1 i < j n .
Proposition 6. 
The triple of pairs of indexes ( ( i , k ) , ( i , j ) , ( l , j ) ) , where i < k , i < j , l < j and k < j , i < l , is said to be improper. The triple of pairs of indexes ( ( k , j ) , ( i , j ) , ( i , l ) ) , where k < j , i < j , i < l and k < i , j < l , is said to be improper. □
Each set θ K 1 ( n ) K 2 ( n ) of proper integer ( n 1 ) -tuples defines a class C ( θ ) T ( n ) of canonical forms for the unitary similarity action of the group U ( n ) on generic matrices A C ( n ) . These forms are upper triangular matrices S with S ( k , k ) S ( k + 1 , k + 1 ) for k Z [ 1 , n 1 ] and T ( i , j ) R , T ( i , j ) > 0 for ( i , j ) θ . □
If the matrix A C ( n ) with eigenvalues λ 1 λ 2 λ n is already transformed into condensed Schur form, i.e. A T ( n ) , it is then easily put into canonical form as follows. First a matrix U U ( n ) is chosen so as
Diag ( S ) = diag ( λ 1 , λ 2 , , λ n ) , S = U H A U .
Then a diagonal unitary matrix D with D ( 1 , 1 ) = 1 is found so that T = D H S D C ( θ ) . Denoting
S ( i , j ) = | S ( i , j ) | exp ( i α ( i , j ) )
and D ( i , i ) = exp ( i φ ( i ) ) , φ ( 1 ) = 0 , where α ( i , j ) , φ ( i ) ( π , π ] , the conditions S ( i , j ) > 0 give the system of n 1 linear equations
φ ( i ) φ ( j ) = α ( i , j ) , ( i , j ) θ ,
for φ ( 2 ) , φ ( 3 ) , , φ ( n ) . If it happens that φ ( k ) ( π , π ] for some k then φ ( k ) is replaced by
φ ˜ ( k ) = φ ( k ) mod ( 2 π ) ( π , π ] .
Three special sets of Schur canonical forms for generic matrices A C ( n ) deserve attention. For these sets the system (3) for φ ( i ) , i Z [ 2 , n ] , is easily solved explicitly. The first set of generic canonical forms corresponds to the pairs of indexes ( 1 , j ) , j Z [ 2 , n ] , and here the solution of (3) is
φ ( i ) = α ( 1 , i ) .
The second set corresponds to the index pairs ( i , n ) , i Z [ 1 , n 1 ] , the solution of (3) being
φ ( i ) = α ( i , n ) α ( 1 , n ) .
The third set corresponds to the indexes ( i , i + 1 ) , i Z [ 1 , n 1 ] , and here the solution of (3) is
φ ( i ) = k = 1 i 1 α ( k , k + 1 ) .
In all these cases the convention (4) is presupposed.
The restrictions assumed in this section, and in particular the condition that the eigenvalues of A are pair-wise distinct, seem serious, but in fact their violation can make the perturbation analysis of the Schur decomposition meaningless. If e.g. A has two or more equal eigenvalues then the Schur basis of the perturbed Schur problem may be discontinuous as a function of the perturbation in A, see e.g. [8] and [12].

5. Real Schur Canonical Forms

The considerations above are valid for real or genuinely complex matrices with spectra that may in turn be real or genuinely complex. In particular we have the following four possibilities: 1. The matrix A is real and has real spectrum; 2. The matrix A is real and has genuinely complex spectrum (i.e. there is at least one complex conjugate pair α ± i β of eigenvalues, where 0 < β R ); 3. The matrix A is genuinely complex and has real spectrum, and 4. The matrix A is genuinely complex and has genuinely complex spectrum.
When the matrix A is real (cases 1 and 2), i.e. A R ( n ) , then we may use orthogonal transformation matrices U O ( n ) instead of unitary ones to obtain the real Schur canonical form and the real Schur condensed forms of A. In case 1 the transformation matrix U U ( n ) is taken as orthogonal, i.e. U O ( n ) , and both the Schur canonical form and the Schur condensed forms of A are real upper triangular matrices T with the eigenvalues of A on their main diagonals.
Case 2 is slightly more subtle. Here the transformation matrix U may be chosen as orthogonal [11,14], while the canonical form and the condensed forms of A are upper block-triangular matrices with 1 × 1 or 2 × 2 blocks ( λ k R or Λ k R ( 2 ) ) on the main diagonal. In this case there is at least one 2 × 2 block
Λ k = α k β k β k a k R ( 2 )
corresponding to the eigenvalues α k + i β k , α k i β k of A, where α k , β k R and β k > 0 .
Let n > 2 and suppose that the spectrum spect ( A ) contains m real elements λ 1 , λ 2 , , λ m and n m genuinely complex elements α k + i β k , α k i β k , k = 1 , 2 , , ( n m ) / 2 , where the number n m is even. Set q = ( n m ) / 2 . Then the orthogonal canonical form of A has the structure
S = U A U = S 1 , 1 S 1 , 2 O n m , m S 2 , 2
Here S 1 , 1 R ( m ) , S 1 , 2 R ( m , n m ) , S 2 , 2 R ( n m ) ,
S 1 , 1 = λ 1 s 1 , 2 s 1 , m 0 λ 2 s 2 , m 0 0 λ m , S 2 , 2 = Λ 1 S 1 , 2 S 1 , q O 2 Λ 2 S 2 , q O 2 O 2 Λ q
and s i , j R , S i , j R ( 2 ) . The diagonal blocks are ordered so as λ 1 < λ 2 < < λ m and α t + i β t α t + 1 + i β t + 1 , t = 1 , 2 , , q .

6. Perturbations

Let ( U , T ) U ( n ) × T ( n ) be a fixed solution of the Schur problem for the matrix A C ( n ) with the convention that if A T ( n ) then U = I n and T = A . Let δ A C ( n ) be a perturbation in A. Usually (but not always) we suppose that the matrix δ A is small relative to A, e.g. δ A ρ c A , where ρ is the rounding unit of the binary floating-point arithmetic (FPA) used in the computations [2] and c is a small positive constant. In double precision FPA we have ρ = 2 53 1.1102 × 10 16 .
We often assume that the perturbation δ A is a 1-parameter family δ A ( ε ) = ε E , where ε > 0 is a small parameter and E C ( n ) is a fixed matrix with E = 1 , i.e. δ A = ε . The technique of the so called fictitious small parameter can also be used in the perturbation analysis of matrix problems. Assuming that δ A is small relative to A we use the identity δ A = ε E , where E = δ A / δ A and ε is finally set to 1.
The formulation of the perturbed Schur problem (PSP), i.e. the Schur problem for a perturbed matrix A + δ A , is not trivial, see the examples in the next Section. First we mention two facts.
  • If the PSP for a slightly perturbed matrix A + δ A has a slightly perturbed solution ( U + δ U , T + δ T ) with
    δ U , δ T = O ( δ ) , δ = δ A 0 ,
    then it also has a significantly perturbed solution ( U + Δ U , T + δ T ) with Δ U = 2 U δ U and Δ U = 2 + O ( δ ) . More precisely, we have
    2 δ U 2 U + δ U = Δ U = U + ( U + δ U ) 2 .
  • The solution of the PSP for the matrix A + δ A may have the form ( U , T + δ T ) with δ U = 0 . This will happen if and only if U H δ A U T ( n ) and in this case δ T = δ A .
Let ( U 0 , T 0 ) U ( n ) × T ( n ) be a solution of the Schur problem for the matrix A 0 C ( n ) under the convention that if A 0 T ( n ) then U 0 = I n and T 0 = A 0 . Consider for simplicity the case δ A = ε A 1 , where ε [ 0 , ε 0 ) , ε 0 > 0 , is a small parameter and A 1 C ( n ) is a fixed matrix with A 1 = 1 . Let ( U ( ε ) , T ( ε ) ) U ( n ) × T ( n ) be a solution to the PSP for the matrix A ( ε ) : = A 0 + ε A 1 , i.e.
T ( ε ) = U H ( ε ) A ( ε ) U ( ε ) , U ( ε ) U ( n ) , T ( ε ) T ( n ) .
Since the solution of the PSP always exists, we have defined functions U ( · ) : [ 0 , ε 0 ) U ( n ) and T ( · ) : [ 0 , ε 0 ) T ( n ) through the relations (5). The problem is that there are many such functions and not all of them are suitable for perturbation analysis. The aim of the next definition is to clarify the concepts in this area.
Definition 15. 
The pair ( U ( ε ) , T ( ε ) ) is said to be a regular solution of the PSP for the matrix A ( ε ) = A 0 + ε A 1 if the functions U ( · ) and T ( · ) are continuous on the interval [ 0 , ε 0 ) and ( U ( 0 ) , T ( 0 ) ) is the principal solution of the SP for A 0 . □
A number of examples of condensed Schur forms presented in the next section illustrate the structure of these forms and the behavior of their perturbations, see also [7].
Example 2. 
Let A C ( n ) be a scalar matrix, i.e. A = λ I n , λ C . Then the general solution of the Schur problem for A is U ( n ) × { A } . The opposite statement is also true in the form of the next two assertions.
  • If U ( A ) = U ( n ) then A is a scalar matrix and T ( A ) = { A } .
  • If T ( A ) = { A } then A is a scalar matrix and U ( A ) = U ( n ) . □
Example 3. 
Let A = λ I n + J n , where λ C and J n = [ 0 , I n 1 ; 0 , 0 ] is the n × n Jordan block with zero eigenvalue. Then
U ( A ) = U ( n ) D ( n ) , T ( A ) = { λ I n + X : | X | = J n } .

7. Examples of Real 2 × 2 Matrices

In this section we consider several examples illustrating the concepts introduced so far. In what follows “Schur form” means “condensed Schur form”. The examples are for Schur problem and PSP for matrices A R ( 2 ) with real spectra for which the transformation group is O ( 2 ) . This is the most simple non-trivial case. However, the effects observed are in fact valid for matrices A C ( n ) , n > 2 , e.g. of the form A = [ A 1 , 1 , A 1 , 2 ; 0 , A 2 , 2 ] , where A 1 , 1 R ( 2 ) and A 2 , 2 C ( n 2 ) .
Matrices A R ( 2 ) correspond to linear operators R 2 R 2 and have the simplest nontrivial albeit rich structure. A surprisingly large number of facts about general linear operators is revealed by such matrices, see e.g. [4] and the examples below.
Example 4. 
Let the matrix A R ( 2 ) has eigenvalues λ 1 , λ 2 and set
r = A F 2 | λ 1 | 2 | λ 2 | 2 .
Then the following four cases are possible in which the statements are reversible.
  • If λ 1 = λ 2 = λ and r = 0 then there exists a unique Schur form λ I 2 of A.
  • If λ 1 = λ 2 = λ and r > 0 then there exist two Schur forms λ I 2 ± r E 1 , 2 of A.
  • If λ 1 λ 2 and r = 0 then there exist two Schur forms diag ( λ 1 , λ 2 ) and diag ( λ 2 , λ 1 ) of A.
  • If λ 1 λ 2 and r > 0 then there exist four Schur forms
    diag ( λ 1 , λ 2 ) ± r E 1 , 2 , diag ( λ 2 , λ 1 ) ± r E 1 , 2
    of A. □
Example 5. 
Let A = λ I 2 , λ R . We have U ( λ I 2 ) = O ( 2 ) and T ( λ I 2 ) = { λ I 2 } . Since λ I 2 is in Schur form, the principal solution of the Schur problem is ( I 2 , λ I 2 ) . Let the matrix λ I 2 be perturbed to λ I 2 + ε E 2 , 1 , ε 0 . Then the Schur decomposition of the perturbed matrix is
U = I 2 + δ U , T = λ I 2 + δ T .
The set of transformation matrices U ( λ I 2 + ε E 2 , 1 ) consists of 4 matrices U 1 , U 1 , U 2 , U 2 , where
U 1 = E 1 , 2 + E 2 , 1 , U 2 = E 1 , 2 E 2 , 1 .
In view of the equalities U k = I 2 + δ U k , for two of these matrices we have
δ U 1 = I 2 ± U 1 = 2
and for the other two we have
δ U 2 = I 2 ± U 2 = 2 .
At the same time the set of Schur forms T ( λ I 2 + ε E 2 , 1 ) consists of two matrices λ I 2 ± ε E 1 , 2 . Thus the transformation matrix U ( λ I 2 + ε E 2 , 1 ) is discontinuous (or infinitely sensitive) as a function of the perturbation parameter ε at the point ε = 0 .
Consider also the multivalued function Ψ : R 2 O ( 2 ) , where 2 O ( 2 ) is the set of subsets of O ( 2 ) , defined by
ε Ψ ( ε ) = U ( λ I 2 + ε E 2 , 1 ) .
We have Ψ ( 0 ) = O ( 2 ) and
Ψ ( ε ) = { U 1 , U 1 , U 2 , U 2 }
for ε > 0 . Hence the function Ψ , i.e. the Schur basis for R ( 2 , 1 ) relative to the matrix λ I 2 + ε E 2 , 1 , is discontinuous at the point ε = 0 , while the Schur forms of λ I 2 + ε E 2 , 1 are continuous and well conditioned in ε . □
Example 6. 
Let A 0 = λ I 2 + E 1 , 2 R ( 2 ) be a Jordan block with eigenvalue λ R . The set T ( A 0 ) contains two matrices
T 0 , 1 = λ I 2 + E 1 , 2 , T 0 , 2 = λ I 2 E 1 , 2 ,
while the set U ( A 0 ) contains four matrices
I 2 , I 2 , E 1 , 1 E 2 , 2 , E 2 , 2 E 1 , 1 .
Let the matrix A 0 be perturbed to A ( ε ) = A 0 + ε E 2 , 1 , ε > 0 . The eigenvalues of A ( ε ) are λ 1 ( ε ) = λ ε , λ 2 ( ε ) = λ + ε . Setting
c ( ε ) = 1 1 + ε , s ( ε ) = ε 1 + ε
we see that there are four Schur forms
T 1 ( ε ) = λ 1 ( ε ) t ( ε ) 0 λ 2 ( ε ) , T 2 ( ε ) = λ 1 ( ε ) t ( ε ) 0 λ 2 ( ε ) ,
and
T 3 ( ε ) = λ 2 ( ε ) t ( ε ) 0 λ 1 ( ε ) , T 4 ( ε ) = λ 2 ( ε ) t ( ε ) 0 λ 1 ( ε ) ,
where t ( ε ) = 1 ε . The orthonormal matrices U k ( ε ) that transform A ( ε ) into Schur forms T k ( ε ) , respectively, are
U 1 ( ε ) = c ( ε ) s ( ε ) s ( ε ) c ( ε ) , U 2 ( ε ) = c ( ε ) s ( ε ) s ( ε ) c ( ε ) ,
and
U 3 ( ε ) = c ( ε ) s ( ε ) s ( ε ) c ( ε ) , U 4 ( ε ) = c ( ε ) s ( ε ) s ( ε ) c ( ε )
Hence there are two regular solutions of this PSP, namely ( U 1 ( ε ) , T 1 ( ε ) ) and ( U 3 ( ε ) , T 3 ( ε ) ) corresponding to the unperturbed diagonally different Schur forms T 0 , 1 and T 0 , 2 , respectively. □
Example 7. 
Let A 0 = diag ( λ 1 , λ 2 ) , λ 1 λ 2 . Here the set T ( A 0 ) contains two diagonally different Schur forms
T 0 , 1 = diag ( λ 1 , λ 2 ) , T 0 , 2 = diag ( λ 2 , λ 1 )
of A 0 , while the set O ( A 0 ) has 8 elements, namely
± E 1 , 1 ± E 2 , 2 , ± E 1 , 2 ± E 2 , 1 .
Let us again choose δ A ( ε ) = ε E 2 , 1 . For ε 0 the set T ( A 0 + ε E 2 , 1 ) has four elements:
T ˜ 1 ( ε ) = T 0 , 1 + ε E 1 , 2 , T ˜ 2 ( ε ) = T 0 , 1 ε E 1 , 2
and
T ˜ 3 ( ε ) = T 2 + ε E 1 , 2 , T ˜ 4 ( ε ) = T 2 ε E 1 , 2 .
The matrices U 1 , U 1 from Example 5 transform the perturbed matrix A + δ A ( ε ) into the Schur form T ˜ 3 ( ε ) and the matrices U 2 , U 2 transform A + δ A ( ε ) into the Schur form T ˜ 4 ( ε ) since U 1 and U 2 transform δ A ( ε ) in ± ε E 1 , 2 T ( 2 ) , respectively.
Consider now the transformation of A + δ A into some of the Schur forms T ˜ 1 ( ε ) or T ˜ 2 ( ε ) . Define the orthogonal matrices
U 1 ( ε ) = c ( ε ) s ( ε ) s ( ε ) c ( ε ) , U 2 ( ε ) = c ( ε ) s ( ε ) s ( ε ) c ( ε ) ,
where
c ( ε ) = λ 1 λ 2 ε 2 + ( λ 1 λ 2 ) 2 , s ( ε ) = ε ε 2 + ( λ 1 λ 2 ) 2 .
We have
U k ( ε ) ( A + δ A ( ε ) ) U k ( ε ) = T ˜ k ( ε ) , k = 1 , 2 .
Furthermore, it is fulfilled U 2 ( 0 ) = I 2 and U 1 ( 0 ) = diag ( 1 , 1 ) . Hence the regular solution of the PSP is ( U 2 ( ε ) , T ˜ 2 ( ε ) ) . □
Example 8. 
Let
A 0 = diag ( λ 1 , λ 2 ) + a E 1 , 2 R ( 2 ) ,
where δ = | λ 1 λ 2 | > 0 and a 0 . The set T ( A 0 ) of condensed Schur forms of A 0 contains 4 matrices:
T 1 , 2 = diag ( λ 1 , λ 2 ) ± a E 1 , 2 , T 3 , 4 = diag ( λ 2 , λ 1 ) ± a E 1 , 2 .
The Schur canonical form of A 0 is
S 0 = diag ( λ min , λ max ) + | a | E 1 , 2 T ( A 0 ) ,
where
λ min = min { λ 1 , λ 2 } < λ max = max { λ 1 , λ 2 } .
Let the matrix A 0 be perturbed to A ( ε ) = A 0 + ε E 2 , 1 , where ε is a small parameter such that δ 2 + 4 a ε > 0 , i.e. ε ( ε 0 , ε 0 ) , where ε 0 = δ 2 / ( 4 | a | ) . The condensed Schur forms of the matrix A ( ε ) are
T ˜ 1 , 2 = diag ( λ ˜ 1 , λ ˜ 2 ) ± a ˜ E 1 , 2 , T ˜ 3 , 4 = diag ( λ ˜ 2 , λ ˜ 1 ) ± a ˜ E 1 , 2 ,
where the quantities λ ˜ 1 = λ ˜ 1 ( ε ) , λ ˜ 2 = λ ˜ 2 ( ε ) and a ˜ = a ˜ ( ε ) are analytical functions of ε . In particular
λ ˜ 1 = λ 1 + a ε λ 1 λ 2 + O ( ε 2 ) , λ ˜ 2 = λ 2 + a ε λ 2 λ 1 + O ( ε 2 ) , a ˜ = a ε + O ( ε 2 ) , ε 0 .
Among the four condensed forms only the matrix T ˜ 1 = diag ( λ ˜ 1 , λ ˜ 2 ) + a ˜ E 1 , 2 is regular. □

8. Diagonally Spectral Matrices

Denote by Δ ( n ) C ( n ) the set of matrices A C ( n ) such that the multiset of its diagonal elements is equal to the multiset of its eigenvalues, i.e.
spect ( A ) = { A ( 1 , 1 ) , A ( 2 , 2 ) , , A ( n , n ) }
Otherwise speaking, Δ ( n ) is the set of matrices A such that
det ( A A ( k , k ) I n ) = 0 , k Z [ 1 , n ]
Definition 16. 
The matrices A Δ ( n ) which satisfy (6) or (7) are said to be diagonally spectral. □
The set Δ ( n ) C ( n ) is defined by n algebraic equations (7) (some of them may not be independent) in the elements of A and is hence a closed algebraic variety of complex dimension up to n ( n 1 ) .
Upper triangular matrices and lower triangular matrices are diagonally spectral. Schur condensed form in particular are diagonally spectral. More generally, for P O ( n ) being a permutation matrix, and A C ( n ) being a diagonally spectral matrix, the matrix P A P is also diagonally spectral.
Example 9. 
The elements of the matrix A Δ ( 2 ) satisfy one independent algebraic equation A ( 1 , 2 ) A ( 2 , 1 ) = 0 . Hence matrices A Δ ( 2 ) have the form
* * 0 * , * 0 *
where * denotes unspecified matrix elements.□
Example 10. 
The matrices A 1 , A 1 , A 2 , A 2 , A 3 , A 3 C ( 3 ) , where
A 1 = * * * 0 * * 0 0 * , A 2 = * 0 * * * 0 0 * , A 3 = * * * 0 * 0 0 * * ,
are diagonally spectral.□
Matrices from Δ ( n ) may not be condensed in the sense that they have n ( n 1 ) / 2 zero elements. In particular matrices from Δ ( n ) may have all their elements different from zero.
Example 11. 
Let z C be a parameter. Then the matrices
A ( z ) = 1 1 1 0 2 1 z z 3 , B ( z ) = 1 1 1 z 2 1 z 2 2 3
are diagonally spectral, i.e.
spect ( A ( z ) ) = spect ( B ( z ) ) = { 1 , 2 , 3 } .
We stress that A ( 0 ) T ( 3 ) but B ( z ) T ( 3 ) for all z C . □
The main advantage of a Schur canonical or condensed form
T = U A U T ( n ) , U U ( n )
of a matrix A C ( n ) is that it reveals the spectrum { λ 1 , λ 2 , , λ n } of the matrix A as the collection of the diagonal elements
{ T ( 1 , 1 ) , T ( 2 , 2 ) , , T ( n , n ) }
of the form T. Thus the sets of Schur canonical and Schur condensed forms are subsets of the larger set (closed in the Zarisky topology) Δ ( n ) .
Important observation The requirement that the condensed form T is upper triangular, i.e. T T ( n ) , may lead to extreme sensitivity of the transformation pair ( T , U ) relative to perturbations in the matrix A.
Example 12. 
For the matrix A = λ I 2 , λ C , the pair ( T , U ) is ( λ I 2 , I 2 ) . If we perturb A to A ˜ = λ I 2 + ε E 2 , 1 , where ε > 0 is arbitrarily small, the pair ( T , U ) is transformed to ( T ˜ , U ˜ ) , where T ˜ = λ I 2 + ε E 1 , 2 and U ˜ is any of the four matrices ± E 1 , 2 ± E 2 , 1 . Thus U U ˜ F = 2 and the transformation matrix U = U ( ε ) is even discontinuous at the point ε = 0 .□
This high sensitivity may not be relevant to the problem of computing the spectrum spect ( A ) of A. To avoid such artificial sensitivity in the next section we introduce the concept of quasi-Schur condensed forms.

9. Quasi-Schur Condensed Forms

Definition 17. 
A matrix S = U H A U C ( n ) , U U ( n ) , is said to be a quasi-Schur condensed form of A C ( n ) if it is block-upper triangular with m 1 diagonal blocks S k , k C ( n k ) , n = n 1 + n 2 + + n m , i.e.
S = S 1 , 1 S 1 , 2 S 1 , m O S 2 , 2 S 2 , m O O S m , m
and either S k , k T ( n k ) or S k , k T ( n k ) , k Z [ 1 , m ] .□
Example 13. 
For n = 2 the quasi-Schur condensed forms have the structure A 1 , A 1 , where A 1 T ( 2 ) . For n = 3 the quasi-Schur condensed forms are A 1 , A 1 , A 2 , A 2 and A 3 , A 3 , where A 1 T ( 3 ) ,
A 2 = * * * 0 * 0 0 * * , A 3 = * 0 * * * 0 0 * .
and * denotes unspecified quantities.□
Quasi-Schur condensed forms are diagonally spectral but the opposite is not true for n 3 , see e.g. Example 11.
Obviously a Schur condensed form is also a quasi-Schur condensed form but the opposite may not be true (we recall that n 2 ). We stress that high sensitivity of Schur forms as in Example 12 may not be observed for quasi-Schur condensed forms.

10. Conclusions

In this paper we have considered the Schur canonical forms for a square matrix A with pair-wise distinct eigenvalues. Sensitivity of the Schur form relative to perturbations in A was also studied. The concept of regular solution to the perturbed Schur form was introduced and illustrated by a number of examples. We have also introduced the concepts of diagonally spectral matrices (Schur forms are diagonally spectral) and of quasi-Schur condensed forms of a matrix A which may be much less sensitive to perturbations in A.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

References

  1. J. Brenner, The problem of unitary equivalence, Acta Mathematica, 86 (1951), pp. 297-308. [CrossRef]
  2. IEEE Computer Society, 754-2019-IEEE Standard for Floating-Point Arithmetic, https://ieeexplore.ieee.org/document/8766229, 2019. [CrossRef]
  3. K. Ikramov, The canonical Schur form of a matrix with simple eigenvalues, Doklady Mathematics, 77 (2008), no. 3, pp. 359-360. [CrossRef]
  4. M. Glazman and Ju. Ljubich, Finite-Dimensional Linear Analysis: A Systematic Presentation in Problem Form, New York, Dover Books in Mathematics, Dover Publications, 2006, ISBN 978-0486453323.
  5. G. Golub and C. Van Loan, Matrix Computations, Baltimore, The Johns Hopkins University Press (4th edition), 2013, ISBN 978-1421407944.
  6. R. Hartshorne, Algebraic Geometry, Berlin, Springer-Verlag, 1977, ISBN 978-0387902449.
  7. M. Konstantinov and P. Petkov, Perturbation Methods in Matrix Analysis and Control, New York, Nova Science Publishers, 2020, ISBN 978-1536174700, BISAC:MAT034000. M. [CrossRef]
  8. M. Konstantinov, P. Petkov and N. Christov, Nonlocal perturbation analysis of the Schur system of a matrix, SIAM Journal on Matrix Analysis and Applications, 15 (1994), no. 2, pp. 383-392. [CrossRef]
  9. D. Littlewood, On unitary equivalence, Journal of the London Mathematical Society, 28 (1953), pp. 314-322. [CrossRef]
  10. MATLAB®, Math. Graphics. Programming, Natick, MathWorks Inc. (release R2024b), 2024, www.mathworks.com.
  11. F. Murnaghan and A. Wintner, A canonical form for real matrices under orthogonal transformations. Proceedings of the National Academy of Sciences of the USA, 17(7) (1931), pp. 417-420. [CrossRef]
  12. P. Petkov, Componentwise perturbation analysis of the Schur decomposition of a matrix, SIAM Journal on Matrix Analysis and Applications, 42 (2021), no. 1, pp. 108-133. [CrossRef]
  13. I. Schur, Beiträge zur Theorie der Gruppen linearer homogener Substitutionen. Transactions of the American Mathematical Society, 10 (1909), pp. 159-175. [CrossRef]
  14. H. Shapiro, A survey of canonical forms and invariants for unitary similarity. Linear Algebra and its Applications, 147 (1991), pp. 101-167. [CrossRef]
Table 1. Number of generic canonical forms
Table 1. Number of generic canonical forms
n 2 3 4 5 6 7 8 9 10
μ n 1 3 20 210 3003 54264 1184040 30260340 886163135
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated