Skip to content
Merged
Prev Previous commit
Next Next commit
SORBDB6: document algorithm, when output is zero
  • Loading branch information
christoph-conrads committed Jul 10, 2022
commit 774e5a9f7b15685d575054412c230a5e995e74bc
12 changes: 8 additions & 4 deletions SRC/sorbdb6.f
Original file line number Diff line number Diff line change
Expand Up @@ -41,10 +41,15 @@
*> with respect to the columns of
*> Q = [ Q1 ] .
*> [ Q2 ]
*> The columns of Q must be orthonormal.
*> The columns of Q must be orthonormal. The orthogonalized vector will
*> be zero if and only if it lies entirely in the range of Q.
*>
*> If the projection is zero according to Kahan's "twice is enough"
*> criterion, then the zero vector is returned.
*> The projection is computed with at most two iterations of the
*> classical Gram-Schmidt algorithm, see
*> * L. Giraud, J. Langou, M. Rozložník. "On the round-off error
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks for quoting this paper.

I think the following paper is a better quote for this fact:

L. Giraud, J. Langou, M. Rozložník, Jasper van den Eshof. "Rounding error analysis of the classical Gram-Schmidt orthogonalization process." Numerische Mathematik, volume volume 101, pages 87–100, 2005. DOI = 10.1007/s00211-005-0615-4.

*> analysis of the Gram-Schmidt algorithm with reorthogonalization."
*> 2002. CERFACS Technical Report No. TR/PA/02/33. URL:
*> https://www.cerfacs.fr/algor/reports/2002/TR_PA_02_33.pdf
*>
*>\endverbatim
*
Expand Down Expand Up @@ -320,4 +325,3 @@ SUBROUTINE SORBDB6( M1, M2, N, X1, INCX1, X2, INCX2, Q1, LDQ1, Q2,
* End of SORBDB6
*
END