A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
type: Item
instance of: scholarly article
title: A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
zbMATH Open document ID: 0909.68071
DOI: 10.1016/S0167-8191(98)00034-9
author: Zahari Zlatev
author: Tzvetan Ostromsky
author: Per Christian Hansen
published in: Parallel Computing
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 1238370
zbMATH Keywords: coarse-grained parallelism
zbMATH Keywords: least squares problem
zbMATH Keywords: QR-factorization
zbMATH Keywords: general sparse matrix
zbMATH Keywords: drop-tolerance
zbMATH Keywords: reordering
zbMATH Keywords: partitioning
zbMATH Keywords: block algorithm
MaRDI profile type: Publication
full work available at URL: s0167-8191(98)00034-9
OpenAlex ID: W2064079662
description: scientific article; zbMATH DE number 1238370