Algorithms explained by symmetries

DOI10.1007/3-540-59042-0_70MaRDI QIDQ4596618zbMATH OpenOpenAlexFDO

Authors Torsten Minkwitz

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_70

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Symmetry-based matrix factorization
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• Evaluating finite Fourier transforms that respect group symmetries
• Generating symmetric DFTs and equivariant FFT algorithms
• scientific article; zbMATH DE number 475354

Cited in

(6)

• Algorithmic symmetry classification with invariance
• Generating symmetric DFTs and equivariant FFT algorithms
• Symmetry-based matrix factorization
• Spring algorithms and symmetry
• Sparse generalized Fourier transforms
• Decomposing monomial representations of solvable groups.

This page was built for publication: Algorithms explained by symmetries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596618)