Efficient algorithm for finding inverse and group inverse of the RSFPrLR circulant matrix in codes (Q2862001)
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: Efficient algorithm for finding inverse and group inverse of the RSFPrLR circulant matrix in codes |
scientific article; zbMATH DE number 6226573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithm for finding inverse and group inverse of the RSFPrLR circulant matrix in codes |
scientific article; zbMATH DE number 6226573 |
Statements
13 November 2013
0 references
RSFPrLR circulant matrix
0 references
group inverse
0 references
inverse
0 references
patterned matrices
0 references
algorithm
0 references
numerical examples
0 references
0.9099767
0 references
0.85434395
0 references
0.84101534
0 references
Efficient algorithm for finding inverse and group inverse of the RSFPrLR circulant matrix in codes (English)
0 references
The paper propose two families of patterned matrices, i.e. the RSFPrLR circulant matrix and the RSLPrFL circulant matrix in codes over the complex field. The authors present an algorithm for finding the inverse and the group inverse of the RSFPrLR circulant matrix. The inverse of the RSLPrFL circulant matrix is computed using the relationship between the RSFPrLR circulant matrix and an RSLPrFL circulant matrix. Numerical examples are also discussed.
0 references
