Reorthogonalized Block Classical Gram--Schmidt

Details Reorthogonalized Block Classical Gram--Schmidt Reorthogonalized Block Classical Gram--Schmidt

2011-08-21

arxiv.org/abs/1108.4209v1

Mathematics

Numerical Analysis

19 pages

Scientific paper

A new reorthogonalized block classical Gram--Schmidt algorithm is proposed that factorizes a full column rank matrix $A$ into $A=QR$ where $Q$ is left orthogonal (has orthonormal columns) and $R$ is upper triangular and nonsingular. With appropriate assumptions on the diagonal blocks of $R$, the algorithm, when implemented in floating point arithmetic with machine unit $\macheps$, produces $Q$ and $R$ such that $\| I- Q^{T} Q \|_2 =O(\macheps)$ and $\| A-QR \|_2 =O(\macheps \| A \|_2)$. The resulting bounds also improve a previous bound by Giraud et al. [Num. Math., 101(1):87-100,\ 2005] on the CGS2 algorithm originally developed by Abdelmalek [BIT, 11(4):354--367,\ 1971]. \medskip Keywords: Block matrices, Q--R factorization, Gram-Schmidt process, Condition numbers, Rounding error analysis.

Affiliated with

Also associated with

No associations

Rating

Reorthogonalized Block Classical Gram--Schmidt 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 Reorthogonalized Block Classical Gram--Schmidt, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reorthogonalized Block Classical Gram--Schmidt will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174942