Communication-optimal parallel and sequential QR and LU factorizations: theory and practice

Details Communication-optimal parallel and sequential QR and LU factorizations: theory and practice Communication-optimal parallel and sequential QR and LU factorizations: theory and practice

2008-06-12

arxiv.org/abs/0806.2159v3

Computer Science

Numerical Analysis

Scientific paper

We present parallel and sequential dense QR factorization algorithms that are both optimal (up to polylogarithmic factors) in the amount of communication they perform, and just as stable as Householder QR. Our first algorithm, Tall Skinny QR (TSQR), factors m-by-n matrices in a one-dimensional (1-D) block cyclic row layout, and is optimized for m >> n. Our second algorithm, CAQR (Communication-Avoiding QR), factors general rectangular matrices distributed in a two-dimensional block cyclic layout. It invokes TSQR for each block column factorization.

Affiliated with

Also associated with

No associations

Rating

Communication-optimal parallel and sequential QR and LU factorizations: theory and practice 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 Communication-optimal parallel and sequential QR and LU factorizations: theory and practice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communication-optimal parallel and sequential QR and LU factorizations: theory and practice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122742