A recursive algorithm for the inversion of matrices with circulant blocks
From MaRDI portal
Publication:2371501
DOI10.1016/j.amc.2006.10.044zbMath1125.65026OpenAlexW2053965833MaRDI QIDQ2371501
Emmanouil G. Alivizatos, Nikolaos Leonidas Tsitsas, Grigoris I. Kalogeropoulos
Publication date: 4 July 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.10.044
algorithmnumerical examplecomparison of methodsdiscrete Fourier transformmatrix inversion\(LU\) decomposition methodcomputation complexityrecursive inversionmatrices with circulant blocks
Related Items
Matrix decomposition algorithms for elliptic boundary value problems: A survey, In search of hyperpaths, Computing the square roots of a class of circulant matrices, Determinants and inverses of circulant matrices with Jacobsthal and Jacobsthal-Lucas numbers, Memory-usage advantageous block recursive matrix inverse
Uses Software
Cites Work
- Cyclic odd-even reduction for symmetric circulant matrices
- Electronic Green scattering with \(n\)-fold symmetry axis from block circulant matrices
- Effective algorithms with circulant-block matrices
- Toeplitz and Circulant Matrices: A Review
- A Proposal for Toeplitz Matrix Calculations
- Inversion of block-circulant matrices and circular array approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item