A low-complexity algorithm to search for Legendre pairs

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)

Full work available at URL https://doi.org/10.1016/J.LAA.2025.01.010

zbMATH Keywords

fast Fourier transformsmatrix equationsstructured matricesmatrix analysissparse and orthogonal factorscomplexity and performance of algorithmsLegendre 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)

Cites work

• scientific article; zbMATH DE number 3650737 (Why is no real title available?)
• scientific article; zbMATH DE number 53687 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• scientific article; zbMATH DE number 1219592 (Why is no real title available?)
• scientific article; zbMATH DE number 1350351 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 2120941 (Why is no real title available?)
• scientific article; zbMATH DE number 846277 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• A fast DVM algorithm for wideband time-delay multi-beam beamformers
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices
• Combinatorial Designs
• Complexity of multiplication with vectors for structured matrices
• Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms
• Compression of periodic complementary sequences and applications
• Exploiting hidden structure in matrix computations: algorithms and applications. Cetraro, Italy, June 22--26, 2015. Lecture notes given at the summer course
• Fast Algorithms for Structured Matrices: Theory and Applications
• Fast algorithms with preprocessing for matrix-vector multiplication problems
• Fast linear algebra is stable
• Heuristic algorithms for Hadamard matrices with two circulant cores
• Legendre pairs of lengths \ell \equiv 0 (mod 3)
• Legendre pairs of lengths \(\ell \equiv 0 \pmod 5\)
• Low-Complexity Scaling Methodsfor DCT-II Approximations
• Lowest complexity self-recursive radix-2 DCT II/III algorithms
• Matrix structures in queuing models
• On computing the Discrete Fourier Transform
• Signal flow graph approach to efficient and forward stable DST algorithms
• Structured Hadamard conjecture
• Structured matrices in mathematics, computer science, and engineering I. Proceedings of an AMS-IMS-SIAM joint summer research conference, University of Colorado, Boulder, CO, USA, June 27--July 1, 1999
• Structured matrices in numerical linear algebra. Analysis, algorithms and applications. Selected papers based on the presentations at the INdAM meeting, Cortona, Italy, September 4--8, 2017
• Über die Abgrenzung der Eigenwerte einer Matrix.

Cited in

(1)

• A low-complexity algorithm to digitally uncouple the mutual coupling effect in antenna arrays via symmetric Toeplitz matrices

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)