Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel sparse QR factorization on shared memory architectures

From MaRDI portal
Publication:673939
Jump to:navigation, search

DOI10.1016/0167-8191(94)00092-OzbMath0875.68281MaRDI QIDQ673939

Pontus Matstoms

Publication date: 28 February 1997

Published in: Parallel Computing (Search for Journal in Brave)


zbMATH Keywords

Parallel programmingSparse matrixMultifrontal methodOrthogonal decompositionShared memory multiprocess system


Mathematics Subject Classification ID

Computer system organization (68M99) Theory of software (68N99)


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

  • SPARSE-QR


Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:673939&oldid=12578716"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki