Factoring matrices into the product of circulant and diagonal matrices

DOI10.1007/s00041-015-9395-0zbMath1327.15028OpenAlexW1981479685MaRDI QIDQ744956

Allan Perämäki, Marko Huhtanen

Publication date: 12 October 2015

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00041-015-9395-0

zbMATH Keywords

circulant matrixfactorization of matricespolynomial factoringdiagonal matrixmultiplicative Fourier compressionsparsity structure

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Polynomials in real and complex fields: factorization (12D05) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

Salem-Zygmund inequality for locally sub-Gaussian random variables, random trigonometric polynomials, and random circulant matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating ideal diffractive optical systems
• Some speed-ups and speed limits for real algebraic geometry
• Preconditioning techniques for large linear systems: A survey
• Decomposing a matrix into circulant and diagonal factors
• The product of matrix subspaces
• Preconditioning Highly Indefinite and Nonsymmetric Matrices
• Pinching, Trimming, Truncating, and Averaging of Matrices
• Maximality of the monomial group
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• Factoring in the metaplectic group and optics
• Combinatorial Matrix Theory