Versal families of matrices with respect to unitary conjugation (Q762580): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0001-8708(84)90045-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031668834 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON MATRICES DEPENDING ON PARAMETERS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5675842 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: LECTURES ON BIFURCATIONS IN VERSAL FAMILIES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4482901 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5818478 / rank | |||
Normal rank |
Latest revision as of 15:57, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Versal families of matrices with respect to unitary conjugation |
scientific article |
Statements
Versal families of matrices with respect to unitary conjugation (English)
0 references
1984
0 references
The object of the paper is first to classify the conjugacy class, \({}^ t\bar PAP\) of \(A\in M(n)\), the space of square complex matrices and \(P\in U(n)\), the unitary group and to find an algorithm to obtain, (i) \(\Delta\) A an upper triangular matrix belonging to its conjugacy class, and (ii) the stabilizer of \(\Delta\) A, i.e., \(\{P\in U(n)|^ t\bar P\Delta AP=\Delta A\}\). Next, the authors consider the (local) normal form problem for families of matrices (smoothly) depending on parameters. The problem is solved by constructing a versal deformation with a minimum number of parameters for each \(\Delta\) A. Finally an algorithm for these deformations is obtained. Both the algorithms depend on elementary moves and proofs are based on the rank of matrices, its Jordan type and its polar decomposition.
0 references
(local) normal form
0 references
conjugacy class
0 references
rank
0 references
Jordan form
0 references
polar decomposition
0 references
versal deformation
0 references
transversals
0 references