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

Implementation of some concurrent algorithms for matrix factorization

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

DOI10.1016/0167-8191(86)90004-9zbMath0591.65027OpenAlexW2070376477MaRDI QIDQ1075017

Jack J. Dongarra, Ahmed H. Sameh, Danny C. Sorensen

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0167-8191(86)90004-9


zbMATH Keywords

performance analysisNumerical experimentsparallel processesHouseholder methodQR-factorizationDenelcor HEP computerpipelined Givens method


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05)


Related Items (8)

A parallel QR algorithm for the nonsymmetric eigenvalue problem ⋮ Parallel solvers for discrete‐time algebric Riccati equations ⋮ Algorithms and experiments for structural mechanics on high-performance architectures ⋮ Linear algebra on high performance computers ⋮ Adaptive blocking in the QR factorization ⋮ Sparse QR factorization on a massively parallel computer ⋮ Unnamed Item ⋮ A pipelined Givens method for computing the QR factorization of a sparse matrix




This page was built for publication: Implementation of some concurrent algorithms for matrix factorization

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