Factorization makes fast Walsh, PONS and other Hadamard-like transforms easy. (English) Zbl 1363.15021

Brandts, J. (ed.) et al., Proceedings of the international conference ‘Applications of mathematics’, Prague, Czech Republic, November 18–21, 2015. In honor of the birthday anniversaries of Ivo Babuška (90), Milan Práger (85), and Emil Vitásek (85). Prague: Czech Academy of Sciences, Institute of Mathematics (ISBN 978-80-85823-65-3). 100-109 (2015).
Summary: A simple device, based on the factorization of invertible matrix polynomials, enabling to identify the possibility of fast implementation of linear transforms is presented. Its applicability is demonstrated in the case of Hadamard matrices and their generalization, Hadamard matrix polynomials.
For the entire collection see [Zbl 1329.00187].


15A23 Factorization of matrices
15B34 Boolean and Hadamard matrices
65Y20 Complexity and performance of numerical algorithms
Full Text: Link