Skip to Main content Skip to Navigation
Conference papers

Complexity of the parallel Givens factorization on shared memory architectures

Michel Cosnard 1 El Mostafa Daoudi 2 Yves Robert 1
1 LIP - Laboratoire de l'Informatique du Parallélisme
2 IMAG - Institut d'Informatique et de Mathématiques Appliquées de Grenoble
Résumé : no abstract
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-00857027
Contributor : Equipe Roma <>
Submitted on : Monday, September 2, 2013 - 5:53:18 PM
Last modification on : Friday, June 25, 2021 - 3:40:03 PM

Identifiers

  • HAL Id : hal-00857027, version 1

Collections

CNRS | INRIA | LIP | ENS-LYON | UNIV-LYON1 | UDL | UGA

Citation

Michel Cosnard, El Mostafa Daoudi, Yves Robert. Complexity of the parallel Givens factorization on shared memory architectures. Optimal algorithms, 1989, Unknown, pp.86-105. ⟨hal-00857027⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

567

 

Contact                    Legal Notice                    Personal Data