Creation and annihilation in matrix theory (Q1968755)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Creation and annihilation in matrix theory |
scientific article; zbMATH DE number 1419713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Creation and annihilation in matrix theory |
scientific article; zbMATH DE number 1419713 |
Statements
Creation and annihilation in matrix theory (English)
0 references
21 March 2000
0 references
The two most fundamental procedures in matrix theory deal with the completion and elimination of a single column: (i) complete (embed) a column into a matrix \(B\) with a certain prescribed property; (ii) eliminate (sweep out) all but one of its entries by using a matrix \(S\) of a certain prescribed type. A closed form representation is given for the matrix \(S\) that sweeps out a single column. This includes the integer as well as the unitary and regular cases. The closed form is built up from \(2\times 2\) case. The product rule for adjoints is used to show that the dual of this procedure is precisely the completion procedure, which completes a single column to a matrix \(B\) such that \(SB=BS=\) diagonal. This construction underlines the fact that the completion and elimination processes are complementary. By permuting rows suitably, the matrices may be assumed to be in lower Hessenberg form.
0 references
creation
0 references
annihilation
0 references
adjoints
0 references
Brahma
0 references
Shiva
0 references
completion
0 references
elimination
0 references
0.6846562623977661
0 references
0.6846562623977661
0 references
0.6806293725967407
0 references
0.6732441186904907
0 references