
doi: 10.1007/bf02936555
FLS \(r\)-circulant and FLS \(r\)-retrocirculant matrices are defined. Based on the proved theorems algorithms are deduced for the computation of the inverse or group inverse of regular and singular FLS \(r\)-circulant matrices, respectively, using representations of the matrices and the Euclidean algorithm. The inverse of the FLS \(r\)-retrocirculant matrix can be computed using an established relationship between the two matrix types. Two examples are given, one for a nonsingular and another for a singular matrix.
polynomial ring, numerical examples, Numerical solutions to overdetermined systems, pseudoinverses, group inverse, FLS \(r\)-retrocirculant matrix, Canonical forms, reductions, classification, inverse, Hermitian, skew-Hermitian, and related matrices, Direct numerical methods for linear systems and matrix inversion, FLS \(r\)-circulant matrix, Euclidean algorithm
polynomial ring, numerical examples, Numerical solutions to overdetermined systems, pseudoinverses, group inverse, FLS \(r\)-retrocirculant matrix, Canonical forms, reductions, classification, inverse, Hermitian, skew-Hermitian, and related matrices, Direct numerical methods for linear systems and matrix inversion, FLS \(r\)-circulant matrix, Euclidean algorithm
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
