IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · 2004 · 47 citations · 13 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel ComputingTime Series AnalysisDigital Signal ProcessingEigenvalue ProblemsFourier AnalysisLinear AlgebraMatrix ComputationSignal ProcessingDiscrete Fourier TransformEigenvalue AlgorithmsEigenvalue ComputationEigenvalue ExtractionEigenvectorsFourier TransformMatrix RepresentationsSingular Value Decomposition
A technique is proposed for generating initial orthonormal eigenvectors of the discrete Fourier transform matrix F by the singular-value decomposition of its orthogonal projection matrices on its eigenspaces and efficiently computable expressions for those matrices are derived. In order to generate Hermite-Gaussian-like orthonormal eigenvectors of F given the initial ones, a new method called the sequential orthogonal procrustes algorithm (SOPA) is presented based on the sequential generation of the columns of a unitary matrix rather than the batch evaluation of that matrix as in the OPA. It is proved that for any of the SOPA, the OPA, or the Gram-Schmidt algorithm (GSA) the output Hermite-Gaussian-like orthonormal eigenvectors are invariant under the change of the input initial orthonormal eigenvectors.
13
Linear algebra and its applications
Mathematics and Computers in Simulation · 1989 · 2K citations
On Namias's Fractional Fourier Transforms
Adam C. McBride, Fiona H. Kerr · IMA Journal of Applied Mathematics · 1987 · 590 citations