Compiler blockability of dense matrix factorizations
type: Item
instance of: scholarly article
title: Compiler blockability of dense matrix factorizations
zbMATH Open document ID: 0903.65023
DOI: 10.1145/275323.275325
author: Steve Carr
author: R. B. Lehoucq
published in: ACM Transactions on Mathematical Software
publication date: 1999-01-11T00:00:00Z
full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 15-04
zbMATH DE Number: 1186821
zbMATH Keywords: basic linear algebra subprograms
zbMATH Keywords: LAPACK
zbMATH Keywords: portable software
zbMATH Keywords: dense numerical linear algebra computations
zbMATH Keywords: matrix factorization
zbMATH Keywords: QR factorization
Wikidata QID: Q113310248
describes a project that uses: BLAS
describes a project that uses: GEMM
describes a project that uses: LAPACK
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2152960970
Recommended article: Q2779393
Recommended article: Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
Recommended article: Q4945812
Recommended article: On approximate factorization methods for block matrices suitable for vector and parallel processors
Recommended article: Q4860233
Recommended article: Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
Recommended article: Q4306865
Recommended article: Q3601060
description: scientific article