*gelqt.f: replace NB -> MB

diff --git a/SRC/cgelqt.f b/SRC/cgelqt.f
index fe1f0d5..8037ac5 100644 (file)
--- a/SRC/cgelqt.f
+++ b/SRC/cgelqt.f
@@ -111,11 +111,11 @@
 *>
 *>  where the vi's represent the vectors which define H(i), which are returned
 *>  in the matrix A.  The 1's along the diagonal of V are not stored in A.
-*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/NB), where each
-*>  block is of order NB except for the last block, which is of order
-*>  IB = K - (B-1)*NB.  For each of the B blocks, a upper triangular block
-*>  reflector factor is computed: T1, T2, ..., TB.  The NB-by-NB (and IB-by-IB
-*>  for the last block) T's are stored in the NB-by-N matrix T as
+*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/MB), where each
+*>  block is of order MB except for the last block, which is of order
+*>  IB = K - (B-1)*MB.  For each of the B blocks, a upper triangular block
+*>  reflector factor is computed: T1, T2, ..., TB.  The MB-by-MB (and IB-by-IB
+*>  for the last block) T's are stored in the MB-by-K matrix T as
 *>
 *>               T = (T1 T2 ... TB).
 *> \endverbatim

diff --git a/SRC/dgelqt.f b/SRC/dgelqt.f
index bc360c3..8f8d40c 100644 (file)
--- a/SRC/dgelqt.f
+++ b/SRC/dgelqt.f
@@ -127,11 +127,11 @@
 *>
 *>  where the vi's represent the vectors which define H(i), which are returned
 *>  in the matrix A.  The 1's along the diagonal of V are not stored in A.
-*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/NB), where each
-*>  block is of order NB except for the last block, which is of order
-*>  IB = K - (B-1)*NB.  For each of the B blocks, a upper triangular block
-*>  reflector factor is computed: T1, T2, ..., TB.  The NB-by-NB (and IB-by-IB
-*>  for the last block) T's are stored in the NB-by-N matrix T as
+*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/MB), where each
+*>  block is of order MB except for the last block, which is of order
+*>  IB = K - (B-1)*MB.  For each of the B blocks, a upper triangular block
+*>  reflector factor is computed: T1, T2, ..., TB.  The MB-by-MB (and IB-by-IB
+*>  for the last block) T's are stored in the MB-by-K matrix T as
 *>
 *>               T = (T1 T2 ... TB).
 *> \endverbatim

diff --git a/SRC/sgelqt.f b/SRC/sgelqt.f
index 1986159..f9b2109 100644 (file)
--- a/SRC/sgelqt.f
+++ b/SRC/sgelqt.f
@@ -110,11 +110,11 @@
 *>
 *>  where the vi's represent the vectors which define H(i), which are returned
 *>  in the matrix A.  The 1's along the diagonal of V are not stored in A.
-*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/NB), where each
-*>  block is of order NB except for the last block, which is of order
-*>  IB = K - (B-1)*NB.  For each of the B blocks, a upper triangular block
-*>  reflector factor is computed: T1, T2, ..., TB.  The NB-by-NB (and IB-by-IB
-*>  for the last block) T's are stored in the NB-by-N matrix T as
+*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/MB), where each
+*>  block is of order MB except for the last block, which is of order
+*>  IB = K - (B-1)*MB.  For each of the B blocks, a upper triangular block
+*>  reflector factor is computed: T1, T2, ..., TB.  The MB-by-MB (and IB-by-IB
+*>  for the last block) T's are stored in the MB-by-K matrix T as
 *>
 *>               T = (T1 T2 ... TB).
 *> \endverbatim

diff --git a/SRC/zgelqt.f b/SRC/zgelqt.f
index e9bee95..54da169 100644 (file)
--- a/SRC/zgelqt.f
+++ b/SRC/zgelqt.f
@@ -127,11 +127,11 @@
 *>
 *>  where the vi's represent the vectors which define H(i), which are returned
 *>  in the matrix A.  The 1's along the diagonal of V are not stored in A.
-*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/NB), where each
-*>  block is of order NB except for the last block, which is of order
-*>  IB = K - (B-1)*NB.  For each of the B blocks, a upper triangular block
-*>  reflector factor is computed: T1, T2, ..., TB.  The NB-by-NB (and IB-by-IB
-*>  for the last block) T's are stored in the NB-by-N matrix T as
+*>  Let K=MIN(M,N).  The number of blocks is B = ceiling(K/MB), where each
+*>  block is of order MB except for the last block, which is of order
+*>  IB = K - (B-1)*MB.  For each of the B blocks, a upper triangular block
+*>  reflector factor is computed: T1, T2, ..., TB.  The MB-by-MB (and IB-by-IB
+*>  for the last block) T's are stored in the MB-by-K matrix T as
 *>
 *>               T = (T1 T2 ... TB).
 *> \endverbatim