A low-complexity algorithm to search for Legendre pairs

From MaRDI portal

Jump to:navigation, search

DOI10.1016/J.LAA.2025.01.010MaRDI QIDQ6966779zbMATH OpenFDO

Authors Sirani M. Perera, Ilias S. Kotsireas

Publication date 27 June 2025

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transforms matrix equations structured matrices matrix analysis sparse and orthogonal factors complexity and performance of algorithms Legendre pairs

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Boolean and Hadamard matrices (15B34) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrix equations and identities (15A24) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for matrix equations (65F45)

This page was built for publication: A low-complexity algorithm to search for Legendre pairs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_low-complexity_algorithm_to_search_for_Legendre_pairs&oldid=76152279"