Complexity of parallel algorithms: the example of the QR decomposition of a rectangular matrix - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1985

Complexity of parallel algorithms: the example of the QR decomposition of a rectangular matrix

Abstract

no abstract
No file

Dates and versions

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

Identifiers

  • HAL Id : hal-00857148 , version 1

Cite

Michel Cosnard, Yves Robert. Complexity of parallel algorithms: the example of the QR decomposition of a rectangular matrix. COGNITIVA 85, 1985, Paris, pp.707-712. ⟨hal-00857148⟩

Collections

UGA CNRS
53 View
0 Download

Share

Gmail Facebook X LinkedIn More