Circulant decomposition of a matrix and the eigenvalues of Toeplitz type matrices
From MaRDI portal
Publication:6131571
Abstract: We begin by showing that any matrix can be decomposed into a sum of circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing recursive iterations for these circulant components. It is also shown that the dominance of a few circulant components in the matrix allows sparse similarity transformations using Fast-Fourier-transform (FFT) operations. This enables the evaluation of all eigenvalues of dense Toeplitz, block-Toeplitz, and other periodic or quasi-periodic matrices, to a reasonable approximation in arithmetic operations. The utility of the approximate similarity transformation in preconditioning linear solvers is also demonstrated.
Recommendations
- A decomposition of Toeplitz matrices and optimal circulant preconditioning
- Approximation of Toeplitz matrices by sums of circulants and small-rank matrices
- Circulant and Skewcirculant Matrices for Solving Toeplitz Matrix Problems
- Some Aspects of Circulant Preconditioners
- Effective algorithms with circulant-block matrices
This page was built for publication: Circulant decomposition of a matrix and the eigenvalues of Toeplitz type matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131571)