Parallel sparse QR factorization on shared memory architectures
From MaRDI portal
Publication:673939
DOI10.1016/0167-8191(94)00092-OzbMath0875.68281MaRDI QIDQ673939
Publication date: 28 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Parallel programmingSparse matrixMultifrontal methodOrthogonal decompositionShared memory multiprocess system
Related Items
Solving sparse linear least-squares problems on some supercomputers by using large dense blocks, Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic, A survey of direct methods for sparse linear systems, The impact of high-performance computing in the solution of linear systems: Trends and problems
Uses Software