ZIB

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

Parallel QR decomposition of a rectangular matrix (1986)

Cosnard, M. ; Muller, J. -M. ; Robert, Y.

Springer

Numerische Mathematik 48 (1986), S. 239-249

add to mindlist on the mindlist

Details

ISSN: 0945-3245

Keywords: AMS (MOS): 65F05 ; CR: G1.3

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics

Notes: Summary We show that the greedy algorithm introduced in [1] and [5] to perform the parallel QR decomposition of a dense rectangular matrix of sizem×n is optimal. Then we assume thatm/n 2 tends to zero asm andn go to infinity, and prove that the complexity of such a decomposition is asymptotically2n, when an unlimited number of processors is available.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01389871

Permalink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit