Compiler blockability of dense matrix factorizations

DOI10.1145/275323.275325MaRDI QIDQ3840036zbMATH OpenOpenAlexWikidataFDO

Authors Steve Carr, R. B. Lehoucq

Publication date 11 January 1999

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

matrix factorizationQR factorizationLAPACKbasic linear algebra subprogramsportable softwaredense numerical linear algebra computations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Recommendations

• scientific article; zbMATH DE number 1728327
• Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
• scientific article; zbMATH DE number 1424563
• On approximate factorization methods for block matrices suitable for vector and parallel processors
• scientific article; zbMATH DE number 833735
• Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
• scientific article; zbMATH DE number 641618
• Parallelisation of block-recursive matrix multiplication in prefix computations

Cited in

(3)

• Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
• scientific article; zbMATH DE number 833735 (Why is no real title available?)
• Reliable generation of high-performance matrix algebra

Describes a project that uses

Uses Software

• BLAS
• GEMM
• LAPACK

This page was built for publication: Compiler blockability of dense matrix factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840036)