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
be the set of integers and
, where
. We denote by
(or by ) the set of integers . We write and when . The set of real (resp. complex) numbers is denoted by (resp. ) and is the imaginary unit. A complex number z is written as with , or , where is the absolute value and is the angle of z. The complex conjugate of z is denoted as .
The sign function
for scalar arguments is defined as
,
and
for
,
and
, resp. The sign function for real
n-tuples
is defined by the expression
The lexicographical order ≺ for n-tuples is defined as , and if , and , resp. Otherwise speaking, when either , or there exists such that for and . We write if either or . We use this lexicographical order for complex numbers written as real pairs and for pairs of integers . For example, for the fourth roots of 1, we have .
We denote by (resp. ) the space of complex (resp. real) matrices with elements and we set , . The column m-vector with elements is written as , while the row n-vector with elements is denoted as . A quantity 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 matrix is denoted as . The element of is the Kronecker delta symbol . The zero matrix is denoted as with , or simply as O. We denote by the strictly lower triangular matrix with ones below its main diagonal and zeros otherwise, i.e. if and if . The elementary matrix with element 1 in position and zero otherwise is denoted as , i.e. .
The absolute value of the matrix is the matrix with elements . The transpose of the matrix is denoted and has elements . The complex conjugate transpose of is denoted by and has elements . The i-th row and the j-th column of A are denoted as and , respectively. For we denote by the element-wise product of A and B, i.e. . The spectral and the Frobenius norms of the matrix are denoted as and , resp.
The spectrum of the matrix is the collection, or the multiset, of the eigenvalues of A, , counted according to their algebraic multiplicities. With certain abuse of notation we write in the general case, and in the case when all eigenvalues of A are real.
The multiplicative group of unitary matrices such that is denoted by . The group of orthonormal matrices such that is denoted as . For we denote by and the strictly lower triangular and the diagonal parts of A, respectively. If x is an n-vector with elements then is the matrix with elements .
The set of upper triangular matrices
is denoted as
, while the set of diagonal matrices
is denoted as
. For
the group of diagonal matrices of the form
where
, is denoted as
.
If is a finite set then is the number of its elements. The set of -tuples of pairs of integers , , where , is denoted as .
Finally we set
and
In particular and . 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
,
, be given. Then according to the famous Schur theorem [
13] there exists a factorization
of the matrix
A, where
and
.
Definition 1. The pair
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
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 and if the spectrum of A is real then the transformation matrix may be chosen as and we have . If and the spectrum of A is genuinely complex then a real block Schur form with and 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
and
Thus
is the set of unitary matrices transforming the matrix
A into ConSF, and
is the set of ConSF of
A. For matrices
with real spectra we denote
In general the set is not a group and not even a groupoid, i.e. does not imply .
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. , . Because of the only condition the matrix T is only a condensed form (rather than a canonical form) of A relative to the similarity action , defined by , of the group on the set .
Definition 2. The problem of finding the ConSF (
1) is referred to as the
Schur problem (SP) for the matrix
. The
general solution of the SP is the set
of all ConSF of
A. A pair
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 and to emphasize their dependence on A. This dependence, however, is not functional. Indeed, the transformation matrix is always not unique, e.g. implies . With exception of the case , , when it is fulfilled , the upper triangular unitary equivalent form of A is also not unique. For the latter choice of A we have .
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 and be two solutions of the SP for A. Then . □
Proof. It suffices to observe that . □
Definition 3. The solutions and are said to be diagonally equal if , and diagonally different if . □
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 then the solutions and are diagonally equal.
If the matrix A has pair-wise distinct eigenvalues and the solutions and are diagonally equal then .□
Proof. To prove 1 note that the condition
is equivalent to the existence of a matrix
such that
. In this case
and
.
To prove 2 we use the fact that
. Partition the matrices in this equality as
where
,
,
,
and * is a matrix block of corresponding size. We have
and comparing the (2,1)-blocks of these matrices we get
. Since
we obtain
. Hence
,
and
. Now the proof is completed by induction. □
The MATLAB® command [U,T] = schur(A) computes a particular solution of the SP for the matrix . The aim of the computation of the ConSF T of a general matrix 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. . For such matrices the above MATLAB® command computes the solution of the Schur problem for A. At the same time the Schur problem for has infinitely many solutions. In order to tie them down we introduce the following definition.
Definition 4. If then the pair is called the principal solution of the Schur problem for A. □
Without additional assumptions the matrix is only a condensed form rather than a canonical form of A relative to the similarity action of . The only (albeit most important) invariants for this action which, revealed by the matrix T, are the eigenvalues , , of the matrix A which appear on the diagonal of T.
The definition of complete invariants and canonical forms for the similarity action of
on
, 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 and . Then as well. Thus we have , where , , and in particular. This fact has an important implication. The diameter of the set , i.e. the maximum of for , is equal to 2 and is achieved for and .
Given the matrix , neither the ConSF of A nor the transformation matrix are unique in general. In fact, the ConSF T of is unique if and only if , where . In this case and is an arbitrary unitary matrix, or, equivalently, and .
If A has at least two different eigenvalues then we have a set 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
consists of
pair-wise disjoint elements
with multiplicities
, where
. Then there are
different orderings of the elements
on the diagonal
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 with and , where . In the generic case we have diagonally different ConSF, while in the “most non-generic” case we have 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
on the set
. The canonical Schur form
of the matrix
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
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
the set
is called the
equivalence class, or
orbit, of the matrix
A relative to the similarity action of the unitary group
. □
Obviously implies and vice versa. Let and be certain sets.
Definition 6. The matrices are said to be unitary equivalent (denoted as ) if .□
Definition 7. The function is said to be a canonical form for the similarity action of the group on the set when the equality holds if and only if . □
Thus the canonical form
is a
complete invariant [
6] for the similarity action of the group
on the set
but the opposite, of course, is not true. The canonical form
thus defined is a function. Informally, we also say that the image
of the matrix
A under
is a unitary canonical form, or Schur form, of
A.
Definition 8. The subset
of
is said to be
closed in the Zariski topology [
6] if it is the union of the zeros of a system of polynomials in
. The subset
is said to be
open in the Zariski topology if its complement
is closed in this topology. □
Definition 9. A property of a matrix is said to be generic if it is fulfilled on a subset 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 are generic.
The matrix A is totally different from any fixed matrix , i.e. for ; in particular for any given pair .
The matrix A is not normal, i.e. ; in particular the matrix A is not unitary.
The singular values of the matrix A are positive and pair-wise different; in particular .
The eigenvalues of the matrix A satisfy the inequalities and for ; in particular for 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. and for , and . □
4. Geometry of Schur Canonical Sets
Let be a permutation of the integers and recall that and . Set .
Below we describe a possible set of canonical forms for the similarity action of the group
on the subset
of matrices with pair-wise disjoint eigenvalues. Let
be the set of
-tuples
of integer pairs
,
, where
. There are
such
-tuples, see Table 1. Later on we shall define three important types of such sets.
Definition 10. The
conjugate pair of the pair
is
The pair p is self-conjugate if .□
Obviously, the pair is self-conjugate if and only if .
Definition 11. The
conjugate -tuple of the
-tuple
, where
,
, is
The -tuple is self-conjugate if . □
The conjugation for pairs p and -tuples is an involution, i.e. and . It corresponds to reflection relative to the anti-diagonal of arrays.
Definition 12. The set has the following important subsets.
Note that the elements of the set are conjugate to the elements of the set .
Proposition 4. The intersection
has a single element
which is a self-conjugate
-tuple.□
Definition 13. The elements of the set are said to be proper. The elements of the set are said to be improper. □
There are
elements in each of the sets
and
and one joint element of
and
. Thus we have
Example 1. For
there is
pair of indexes
and it is proper. For
there are
sets of pairs of indexes
and all they are proper. For
there are
triples of pairs of indexes of which 11 are proper, namely
and 9 are improper, namely
Proposition 5.
The minimal and maximal elements relative to the order relation ≺ on the set are
resp. The minimal and maximal elements of the set are and
resp.□
Now we are in position to define a possible set of Schur canonical forms
for generic matrices
. There are
such sets. The multiplier
comes from the different orderings of the (simple) eigenvalues of
A on the diagonal of
S. The multiplier
corresponds to different choices of proper
-tuples
such that the elements
,
, of
S are positive.
If we assume that the eigenvalues of S are ordered as then there remain 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 , .
If in particular we choose a given
-tuple, say
then the set of Schur canonical forms is uniquely fixed. In this case the Schur canonical forms have the form
where ⊕ denotes a positive element. Two other Schur canonical forms are
Note that there is a similar problem with Jordan canonical forms of matrices 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 but a class of block-diagonal matrices, which are permutationally equivalent to J.
Definition 14. A set
of Schur canonical forms
for generic matrices
and a fixed
-tuple
is characterized as follows.
The
n diagonal elements of the matrix
T are ordered as
The elements of T over the diagonal are real and positive.□
Of course, we may choose the elements to be real and negative as well, or to have angles equal to a fixed value , etc.
A matrix with eigenvalues may be transformed into Schur canonical form by the next three steps.
The matrix
A is transformed into any Schur condensed form
by a matrix
. 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
is constructed so that
,
. This may be done by several complex plane rotations, which interchange the positions of two diagonal elements
and
of
such that
but
, see e.g. [
5].
A diagonal matrix with elements , , , , is chosen so that the matrix has positive elements in positions .
We recall that to introduce Schur canonical forms in the set relative to the similarity action of we use the lexicographical order ≺ on . For , where , , we write if either , or and .
There are
sets of generic canonical forms
,
, for
. The values of
for small values of
n are given at
Table 1.
There are
different pairs of
,
. They are ordered lexicographically according to the rule
if either
, or
and
. We may order the pairs
as
, where
Thus we have the chain of inequalities
It follows from (
2) that for
n fixed and any
there exists a unique integer
such that
, where
The integer
may be defined from
or
Thus we have defined a bijection
between the ordered sets of integers
and integer pairs
, where
.
Proposition 6. The triple of pairs of indexes , where , , and , , is said to be improper. The triple of pairs of indexes , where , , and , , is said to be improper. □
Each set of proper integer -tuples defines a class of canonical forms for the unitary similarity action of the group on generic matrices . These forms are upper triangular matrices S with for and , for . □
If the matrix
with eigenvalues
is already transformed into condensed Schur form, i.e.
, it is then easily put into canonical form as follows. First a matrix
is chosen so as
Then a diagonal unitary matrix
D with
is found so that
. Denoting
and
,
, where
, the conditions
give the system of
linear equations
for
. If it happens that
for some
k then
is replaced by
Three special sets of Schur canonical forms for generic matrices
deserve attention. For these sets the system (
3) for
,
, is easily solved explicitly. The first set of generic canonical forms corresponds to the pairs of indexes
,
, and here the solution of (
3) is
The second set corresponds to the index pairs
,
, the solution of (
3) being
The third set corresponds to the indexes
,
, and here the solution of (
3) is
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 of eigenvalues, where ); 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. , then we may use orthogonal transformation matrices 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 is taken as orthogonal, i.e. , 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
or
blocks (
or
) on the main diagonal. In this case there is at least one
block
corresponding to the eigenvalues
,
of
A, where
and
.
Let
and suppose that the spectrum
contains
m real elements
and
genuinely complex elements
,
, where the number
is even. Set
. Then the orthogonal canonical form of
A has the structure
Here
,
,
,
and
,
. The diagonal blocks are ordered so as
and
,
.
6. Perturbations
Let
be a fixed solution of the Schur problem for the matrix
with the convention that if
then
and
. Let
be a perturbation in
A. Usually (but not always) we suppose that the matrix
is small relative to
A, e.g.
, 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
.
We often assume that the perturbation is a 1-parameter family , where is a small parameter and is a fixed matrix with , i.e. . The technique of the so called fictitious small parameter can also be used in the perturbation analysis of matrix problems. Assuming that is small relative to we use the identity , where and is finally set to 1.
The formulation of the perturbed Schur problem (PSP), i.e. the Schur problem for a perturbed matrix , is not trivial, see the examples in the next Section. First we mention two facts.
Let
be a solution of the Schur problem for the matrix
under the convention that if
then
and
. Consider for simplicity the case
, where
,
, is a small parameter and
is a fixed matrix with
. Let
be a solution to the PSP for the matrix
, i.e.
Since the solution of the PSP always exists, we have defined functions
and
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 is said to be a regular solution of the PSP for the matrix if the functions and are continuous on the interval and is the principal solution of the SP for . □
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 be a scalar matrix, i.e. , . Then the general solution of the Schur problem for A is . The opposite statement is also true in the form of the next two assertions.
Example 3. Let
, where
and
is the
Jordan block with zero eigenvalue. Then
7. Examples of Real 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 with real spectra for which the transformation group is . This is the most simple non-trivial case. However, the effects observed are in fact valid for matrices , , e.g. of the form , where and .
Matrices
correspond to linear operators
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
has eigenvalues
and set
Then the following four cases are possible in which the statements are reversible.
If and then there exists a unique Schur form of A.
If and then there exist two Schur forms of A.
If and then there exist two Schur forms and of A.
If
and
then there exist four Schur forms
of
A. □
Example 5. Let
,
. We have
and
. Since
is in Schur form, the principal solution of the Schur problem is
. Let the matrix
be perturbed to
,
. Then the Schur decomposition of the perturbed matrix is
The set of transformation matrices
consists of 4 matrices
, where
In view of the equalities
, for two of these matrices we have
and for the other two we have
At the same time the set of Schur forms consists of two matrices . Thus the transformation matrix is discontinuous (or infinitely sensitive) as a function of the perturbation parameter at the point .
Consider also the multivalued function
, where
is the set of subsets of
, defined by
We have
and
for
. Hence the function
, i.e. the Schur basis for
relative to the matrix
, is discontinuous at the point
, while the Schur forms of
are continuous and well conditioned in
. □
Example 6. Let
be a Jordan block with eigenvalue
. The set
contains two matrices
while the set
contains four matrices
Let the matrix
be perturbed to
,
. The eigenvalues of
are
,
. Setting
we see that there are four Schur forms
and
where
. The orthonormal matrices
that transform
into Schur forms
, respectively, are
and
Hence there are two regular solutions of this PSP, namely and corresponding to the unperturbed diagonally different Schur forms and , respectively. □
Example 7. Let
,
. Here the set
contains two diagonally different Schur forms
of
, while the set
has 8 elements, namely
Let us again choose
. For
the set
has four elements:
and
The matrices from Example 5 transform the perturbed matrix into the Schur form and the matrices transform into the Schur form since and transform in , respectively.
Consider now the transformation of
into some of the Schur forms
or
. Define the orthogonal matrices
where
Furthermore, it is fulfilled and . Hence the regular solution of the PSP is . □
Example 8. Let
where
and
. The set
of condensed Schur forms of
contains 4 matrices:
The Schur canonical form of
is
where
Let the matrix
be perturbed to
, where
is a small parameter such that
, i.e.
, where
. The condensed Schur forms of the matrix
are
where the quantities
,
and
are analytical functions of
. In particular
Among the four condensed forms only the matrix is regular. □
8. Diagonally Spectral Matrices
Denote by
the set of matrices
such that the multiset of its diagonal elements is equal to the multiset of its eigenvalues, i.e.
Otherwise speaking,
is the set of matrices
A such that
Definition 16. The matrices
which satisfy (
6) or (
7) are said to be
diagonally spectral. □
The set
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
.
Upper triangular matrices and lower triangular matrices are diagonally spectral. Schur condensed form in particular are diagonally spectral. More generally, for being a permutation matrix, and being a diagonally spectral matrix, the matrix is also diagonally spectral.
Example 9. The elements of the matrix
satisfy one independent algebraic equation
. Hence matrices
have the form
where * denotes unspecified matrix elements.□
Example 10. The matrices
, where
are diagonally spectral.□
Matrices from may not be condensed in the sense that they have zero elements. In particular matrices from may have all their elements different from zero.
Example 11. Let
be a parameter. Then the matrices
are diagonally spectral, i.e.
We stress that but for all . □
The main advantage of a Schur canonical or condensed form
of a matrix
is that it reveals the spectrum
of the matrix
A as the collection of the diagonal elements
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)
.
Important observation The requirement that the condensed form T is upper triangular, i.e. , may lead to extreme sensitivity of the transformation pair relative to perturbations in the matrix A.
Example 12. For the matrix , , the pair is . If we perturb A to , where is arbitrarily small, the pair is transformed to , where and is any of the four matrices . Thus and the transformation matrix is even discontinuous at the point .□
This high sensitivity may not be relevant to the problem of computing the spectrum 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
,
, is said to be a
quasi-Schur condensed form of
if it is block-upper triangular with
diagonal blocks
,
, i.e.
and either
or
,
.□
Example 13. For
the quasi-Schur condensed forms have the structure
, where
. For
the quasi-Schur condensed forms are
,
and
, where
,
and * denotes unspecified quantities.□
Quasi-Schur condensed forms are diagonally spectral but the opposite is not true for , 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 ). 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
- J. Brenner, The problem of unitary equivalence, Acta Mathematica, 86 (1951), pp. 297-308. [CrossRef]
- IEEE Computer Society, 754-2019-IEEE Standard for Floating-Point Arithmetic, https://ieeexplore.ieee.org/document/8766229, 2019. [CrossRef]
- K. Ikramov, The canonical Schur form of a matrix with simple eigenvalues, Doklady Mathematics, 77 (2008), no. 3, pp. 359-360. [CrossRef]
- 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.
- G. Golub and C. Van Loan, Matrix Computations, Baltimore, The Johns Hopkins University Press (4th edition), 2013, ISBN 978-1421407944.
- R. Hartshorne, Algebraic Geometry, Berlin, Springer-Verlag, 1977, ISBN 978-0387902449.
- 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]
- 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]
- D. Littlewood, On unitary equivalence, Journal of the London Mathematical Society, 28 (1953), pp. 314-322. [CrossRef]
- MATLAB®, Math. Graphics. Programming, Natick, MathWorks Inc. (release R2024b), 2024, www.mathworks.com.
- 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]
- 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]
- I. Schur, Beiträge zur Theorie der Gruppen linearer homogener Substitutionen. Transactions of the American Mathematical Society, 10 (1909), pp. 159-175. [CrossRef]
- 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 |
|
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. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).