Fix misc. typos

Mostly trivial source code comments.
mgates3 · Dec 1, 2017 · 3fac41c · 3fac41c
1 parent ba3779a
commit 3fac41c
Show file tree

Hide file tree

Showing 83 changed files with 111 additions and 111 deletions.
diff --git a/BLAS/TESTING/cblat1.f b/BLAS/TESTING/cblat1.f
@@ -619,7 +619,7 @@ SUBROUTINE STEST(LEN,SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/BLAS/TESTING/dblat1.f b/BLAS/TESTING/dblat1.f
@@ -991,7 +991,7 @@ SUBROUTINE TESTDSDOT(SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/BLAS/TESTING/sblat1.f b/BLAS/TESTING/sblat1.f
@@ -946,7 +946,7 @@ SUBROUTINE STEST(LEN,SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/BLAS/TESTING/zblat1.f b/BLAS/TESTING/zblat1.f
@@ -619,7 +619,7 @@ SUBROUTINE STEST(LEN,SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/CBLAS/examples/cblas_example1.c b/CBLAS/examples/cblas_example1.c
@@ -47,7 +47,7 @@ int main ( )
    a[m*3+1] = 6;
    a[m*3+2] = 7;
    a[m*3+3] = 8;
-   /* The elemetns of x and y */
+   /* The elements of x and y */
    x[0] = 1;
    x[1] = 2;
    x[2] = 1;

diff --git a/CBLAS/testing/c_cblat1.f b/CBLAS/testing/c_cblat1.f
@@ -577,7 +577,7 @@ SUBROUTINE STEST(LEN,SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/CBLAS/testing/c_dblat1.f b/CBLAS/testing/c_dblat1.f
@@ -653,7 +653,7 @@ SUBROUTINE STEST(LEN,SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/CBLAS/testing/c_sblat1.f b/CBLAS/testing/c_sblat1.f
@@ -653,7 +653,7 @@ SUBROUTINE STEST(LEN,SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/CBLAS/testing/c_zblat1.f b/CBLAS/testing/c_zblat1.f
@@ -577,7 +577,7 @@ SUBROUTINE STEST(LEN,SCOMP,STRUE,SSIZE,SFAC)
       SUBROUTINE STEST1(SCOMP1,STRUE1,SSIZE,SFAC)
 *     ************************* STEST1 *****************************
 *
-*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMODATE THE FORTRAN
+*     THIS IS AN INTERFACE SUBROUTINE TO ACCOMMODATE THE FORTRAN
 *     REQUIREMENT THAT WHEN A DUMMY ARGUMENT IS AN ARRAY, THE
 *     ACTUAL ARGUMENT MUST ALSO BE AN ARRAY OR AN ARRAY ELEMENT.
 *

diff --git a/CMAKE/CheckLAPACKCompilerFlags.cmake b/CMAKE/CheckLAPACKCompilerFlags.cmake
@@ -1,4 +1,4 @@
-# This module checks against various known compilers and thier respective
+# This module checks against various known compilers and their respective
 # flags to determine any specific flags needing to be set.
 #
 #  1.  If FPE traps are enabled either abort or disable them

diff --git a/CMAKE/FindGcov.cmake b/CMAKE/FindGcov.cmake
@@ -20,7 +20,7 @@ set(CMAKE_REQUIRED_QUIET ${codecov_FIND_QUIETLY})
 
 get_property(ENABLED_LANGUAGES GLOBAL PROPERTY ENABLED_LANGUAGES)
 foreach (LANG ${ENABLED_LANGUAGES})
-  # Gcov evaluation is dependend on the used compiler. Check gcov support for
+  # Gcov evaluation is dependent on the used compiler. Check gcov support for
   # each compiler that is used. If gcov binary was already found for this
   # compiler, do not try to find it again.
   if(NOT GCOV_${CMAKE_${LANG}_COMPILER_ID}_BIN)

diff --git a/CMAKE/Findcodecov.cmake b/CMAKE/Findcodecov.cmake
@@ -42,7 +42,7 @@ set(CMAKE_REQUIRED_QUIET ${codecov_FIND_QUIETLY})
 
 get_property(ENABLED_LANGUAGES GLOBAL PROPERTY ENABLED_LANGUAGES)
 foreach (LANG ${ENABLED_LANGUAGES})
-  # Coverage flags are not dependend on language, but the used compiler. So
+  # Coverage flags are not dependent on language, but the used compiler. So
   # instead of searching flags foreach language, search flags foreach compiler
   # used.
   set(COMPILER ${CMAKE_${LANG}_COMPILER_ID})

diff --git a/LAPACKE/utils/lapacke_chp_nancheck.c b/LAPACKE/utils/lapacke_chp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_cpf_nancheck.c b/LAPACKE/utils/lapacke_cpf_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo, transr or
  * matrix_layout.
  */

diff --git a/LAPACKE/utils/lapacke_cpp_nancheck.c b/LAPACKE/utils/lapacke_cpp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_csp_nancheck.c b/LAPACKE/utils/lapacke_csp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_ctp_nancheck.c b/LAPACKE/utils/lapacke_ctp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_dpf_nancheck.c b/LAPACKE/utils/lapacke_dpf_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo, transr or
  * matrix_layout.
  */

diff --git a/LAPACKE/utils/lapacke_dpp_nancheck.c b/LAPACKE/utils/lapacke_dpp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_dsp_nancheck.c b/LAPACKE/utils/lapacke_dsp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_dtp_nancheck.c b/LAPACKE/utils/lapacke_dtp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_spf_nancheck.c b/LAPACKE/utils/lapacke_spf_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo, transr or
  * matrix_layout.
  */

diff --git a/LAPACKE/utils/lapacke_spp_nancheck.c b/LAPACKE/utils/lapacke_spp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_ssp_nancheck.c b/LAPACKE/utils/lapacke_ssp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_stp_nancheck.c b/LAPACKE/utils/lapacke_stp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_zhp_nancheck.c b/LAPACKE/utils/lapacke_zhp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_zpf_nancheck.c b/LAPACKE/utils/lapacke_zpf_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo, transr or
  * matrix_layout.
  */

diff --git a/LAPACKE/utils/lapacke_zpp_nancheck.c b/LAPACKE/utils/lapacke_zpp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_zsp_nancheck.c b/LAPACKE/utils/lapacke_zsp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/LAPACKE/utils/lapacke_ztp_nancheck.c b/LAPACKE/utils/lapacke_ztp_nancheck.c
@@ -33,7 +33,7 @@
 #include "lapacke_utils.h"
 
 /* Check a matrix for NaN entries.
- * Since matrix in packed format stored continiously it just required to
+ * Since matrix in packed format stored continuously it just required to
  * check 1d array for NaNs. It doesn't depend upon uplo or matrix_layout.
  */
 

diff --git a/SRC/VARIANTS/README b/SRC/VARIANTS/README
@@ -64,7 +64,7 @@ You should then see the following files in the TESTING directory:
 = LINKING YOUR PROGRAM =
 ========================
 
-You just need to add the variants methods library in your linking sequence before your lapack libary.
+You just need to add the variants methods library in your linking sequence before your lapack library.
 Here is a quick example for LU
 
 Default using LU Right Looking version:

diff --git a/SRC/cgejsv.f b/SRC/cgejsv.f
@@ -1336,7 +1336,7 @@ SUBROUTINE CGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP,
       IF ( L2ABER ) THEN
 *        Standard absolute error bound suffices. All sigma_i with
 *        sigma_i < N*EPSLN*||A|| are flushed to zero. This is an
-*        agressive enforcement of lower numerical rank by introducing a
+*        aggressive enforcement of lower numerical rank by introducing a
 *        backward error of the order of N*EPSLN*||A||.
          TEMP1 = SQRT(REAL(N))*EPSLN
          DO 3001 p = 2, N
@@ -1348,7 +1348,7 @@ SUBROUTINE CGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP,
  3001    CONTINUE
  3002    CONTINUE
       ELSE IF ( L2RANK ) THEN
-*        .. similarly as above, only slightly more gentle (less agressive).
+*        .. similarly as above, only slightly more gentle (less aggressive).
 *        Sudden drop on the diagonal of R1 is used as the criterion for
 *        close-to-rank-defficient.
          TEMP1 = SQRT(SFMIN)
@@ -1718,7 +1718,7 @@ SUBROUTINE CGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP,
             CALL CPOCON('L',NR,CWORK(2*N+1),NR,ONE,TEMP1,
      $                   CWORK(2*N+NR*NR+1),RWORK,IERR)
             CONDR1 = ONE / SQRT(TEMP1)
-*           .. here need a second oppinion on the condition number
+*           .. here need a second opinion on the condition number
 *           .. then assume worst case scenario
 *           R1 is OK for inverse <=> CONDR1 .LT. REAL(N)
 *           more conservative    <=> CONDR1 .LT. SQRT(REAL(N))

diff --git a/SRC/chetf2_rk.f b/SRC/chetf2_rk.f
@@ -322,7 +322,7 @@ SUBROUTINE CHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO )
 *
 *        Factorize A as U*D*U**H using the upper triangle of A
 *
-*        Initilize the first entry of array E, where superdiagonal
+*        Initialize the first entry of array E, where superdiagonal
 *        elements of D are stored
 *
          E( 1 ) = CZERO
@@ -676,7 +676,7 @@ SUBROUTINE CHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO )
 *
 *        Factorize A as L*D*L**H using the lower triangle of A
 *
-*        Initilize the unused last entry of the subdiagonal array E.
+*        Initialize the unused last entry of the subdiagonal array E.
 *
          E( N ) = CZERO
 *

diff --git a/SRC/chseqr.f b/SRC/chseqr.f
@@ -139,7 +139,7 @@
 *> \verbatim
 *>          LDZ is INTEGER
 *>           The leading dimension of the array Z.  if COMPZ = 'I' or
-*>           COMPZ = 'V', then LDZ.GE.MAX(1,N).  Otherwize, LDZ.GE.1.
+*>           COMPZ = 'V', then LDZ.GE.MAX(1,N).  Otherwise, LDZ.GE.1.
 *> \endverbatim
 *>
 *> \param[out] WORK

diff --git a/SRC/clahef_rk.f b/SRC/clahef_rk.f
@@ -331,7 +331,7 @@ SUBROUTINE CLAHEF_RK( UPLO, N, NB, KB, A, LDA, E, IPIV, W, LDW,
 *        of A and working backwards, and compute the matrix W = U12*D
 *        for use in updating A11 (note that conjg(W) is actually stored)
 *
-*        Initilize the first entry of array E, where superdiagonal
+*        Initialize the first entry of array E, where superdiagonal
 *        elements of D are stored
 *
          E( 1 ) = CZERO
@@ -789,7 +789,7 @@ SUBROUTINE CLAHEF_RK( UPLO, N, NB, KB, A, LDA, E, IPIV, W, LDW,
 *        of A and working forwards, and compute the matrix W = L21*D
 *        for use in updating A22 (note that conjg(W) is actually stored)
 *
-*        Initilize the unused last entry of the subdiagonal array E.
+*        Initialize the unused last entry of the subdiagonal array E.
 *
          E( N ) = CZERO
 *

diff --git a/SRC/claqps.f b/SRC/claqps.f
@@ -127,7 +127,7 @@
 *> \param[in,out] AUXV
 *> \verbatim
 *>          AUXV is COMPLEX array, dimension (NB)
-*>          Auxiliar vector.
+*>          Auxiliary vector.
 *> \endverbatim
 *>
 *> \param[in,out] F

diff --git a/SRC/claqr0.f b/SRC/claqr0.f
@@ -145,7 +145,7 @@
 *> \verbatim
 *>          LDZ is INTEGER
 *>           The leading dimension of the array Z.  if WANTZ is .TRUE.
-*>           then LDZ.GE.MAX(1,IHIZ).  Otherwize, LDZ.GE.1.
+*>           then LDZ.GE.MAX(1,IHIZ).  Otherwise, LDZ.GE.1.
 *> \endverbatim
 *>
 *> \param[out] WORK

diff --git a/SRC/claqr4.f b/SRC/claqr4.f
@@ -153,7 +153,7 @@
 *> \verbatim
 *>          LDZ is INTEGER
 *>           The leading dimension of the array Z.  if WANTZ is .TRUE.
-*>           then LDZ.GE.MAX(1,IHIZ).  Otherwize, LDZ.GE.1.
+*>           then LDZ.GE.MAX(1,IHIZ).  Otherwise, LDZ.GE.1.
 *> \endverbatim
 *>
 *> \param[out] WORK

diff --git a/SRC/clasyf_rk.f b/SRC/clasyf_rk.f
@@ -330,7 +330,7 @@ SUBROUTINE CLASYF_RK( UPLO, N, NB, KB, A, LDA, E, IPIV, W, LDW,
 *        of A and working backwards, and compute the matrix W = U12*D
 *        for use in updating A11
 *
-*        Initilize the first entry of array E, where superdiagonal
+*        Initialize the first entry of array E, where superdiagonal
 *        elements of D are stored
 *
          E( 1 ) = CZERO
@@ -658,7 +658,7 @@ SUBROUTINE CLASYF_RK( UPLO, N, NB, KB, A, LDA, E, IPIV, W, LDW,
 *        of A and working forwards, and compute the matrix W = L21*D
 *        for use in updating A22
 *
-*        Initilize the unused last entry of the subdiagonal array E.
+*        Initialize the unused last entry of the subdiagonal array E.
 *
          E( N ) = CZERO
 *