Efficient algorithm for finding the inverse and the group inverse of FLS \(r\)-circulant matrix
DOI10.1007/BF02936555zbMath1087.65024OpenAlexW2018749585MaRDI QIDQ2386796
Publication date: 25 August 2005
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02936555
numerical examplespolynomial ringinversegroup inverseEuclidean algorithmFLS \(r\)-circulant matrixFLS \(r\)-retrocirculant matrix
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Hermitian, skew-Hermitian, and related matrices (15B57) Direct numerical methods for linear systems and matrix inversion (65F05) Canonical forms, reductions, classification (15A21)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Level-\(m\) scaled circulant factor matrices over the complex number field and the quaternion division algebra
- Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
- Generalized inverses of certain Toeplitz matrices
- On the Solution of Circulant Linear Systems
- An Alternate Definition of a Pseudoinverse of a Matrix
This page was built for publication: Efficient algorithm for finding the inverse and the group inverse of FLS \(r\)-circulant matrix