Tiled QR factorization algorithms

Details Tiled QR factorization algorithms Tiled QR factorization algorithms

2011-04-22

arxiv.org/abs/1104.4475v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke, Greedy, and those found within PLASMA. Although neither Modi and Clarke nor Greedy is optimal, both are shown to be asymptotically optimal for all matrices of size p = q^2 f(q), where f is any function such that \lim_{+\infty} f= 0. This novel and important complexity result applies to all matrices where p and q are proportional, p = \lambda q, with \lambda >= 1, thereby encompassing many important situations in practice (least squares). We provide an extensive set of experiments that show the superiority of the new algorithms for tall matrices.

Affiliated with

Also associated with

No associations

Rating

Tiled QR factorization algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tiled QR factorization algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tiled QR factorization algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330976