Algorithms for finding inverse of two patterned matrices over \(\mathbb{Z}_p\) (Q1725108)
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: Algorithms for finding inverse of two patterned matrices over Z_p |
scientific article; zbMATH DE number 7023177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding inverse of two patterned matrices over \(\mathbb{Z}_p\) |
scientific article; zbMATH DE number 7023177 |
Statements
Algorithms for finding inverse of two patterned matrices over \(\mathbb{Z}_p\) (English)
0 references
14 February 2019
0 references
Summary: Circulant matrix families have become an important tool in network engineering. In this paper, two new patterned matrices over \(\mathbb{Z}_p\) which include row skew first-plus-last right circulant matrix and row first-plus-last left circulant matrix are presented. Their basic properties are discussed. Based on Newton-Hensel lifting and Chinese remaindering, two different algorithms are obtained. Moreover, the cost in terms of bit operations for each algorithm is given.
0 references
0 references
0 references
0 references
0.8168414235115051
0 references
0.7952831387519836
0 references
0.7892346382141113
0 references
0.7839192748069763
0 references
