Fast Fourier Orthogonalization
DOI10.1145/2930889.2930923zbMath1365.65105OpenAlexW2478290527MaRDI QIDQ2985827
Publication date: 10 May 2017
Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/24688
complexityfast Fourier transformcryptographyGram-Schmidt orthogonalizationorthogonalizationcirculant matricesperformancesmatrix factorizationlattice algorithmsGram-Schmidt decompositionnearest plane algorithm
Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)
Related Items (13)
This page was built for publication: Fast Fourier Orthogonalization