Complexity of the parallel Givens factorization on shared memory architectures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1989
No file

Dates and versions

hal-00857027 , version 1 (02-09-2013)

Identifiers

  • HAL Id : hal-00857027 , version 1

Cite

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⟩
208 View
0 Download

Share

Gmail Facebook X LinkedIn More