Efficient householder QR factorization for superscalar processors

DOI10.1145/275323.275326zbMath0904.65044OpenAlexW2069277345WikidataQ113310247 ScholiaQ113310247MaRDI QIDQ3840037

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

Publication date: 5 November 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/

zbMATH Keywords

adaptive filteringparallel computationleast squares problemcache modelHouseholder QR factorization algorithmsIBM Scalable Parallel System 2Intel Pentium Pro systemR8000 processorregister model

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Uses Software

• Unnamed Item

This page was built for publication: Efficient householder QR factorization for superscalar processors