A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition

DOI10.1023/A:1018970413988zbMath0919.65029OpenAlexW66622014MaRDI QIDQ1284142

James J. jun. Carrig, Gerard G. L. Meyer

Publication date: 30 March 1999

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018970413988

zbMATH Keywords

orderinggraphQR decompositionGivens algorithmsuperscalar processor

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (1)

Parallel QR factorization for hybrid message passing/shared memory operation

This page was built for publication: A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition