From f3fff11ccf85dc524adbc2d5a40366e23d117344 Mon Sep 17 00:00:00 2001 From: musvaage Date: Tue, 11 Apr 2023 13:52:58 -0500 Subject: [PATCH] typos --- CMAKE/CheckFortranTypeSizes.cmake | 2 +- CMAKE/Findcodecov.cmake | 4 ++-- CMakeLists.txt | 2 +- DOCS/lawn81.tex | 2 +- LAPACKE/utils/lapacke_cgb_trans.c | 2 +- LAPACKE/utils/lapacke_dgb_trans.c | 2 +- LAPACKE/utils/lapacke_sgb_trans.c | 2 +- LAPACKE/utils/lapacke_zgb_trans.c | 2 +- SRC/DEPRECATED/cggsvd.f | 2 +- SRC/DEPRECATED/zggsvd.f | 2 +- SRC/cgejsv.f | 2 +- SRC/cgesvdq.f | 2 +- SRC/cgsvj0.f | 4 ++-- SRC/cgsvj1.f | 4 ++-- SRC/chesv_aa_2stage.f | 2 +- SRC/chetf2_rk.f | 8 ++++---- SRC/chetf2_rook.f | 8 ++++---- SRC/chetrf_aa.f | 2 +- SRC/chetrf_aa_2stage.f | 2 +- SRC/cla_gbrfsx_extended.f | 2 +- SRC/cla_gerfsx_extended.f | 2 +- SRC/cla_herfsx_extended.f | 2 +- SRC/cla_porfsx_extended.f | 2 +- SRC/cla_syrfsx_extended.f | 2 +- SRC/claed7.f | 2 +- SRC/claqz0.f | 4 ++-- SRC/clarfb_gett.f | 2 +- SRC/clatdf.f | 2 +- SRC/clatrs3.f | 2 +- SRC/csyconvf.f | 10 +++++----- SRC/csyconvf_rook.f | 2 +- SRC/csysv_aa_2stage.f | 2 +- SRC/csytrf_aa.f | 2 +- SRC/csytrf_aa_2stage.f | 2 +- SRC/ctrexc.f | 2 +- SRC/cunbdb1.f | 2 +- SRC/cunbdb2.f | 2 +- SRC/cunbdb3.f | 2 +- SRC/cunbdb4.f | 2 +- SRC/dbdsvdx.f | 2 +- SRC/dgejsv.f | 2 +- SRC/dgesvdq.f | 2 +- SRC/dgsvj0.f | 4 ++-- SRC/dgsvj1.f | 4 ++-- SRC/dla_gbrfsx_extended.f | 2 +- SRC/dla_gerfsx_extended.f | 2 +- SRC/dla_porfsx_extended.f | 2 +- SRC/dla_syrfsx_extended.f | 2 +- SRC/dlaqz0.f | 4 ++-- SRC/dlarfb_gett.f | 2 +- SRC/dlatrs3.f | 2 +- SRC/dorbdb1.f | 2 +- SRC/dorbdb2.f | 2 +- SRC/dorbdb3.f | 2 +- SRC/dorbdb4.f | 2 +- SRC/dsyconvf.f | 10 +++++----- SRC/dsyconvf_rook.f | 2 +- SRC/dsysv_aa_2stage.f | 2 +- SRC/dsytrf_aa.f | 2 +- SRC/dsytrf_aa_2stage.f | 2 +- SRC/sbdsvdx.f | 2 +- SRC/sgejsv.f | 2 +- SRC/sgesvdq.f | 2 +- SRC/sgsvj0.f | 4 ++-- SRC/sgsvj1.f | 4 ++-- SRC/sla_gbrfsx_extended.f | 2 +- SRC/sla_gerfsx_extended.f | 2 +- SRC/sla_porfsx_extended.f | 2 +- SRC/sla_syrfsx_extended.f | 2 +- SRC/slaqz0.f | 4 ++-- SRC/slarfb_gett.f | 2 +- SRC/slatrs3.f | 2 +- SRC/sorbdb1.f | 2 +- SRC/sorbdb2.f | 2 +- SRC/sorbdb3.f | 2 +- SRC/sorbdb4.f | 2 +- SRC/ssyconvf.f | 10 +++++----- SRC/ssyconvf_rook.f | 2 +- SRC/ssysv_aa_2stage.f | 2 +- SRC/ssytrf_aa.f | 2 +- SRC/ssytrf_aa_2stage.f | 2 +- SRC/zgejsv.f | 2 +- SRC/zgesvdq.f | 2 +- SRC/zgsvj0.f | 4 ++-- SRC/zgsvj1.f | 4 ++-- SRC/zhesv_aa_2stage.f | 2 +- SRC/zhetf2_rk.f | 8 ++++---- SRC/zhetf2_rook.f | 8 ++++---- SRC/zhetrf_aa.f | 2 +- SRC/zhetrf_aa_2stage.f | 2 +- SRC/zla_gbrfsx_extended.f | 2 +- SRC/zla_gerfsx_extended.f | 2 +- SRC/zla_herfsx_extended.f | 2 +- SRC/zla_porfsx_extended.f | 2 +- SRC/zla_syrfsx_extended.f | 2 +- SRC/zlaed7.f | 2 +- SRC/zlaqz0.f | 4 ++-- SRC/zlarfb_gett.f | 2 +- SRC/zlatdf.f | 2 +- SRC/zlatrs3.f | 2 +- SRC/zsyconvf.f | 10 +++++----- SRC/zsyconvf_rook.f | 2 +- SRC/zsysv_aa_2stage.f | 2 +- SRC/zsytrf_aa.f | 2 +- SRC/zsytrf_aa_2stage.f | 2 +- SRC/ztrexc.f | 2 +- SRC/zunbdb1.f | 2 +- SRC/zunbdb2.f | 2 +- SRC/zunbdb3.f | 2 +- SRC/zunbdb4.f | 2 +- TESTING/EIG/cchkst.f | 2 +- TESTING/EIG/cchkst2stg.f | 2 +- TESTING/EIG/cdrgsx.f | 2 +- TESTING/EIG/cdrvsg.f | 2 +- TESTING/EIG/cdrvsg2stg.f | 2 +- TESTING/EIG/cdrvst.f | 2 +- TESTING/EIG/cdrvst2stg.f | 2 +- TESTING/EIG/dchkst.f | 2 +- TESTING/EIG/dchkst2stg.f | 2 +- TESTING/EIG/ddrgsx.f | 2 +- TESTING/EIG/ddrvsg.f | 2 +- TESTING/EIG/ddrvsg2stg.f | 2 +- TESTING/EIG/ddrvst.f | 2 +- TESTING/EIG/ddrvst2stg.f | 2 +- TESTING/EIG/schkst.f | 2 +- TESTING/EIG/schkst2stg.f | 2 +- TESTING/EIG/sdrgsx.f | 2 +- TESTING/EIG/sdrvsg.f | 2 +- TESTING/EIG/sdrvsg2stg.f | 2 +- TESTING/EIG/sdrvst.f | 2 +- TESTING/EIG/sdrvst2stg.f | 2 +- TESTING/EIG/zchkst.f | 2 +- TESTING/EIG/zchkst2stg.f | 2 +- TESTING/EIG/zdrgsx.f | 2 +- TESTING/EIG/zdrvsg.f | 2 +- TESTING/EIG/zdrvsg2stg.f | 2 +- TESTING/EIG/zdrvst.f | 2 +- TESTING/EIG/zdrvst2stg.f | 2 +- TESTING/LIN/alahd.f | 2 +- TESTING/LIN/cchktp.f | 2 +- TESTING/LIN/cerrhe.f | 4 ++-- TESTING/LIN/cerrhex.f | 4 ++-- TESTING/LIN/cerrsy.f | 4 ++-- TESTING/LIN/cerrsyx.f | 4 ++-- TESTING/LIN/cgtt01.f | 2 +- TESTING/LIN/cgtt02.f | 2 +- TESTING/LIN/chet01_3.f | 2 +- TESTING/LIN/clqt02.f | 2 +- TESTING/LIN/cptt01.f | 2 +- TESTING/LIN/cptt02.f | 2 +- TESTING/LIN/cqlt02.f | 2 +- TESTING/LIN/cqrt02.f | 2 +- TESTING/LIN/crqt02.f | 2 +- TESTING/LIN/csyt01_3.f | 2 +- TESTING/LIN/dchktp.f | 2 +- TESTING/LIN/ddrvab.f | 2 +- TESTING/LIN/ddrvac.f | 2 +- TESTING/LIN/derrsy.f | 4 ++-- TESTING/LIN/derrsyx.f | 4 ++-- TESTING/LIN/dgtt01.f | 2 +- TESTING/LIN/dgtt02.f | 2 +- TESTING/LIN/dlqt02.f | 2 +- TESTING/LIN/dptt01.f | 2 +- TESTING/LIN/dptt02.f | 2 +- TESTING/LIN/dqlt02.f | 2 +- TESTING/LIN/dqrt02.f | 2 +- TESTING/LIN/drqt02.f | 2 +- TESTING/LIN/dsyt01_3.f | 2 +- TESTING/LIN/schktp.f | 2 +- TESTING/LIN/serrsy.f | 4 ++-- TESTING/LIN/serrsyx.f | 4 ++-- TESTING/LIN/sgtt01.f | 2 +- TESTING/LIN/sgtt02.f | 2 +- TESTING/LIN/slqt02.f | 2 +- TESTING/LIN/sptt01.f | 2 +- TESTING/LIN/sptt02.f | 2 +- TESTING/LIN/sqlt02.f | 2 +- TESTING/LIN/sqrt02.f | 2 +- TESTING/LIN/srqt02.f | 2 +- TESTING/LIN/ssyt01_3.f | 2 +- TESTING/LIN/zchktp.f | 2 +- TESTING/LIN/zdrvab.f | 2 +- TESTING/LIN/zdrvac.f | 2 +- TESTING/LIN/zerrhe.f | 4 ++-- TESTING/LIN/zerrhex.f | 4 ++-- TESTING/LIN/zerrsy.f | 4 ++-- TESTING/LIN/zerrsyx.f | 4 ++-- TESTING/LIN/zgtt01.f | 2 +- TESTING/LIN/zgtt02.f | 2 +- TESTING/LIN/zhet01_3.f | 2 +- TESTING/LIN/zlqt02.f | 2 +- TESTING/LIN/zptt01.f | 2 +- TESTING/LIN/zptt02.f | 2 +- TESTING/LIN/zqlt02.f | 2 +- TESTING/LIN/zqrt02.f | 2 +- TESTING/LIN/zrqt02.f | 2 +- TESTING/LIN/zsyt01_3.f | 2 +- 197 files changed, 250 insertions(+), 250 deletions(-) diff --git a/CMAKE/CheckFortranTypeSizes.cmake b/CMAKE/CheckFortranTypeSizes.cmake index 585ca26e72..17c0df80e8 100644 --- a/CMAKE/CheckFortranTypeSizes.cmake +++ b/CMAKE/CheckFortranTypeSizes.cmake @@ -1,4 +1,4 @@ -# This module perdorms several try-compiles to determine the default integer +# This module performs several try-compiles to determine the default integer # size being used by the fortran compiler # # After execution, the following variables are set. If they are un set then diff --git a/CMAKE/Findcodecov.cmake b/CMAKE/Findcodecov.cmake index 3840640072..93db45130e 100644 --- a/CMAKE/Findcodecov.cmake +++ b/CMAKE/Findcodecov.cmake @@ -36,7 +36,7 @@ function(add_coverage TNAME) endfunction() -# Find the reuired flags foreach language. +# Find the required flags foreach language. set(CMAKE_REQUIRED_QUIET_SAVE ${CMAKE_REQUIRED_QUIET}) set(CMAKE_REQUIRED_QUIET ${codecov_FIND_QUIETLY}) @@ -118,7 +118,7 @@ function (codecov_path_of_source FILE RETURN_VAR) # If expression was found, SOURCEFILE is a generator-expression for an # object library. Currently we found no way to call this function automatic - # for the referenced target, so it must be called in the directoryso of the + # for the referenced target, so it must be called in the directory of the # object library definition. if(NOT "${_source}" STREQUAL "") set(${RETURN_VAR} "" PARENT_SCOPE) diff --git a/CMakeLists.txt b/CMakeLists.txt index e9a6ff770e..fefaa8b89b 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -516,7 +516,7 @@ set(CPACK_MONOLITHIC_INSTALL ON) set(CPACK_PACKAGE_INSTALL_DIRECTORY "LAPACK") if(WIN32 AND NOT UNIX) # There is a bug in NSI that does not handle full unix paths properly. Make - # sure there is at least one set of four (4) backlasshes. + # sure there is at least one set of four (4) backslashes. set(CPACK_NSIS_HELP_LINK "http:\\\\\\\\http://icl.cs.utk.edu/lapack-forum") set(CPACK_NSIS_URL_INFO_ABOUT "http:\\\\\\\\www.netlib.org/lapack") set(CPACK_NSIS_CONTACT "lapack@eecs.utk.edu") diff --git a/DOCS/lawn81.tex b/DOCS/lawn81.tex index 794c2a7aab..668ca8d683 100644 --- a/DOCS/lawn81.tex +++ b/DOCS/lawn81.tex @@ -575,7 +575,7 @@ \subsection{Test and Install the Machine-Dependent Routines.} package, at least three of which must be installed. They are \begin{tabbing} -MONOMO \= DOUBLE PRECYSION \= \kill +MONOMO \= DOUBLE PRECISION \= \kill LSAME \> LOGICAL \> Test if two characters are the same regardless of case \\ SLAMCH \> REAL \> Determine machine-dependent parameters \\ DLAMCH \> DOUBLE PRECISION \> Determine machine-dependent parameters \\ diff --git a/LAPACKE/utils/lapacke_cgb_trans.c b/LAPACKE/utils/lapacke_cgb_trans.c index 2adf71493a..b32fc2f9e0 100644 --- a/LAPACKE/utils/lapacke_cgb_trans.c +++ b/LAPACKE/utils/lapacke_cgb_trans.c @@ -54,7 +54,7 @@ void LAPACKE_cgb_trans( int matrix_layout, lapack_int m, lapack_int n, } } else if ( matrix_layout == LAPACK_ROW_MAJOR ) { /* TODO: interchange loops for performance. - * This is just reference impemeltation. + * This is just reference implementation. */ for( j = 0; j < MIN( n, ldin ); j++ ) { for( i = MAX( ku-j, 0 ); i < MIN3( ldout, m+ku-j, kl+ku+1 ); diff --git a/LAPACKE/utils/lapacke_dgb_trans.c b/LAPACKE/utils/lapacke_dgb_trans.c index 6624936a62..89e421eae1 100644 --- a/LAPACKE/utils/lapacke_dgb_trans.c +++ b/LAPACKE/utils/lapacke_dgb_trans.c @@ -54,7 +54,7 @@ void LAPACKE_dgb_trans( int matrix_layout, lapack_int m, lapack_int n, } } else if ( matrix_layout == LAPACK_ROW_MAJOR ) { /* TODO: interchange loops for performance. - * This is just reference impemeltation. + * This is just reference implementation. */ for( j = 0; j < MIN( n, ldin ); j++ ) { for( i = MAX( ku-j, 0 ); i < MIN3( ldout, m+ku-j, kl+ku+1 ); diff --git a/LAPACKE/utils/lapacke_sgb_trans.c b/LAPACKE/utils/lapacke_sgb_trans.c index 046fdb9ca9..a90c9617ac 100644 --- a/LAPACKE/utils/lapacke_sgb_trans.c +++ b/LAPACKE/utils/lapacke_sgb_trans.c @@ -54,7 +54,7 @@ void LAPACKE_sgb_trans( int matrix_layout, lapack_int m, lapack_int n, } } else if ( matrix_layout == LAPACK_ROW_MAJOR ) { /* TODO: interchange loops for performance. - * This is just reference impemeltation. + * This is just reference implementation. */ for( j = 0; j < MIN( n, ldin ); j++ ) { for( i = MAX( ku-j, 0 ); i < MIN3( ldout, m+ku-j, kl+ku+1 ); diff --git a/LAPACKE/utils/lapacke_zgb_trans.c b/LAPACKE/utils/lapacke_zgb_trans.c index 32a9de3795..63323b1c3a 100644 --- a/LAPACKE/utils/lapacke_zgb_trans.c +++ b/LAPACKE/utils/lapacke_zgb_trans.c @@ -54,7 +54,7 @@ void LAPACKE_zgb_trans( int matrix_layout, lapack_int m, lapack_int n, } } else if ( matrix_layout == LAPACK_ROW_MAJOR ) { /* TODO: interchange loops for performance. - * This is just reference impemeltation + * This is just reference implementation */ for( j = 0; j < MIN( n, ldin ); j++ ) { for( i = MAX( ku-j, 0 ); i < MIN3( ldout, m+ku-j, kl+ku+1 ); diff --git a/SRC/DEPRECATED/cggsvd.f b/SRC/DEPRECATED/cggsvd.f index e6fdb47e5c..515ac8d49f 100644 --- a/SRC/DEPRECATED/cggsvd.f +++ b/SRC/DEPRECATED/cggsvd.f @@ -107,7 +107,7 @@ *> In particular, if B is an N-by-N nonsingular matrix, then the GSVD of *> A and B implicitly gives the SVD of A*inv(B): *> A*inv(B) = U*(D1*inv(D2))*V**H. -*> If ( A**H,B**H)**H has orthnormal columns, then the GSVD of A and B is also +*> If ( A**H,B**H)**H has orthonormal columns, then the GSVD of A and B is also *> equal to the CS decomposition of A and B. Furthermore, the GSVD can *> be used to derive the solution of the eigenvalue problem: *> A**H*A x = lambda* B**H*B x. diff --git a/SRC/DEPRECATED/zggsvd.f b/SRC/DEPRECATED/zggsvd.f index c0b9247a61..8a41e36c64 100644 --- a/SRC/DEPRECATED/zggsvd.f +++ b/SRC/DEPRECATED/zggsvd.f @@ -106,7 +106,7 @@ *> In particular, if B is an N-by-N nonsingular matrix, then the GSVD of *> A and B implicitly gives the SVD of A*inv(B): *> A*inv(B) = U*(D1*inv(D2))*V**H. -*> If ( A**H,B**H)**H has orthnormal columns, then the GSVD of A and B is also +*> If ( A**H,B**H)**H has orthonormal columns, then the GSVD of A and B is also *> equal to the CS decomposition of A and B. Furthermore, the GSVD can *> be used to derive the solution of the eigenvalue problem: *> A**H*A x = lambda* B**H*B x. diff --git a/SRC/cgejsv.f b/SRC/cgejsv.f index 2b7b2dc709..1fc75613ed 100644 --- a/SRC/cgejsv.f +++ b/SRC/cgejsv.f @@ -252,7 +252,7 @@ *> If JOBV = 'V', 'J' then V contains on exit the N-by-N matrix of *> the right singular vectors; *> If JOBV = 'W', AND (JOBU = 'U' AND JOBT = 'T' AND M = N), -*> then V is used as workspace if the pprocedure +*> then V is used as workspace if the procedure *> replaces A with A^*. In that case, [U] is computed *> in V as right singular vectors of A^* and then *> copied back to the U array. This 'W' option is just diff --git a/SRC/cgesvdq.f b/SRC/cgesvdq.f index 1a587eca36..95091c2c07 100644 --- a/SRC/cgesvdq.f +++ b/SRC/cgesvdq.f @@ -363,7 +363,7 @@ *> an optimal implementation would do all necessary scaling before calling *> CGESVD and the scaling in CGESVD can be switched off. *> 3. Other comments related to code optimization are given in comments in the -*> code, enlosed in [[double brackets]]. +*> code, enclosed in [[double brackets]]. *> \endverbatim * *> \par Bugs, examples and comments diff --git a/SRC/cgsvj0.f b/SRC/cgsvj0.f index 9e6053013e..7426ecdf14 100644 --- a/SRC/cgsvj0.f +++ b/SRC/cgsvj0.f @@ -52,10 +52,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/cgsvj1.f b/SRC/cgsvj1.f index 6d68e920d5..18dd690ccc 100644 --- a/SRC/cgsvj1.f +++ b/SRC/cgsvj1.f @@ -75,10 +75,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/chesv_aa_2stage.f b/SRC/chesv_aa_2stage.f index e474c6fada..36970a329d 100644 --- a/SRC/chesv_aa_2stage.f +++ b/SRC/chesv_aa_2stage.f @@ -87,7 +87,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/chetf2_rk.f b/SRC/chetf2_rk.f index 4bb0323827..e687ec64a8 100644 --- a/SRC/chetf2_rk.f +++ b/SRC/chetf2_rk.f @@ -480,7 +480,7 @@ SUBROUTINE CHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, K ) = CONJG( A( P, J ) ) A( P, J ) = T 14 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = CONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( K, K ) ) @@ -508,7 +508,7 @@ SUBROUTINE CHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, KK ) = CONJG( A( KP, J ) ) A( KP, J ) = T 15 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = CONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( KK, KK ) ) @@ -834,7 +834,7 @@ SUBROUTINE CHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, K ) = CONJG( A( P, J ) ) A( P, J ) = T 44 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = CONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( K, K ) ) @@ -862,7 +862,7 @@ SUBROUTINE CHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, KK ) = CONJG( A( KP, J ) ) A( KP, J ) = T 45 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = CONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( KK, KK ) ) diff --git a/SRC/chetf2_rook.f b/SRC/chetf2_rook.f index ee4eaf68f2..49fba1bda1 100644 --- a/SRC/chetf2_rook.f +++ b/SRC/chetf2_rook.f @@ -420,7 +420,7 @@ SUBROUTINE CHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, K ) = CONJG( A( P, J ) ) A( P, J ) = T 14 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = CONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( K, K ) ) @@ -441,7 +441,7 @@ SUBROUTINE CHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, KK ) = CONJG( A( KP, J ) ) A( KP, J ) = T 15 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = CONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( KK, KK ) ) @@ -733,7 +733,7 @@ SUBROUTINE CHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, K ) = CONJG( A( P, J ) ) A( P, J ) = T 44 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = CONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( K, K ) ) @@ -754,7 +754,7 @@ SUBROUTINE CHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, KK ) = CONJG( A( KP, J ) ) A( KP, J ) = T 45 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = CONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = REAL( A( KK, KK ) ) diff --git a/SRC/chetrf_aa.f b/SRC/chetrf_aa.f index 54567b8cdf..d9e4fbd190 100644 --- a/SRC/chetrf_aa.f +++ b/SRC/chetrf_aa.f @@ -74,7 +74,7 @@ *> *> On exit, the tridiagonal matrix is stored in the diagonals *> and the subdiagonals of A just below (or above) the diagonals, -*> and L is stored below (or above) the subdiaonals, when UPLO +*> and L is stored below (or above) the subdiagonals, when UPLO *> is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/chetrf_aa_2stage.f b/SRC/chetrf_aa_2stage.f index 20a9859e8e..400efdf261 100644 --- a/SRC/chetrf_aa_2stage.f +++ b/SRC/chetrf_aa_2stage.f @@ -75,7 +75,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/cla_gbrfsx_extended.f b/SRC/cla_gbrfsx_extended.f index a54be9c5fd..e8b96fd6e9 100644 --- a/SRC/cla_gbrfsx_extended.f +++ b/SRC/cla_gbrfsx_extended.f @@ -651,7 +651,7 @@ SUBROUTINE CLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL CAXPY( N, (1.0E+0,0.0E+0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/cla_gerfsx_extended.f b/SRC/cla_gerfsx_extended.f index 4b10311017..e524db5ad3 100644 --- a/SRC/cla_gerfsx_extended.f +++ b/SRC/cla_gerfsx_extended.f @@ -637,7 +637,7 @@ SUBROUTINE CLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL CAXPY( N, (1.0E+0,0.0E+0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/cla_herfsx_extended.f b/SRC/cla_herfsx_extended.f index 6d007ef580..19f8456925 100644 --- a/SRC/cla_herfsx_extended.f +++ b/SRC/cla_herfsx_extended.f @@ -654,7 +654,7 @@ SUBROUTINE CLA_HERFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL CAXPY( N, CMPLX(1.0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/cla_porfsx_extended.f b/SRC/cla_porfsx_extended.f index 9ced9b1b93..2dafecb35a 100644 --- a/SRC/cla_porfsx_extended.f +++ b/SRC/cla_porfsx_extended.f @@ -625,7 +625,7 @@ SUBROUTINE CLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL CAXPY( N, CMPLX(1.0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/cla_syrfsx_extended.f b/SRC/cla_syrfsx_extended.f index 4fe538a989..95f9697311 100644 --- a/SRC/cla_syrfsx_extended.f +++ b/SRC/cla_syrfsx_extended.f @@ -654,7 +654,7 @@ SUBROUTINE CLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL CAXPY( N, CMPLX(1.0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/claed7.f b/SRC/claed7.f index 9d2f971414..72f1417d4a 100644 --- a/SRC/claed7.f +++ b/SRC/claed7.f @@ -363,7 +363,7 @@ SUBROUTINE CLAED7( N, CUTPNT, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, RETURN END IF * -* Prepare the INDXQ sorting premutation. +* Prepare the INDXQ sorting permutation. * N1 = K N2 = N - K diff --git a/SRC/claqz0.f b/SRC/claqz0.f index a09cdead1d..c6cc5847d7 100644 --- a/SRC/claqz0.f +++ b/SRC/claqz0.f @@ -89,7 +89,7 @@ *> Anal., 29(2006), pp. 199--227. *> *> Ref: T. Steel, D. Camps, K. Meerbergen, R. Vandebril "A multishift, -*> multipole rational QZ method with agressive early deflation" +*> multipole rational QZ method with aggressive early deflation" *> \endverbatim * * Arguments: @@ -532,7 +532,7 @@ RECURSIVE SUBROUTINE CLAQZ0( WANTS, WANTQ, WANTZ, N, ILO, IHI, A, DO WHILE ( K.GE.ISTART2 ) IF( ABS( B( K, K ) ) .LT. BTOL ) THEN -* A diagonal element of B is negligable, move it +* A diagonal element of B is negligible, move it * to the top and deflate it DO K2 = K, ISTART2+1, -1 diff --git a/SRC/clarfb_gett.f b/SRC/clarfb_gett.f index ee6959ed80..5f042e3450 100644 --- a/SRC/clarfb_gett.f +++ b/SRC/clarfb_gett.f @@ -452,7 +452,7 @@ SUBROUTINE CLARFB_GETT( IDENT, M, N, K, T, LDT, A, LDA, B, LDB, IF( LNOTIDENT ) THEN * * col2_(2) Compute W2: = (V1**H) * W2 = (A1**H) * W2, -* V1 is not an identy matrix, but unit lower-triangular +* V1 is not an identity matrix, but unit lower-triangular * V1 stored in A1 (diagonal ones are not stored). * * diff --git a/SRC/clatdf.f b/SRC/clatdf.f index 5445e387e5..1e7d71669a 100644 --- a/SRC/clatdf.f +++ b/SRC/clatdf.f @@ -227,7 +227,7 @@ SUBROUTINE CLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, BM = RHS( J ) - CONE SPLUS = ONE * -* Lockahead for L- part RHS(1:N-1) = +-1 +* Look-ahead for L- part RHS(1:N-1) = +-1 * SPLUS and SMIN computed more efficiently than in BSOLVE[1]. * SPLUS = SPLUS + REAL( CDOTC( N-J, Z( J+1, J ), 1, Z( J+1, diff --git a/SRC/clatrs3.f b/SRC/clatrs3.f index a902f1ed01..0502f6898b 100644 --- a/SRC/clatrs3.f +++ b/SRC/clatrs3.f @@ -577,7 +577,7 @@ SUBROUTINE CLATRS3( UPLO, TRANS, DIAG, NORMIN, N, NRHS, A, LDA, * Prepare the linear update to be executed with GEMM. * For each column, compute a consistent scaling, a * scaling factor to survive the linear update, and -* rescale the column segments, if necesssary. Then +* rescale the column segments, if necessary. Then * the linear update is safely executed. * DO KK = 1, K2-K1 diff --git a/SRC/csyconvf.f b/SRC/csyconvf.f index f3b46f0b42..febbc411cd 100644 --- a/SRC/csyconvf.f +++ b/SRC/csyconvf.f @@ -39,7 +39,7 @@ *> CSYTRF provided on entry in parameter A into the factorization *> output format used in CSYTRF_RK (or CSYTRF_BK) that is stored *> on exit in parameters A and E. It also converts in place details of -*> the intechanges stored in IPIV from the format used in CSYTRF into +*> the interchanges stored in IPIV from the format used in CSYTRF into *> the format used in CSYTRF_RK (or CSYTRF_BK). *> *> If parameter WAY = 'R': @@ -48,7 +48,7 @@ *> (or CSYTRF_BK) provided on entry in parameters A and E into *> the factorization output format used in CSYTRF that is stored *> on exit in parameter A. It also converts in place details of -*> the intechanges stored in IPIV from the format used in CSYTRF_RK +*> the interchanges stored in IPIV from the format used in CSYTRF_RK *> (or CSYTRF_BK) into the format used in CSYTRF. *> *> CSYCONVF can also convert in Hermitian matrix case, i.e. between @@ -325,7 +325,7 @@ SUBROUTINE CSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -469,7 +469,7 @@ SUBROUTINE CSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -535,7 +535,7 @@ SUBROUTINE CSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/csyconvf_rook.f b/SRC/csyconvf_rook.f index a5b9d82da2..0da34e0fa8 100644 --- a/SRC/csyconvf_rook.f +++ b/SRC/csyconvf_rook.f @@ -520,7 +520,7 @@ SUBROUTINE CSYCONVF_ROOK( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/csysv_aa_2stage.f b/SRC/csysv_aa_2stage.f index d8881a7480..22227505cc 100644 --- a/SRC/csysv_aa_2stage.f +++ b/SRC/csysv_aa_2stage.f @@ -87,7 +87,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/csytrf_aa.f b/SRC/csytrf_aa.f index b1165a425b..c5467bf015 100644 --- a/SRC/csytrf_aa.f +++ b/SRC/csytrf_aa.f @@ -74,7 +74,7 @@ *> *> On exit, the tridiagonal matrix is stored in the diagonals *> and the subdiagonals of A just below (or above) the diagonals, -*> and L is stored below (or above) the subdiaonals, when UPLO +*> and L is stored below (or above) the subdiagonals, when UPLO *> is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/csytrf_aa_2stage.f b/SRC/csytrf_aa_2stage.f index 8a2cfd7bc0..b21df8cd31 100644 --- a/SRC/csytrf_aa_2stage.f +++ b/SRC/csytrf_aa_2stage.f @@ -75,7 +75,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/ctrexc.f b/SRC/ctrexc.f index ea64ddf9b8..2bc0348fb0 100644 --- a/SRC/ctrexc.f +++ b/SRC/ctrexc.f @@ -40,7 +40,7 @@ *> *> The Schur form T is reordered by a unitary similarity transformation *> Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by -*> postmultplying it with Z. +*> postmultiplying it with Z. *> \endverbatim * * Arguments: diff --git a/SRC/cunbdb1.f b/SRC/cunbdb1.f index 740e38a859..80faa88087 100644 --- a/SRC/cunbdb1.f +++ b/SRC/cunbdb1.f @@ -37,7 +37,7 @@ *>\verbatim *> *> CUNBDB1 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/cunbdb2.f b/SRC/cunbdb2.f index b45db61003..94b9fdbf95 100644 --- a/SRC/cunbdb2.f +++ b/SRC/cunbdb2.f @@ -37,7 +37,7 @@ *>\verbatim *> *> CUNBDB2 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/cunbdb3.f b/SRC/cunbdb3.f index b532bfbc8e..f942bc698c 100644 --- a/SRC/cunbdb3.f +++ b/SRC/cunbdb3.f @@ -37,7 +37,7 @@ *>\verbatim *> *> CUNBDB3 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/cunbdb4.f b/SRC/cunbdb4.f index 117f23d08d..a551c184e6 100644 --- a/SRC/cunbdb4.f +++ b/SRC/cunbdb4.f @@ -38,7 +38,7 @@ *>\verbatim *> *> CUNBDB4 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/dbdsvdx.f b/SRC/dbdsvdx.f index 4ccd4edadb..4668a88f21 100644 --- a/SRC/dbdsvdx.f +++ b/SRC/dbdsvdx.f @@ -45,7 +45,7 @@ *> *> Given an upper bidiagonal B with diagonal D = [ d_1 d_2 ... d_N ] *> and superdiagonal E = [ e_1 e_2 ... e_N-1 ], DBDSVDX computes the -*> singular value decompositon of B through the eigenvalues and +*> singular value decomposition of B through the eigenvalues and *> eigenvectors of the N*2-by-N*2 tridiagonal matrix *> *> | 0 d_1 | diff --git a/SRC/dgejsv.f b/SRC/dgejsv.f index 798e9154d8..1db85e9c26 100644 --- a/SRC/dgejsv.f +++ b/SRC/dgejsv.f @@ -253,7 +253,7 @@ *> If JOBV = 'V', 'J' then V contains on exit the N-by-N matrix of *> the right singular vectors; *> If JOBV = 'W', AND (JOBU = 'U' AND JOBT = 'T' AND M = N), -*> then V is used as workspace if the pprocedure +*> then V is used as workspace if the procedure *> replaces A with A^t. In that case, [U] is computed *> in V as right singular vectors of A^t and then *> copied back to the U array. This 'W' option is just diff --git a/SRC/dgesvdq.f b/SRC/dgesvdq.f index 6f9ac703ee..a514def8b7 100644 --- a/SRC/dgesvdq.f +++ b/SRC/dgesvdq.f @@ -365,7 +365,7 @@ *> an optimal implementation would do all necessary scaling before calling *> CGESVD and the scaling in CGESVD can be switched off. *> 3. Other comments related to code optimization are given in comments in the -*> code, enlosed in [[double brackets]]. +*> code, enclosed in [[double brackets]]. *> \endverbatim * *> \par Bugs, examples and comments diff --git a/SRC/dgsvj0.f b/SRC/dgsvj0.f index 586723e648..1008aa8c6e 100644 --- a/SRC/dgsvj0.f +++ b/SRC/dgsvj0.f @@ -52,10 +52,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/dgsvj1.f b/SRC/dgsvj1.f index d757bb927b..f1a099b2a2 100644 --- a/SRC/dgsvj1.f +++ b/SRC/dgsvj1.f @@ -75,10 +75,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/dla_gbrfsx_extended.f b/SRC/dla_gbrfsx_extended.f index 5454b1bfcd..b331178a90 100644 --- a/SRC/dla_gbrfsx_extended.f +++ b/SRC/dla_gbrfsx_extended.f @@ -645,7 +645,7 @@ SUBROUTINE DLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL DAXPY( N, 1.0D+0, DY, 1, Y(1,J), 1 ) diff --git a/SRC/dla_gerfsx_extended.f b/SRC/dla_gerfsx_extended.f index 92b0d76d44..bf8260d045 100644 --- a/SRC/dla_gerfsx_extended.f +++ b/SRC/dla_gerfsx_extended.f @@ -625,7 +625,7 @@ SUBROUTINE DLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL DAXPY( N, 1.0D+0, DY, 1, Y( 1, J ), 1 ) diff --git a/SRC/dla_porfsx_extended.f b/SRC/dla_porfsx_extended.f index 5c8850fef2..94d1087cde 100644 --- a/SRC/dla_porfsx_extended.f +++ b/SRC/dla_porfsx_extended.f @@ -617,7 +617,7 @@ SUBROUTINE DLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL DAXPY( N, 1.0D+0, DY, 1, Y(1,J), 1 ) diff --git a/SRC/dla_syrfsx_extended.f b/SRC/dla_syrfsx_extended.f index e1cde6fc2b..2e06a622b1 100644 --- a/SRC/dla_syrfsx_extended.f +++ b/SRC/dla_syrfsx_extended.f @@ -647,7 +647,7 @@ SUBROUTINE DLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL DAXPY( N, 1.0D+0, DY, 1, Y(1,J), 1 ) diff --git a/SRC/dlaqz0.f b/SRC/dlaqz0.f index 0a3f43e2a3..84cb96bcb2 100644 --- a/SRC/dlaqz0.f +++ b/SRC/dlaqz0.f @@ -102,7 +102,7 @@ *> Anal., 29(2006), pp. 199--227. *> *> Ref: T. Steel, D. Camps, K. Meerbergen, R. Vandebril "A multishift, -*> multipole rational QZ method with agressive early deflation" +*> multipole rational QZ method with aggressive early deflation" *> \endverbatim * * Arguments: @@ -566,7 +566,7 @@ RECURSIVE SUBROUTINE DLAQZ0( WANTS, WANTQ, WANTZ, N, ILO, IHI, A, DO WHILE ( K.GE.ISTART2 ) IF( ABS( B( K, K ) ) .LT. BTOL ) THEN -* A diagonal element of B is negligable, move it +* A diagonal element of B is negligible, move it * to the top and deflate it DO K2 = K, ISTART2+1, -1 diff --git a/SRC/dlarfb_gett.f b/SRC/dlarfb_gett.f index 10ab6461ef..2c7ea59b06 100644 --- a/SRC/dlarfb_gett.f +++ b/SRC/dlarfb_gett.f @@ -451,7 +451,7 @@ SUBROUTINE DLARFB_GETT( IDENT, M, N, K, T, LDT, A, LDA, B, LDB, IF( LNOTIDENT ) THEN * * col2_(2) Compute W2: = (V1**T) * W2 = (A1**T) * W2, -* V1 is not an identy matrix, but unit lower-triangular +* V1 is not an identity matrix, but unit lower-triangular * V1 stored in A1 (diagonal ones are not stored). * * diff --git a/SRC/dlatrs3.f b/SRC/dlatrs3.f index b4a98bc78e..e6d78b672c 100644 --- a/SRC/dlatrs3.f +++ b/SRC/dlatrs3.f @@ -574,7 +574,7 @@ SUBROUTINE DLATRS3( UPLO, TRANS, DIAG, NORMIN, N, NRHS, A, LDA, * Prepare the linear update to be executed with GEMM. * For each column, compute a consistent scaling, a * scaling factor to survive the linear update, and -* rescale the column segments, if necesssary. Then +* rescale the column segments, if necessary. Then * the linear update is safely executed. * DO KK = 1, K2-K1 diff --git a/SRC/dorbdb1.f b/SRC/dorbdb1.f index dae18f5df5..b5b2d13623 100644 --- a/SRC/dorbdb1.f +++ b/SRC/dorbdb1.f @@ -37,7 +37,7 @@ *>\verbatim *> *> DORBDB1 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/dorbdb2.f b/SRC/dorbdb2.f index a0dacbb16d..0b4ad732c1 100644 --- a/SRC/dorbdb2.f +++ b/SRC/dorbdb2.f @@ -37,7 +37,7 @@ *>\verbatim *> *> DORBDB2 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/dorbdb3.f b/SRC/dorbdb3.f index 7b37279560..79b10a5d36 100644 --- a/SRC/dorbdb3.f +++ b/SRC/dorbdb3.f @@ -37,7 +37,7 @@ *>\verbatim *> *> DORBDB3 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/dorbdb4.f b/SRC/dorbdb4.f index 08604be452..985be3277e 100644 --- a/SRC/dorbdb4.f +++ b/SRC/dorbdb4.f @@ -38,7 +38,7 @@ *>\verbatim *> *> DORBDB4 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/dsyconvf.f b/SRC/dsyconvf.f index 9e7a5af0e1..005c98a030 100644 --- a/SRC/dsyconvf.f +++ b/SRC/dsyconvf.f @@ -39,7 +39,7 @@ *> DSYTRF provided on entry in parameter A into the factorization *> output format used in DSYTRF_RK (or DSYTRF_BK) that is stored *> on exit in parameters A and E. It also converts in place details of -*> the intechanges stored in IPIV from the format used in DSYTRF into +*> the interchanges stored in IPIV from the format used in DSYTRF into *> the format used in DSYTRF_RK (or DSYTRF_BK). *> *> If parameter WAY = 'R': @@ -48,7 +48,7 @@ *> (or DSYTRF_BK) provided on entry in parameters A and E into *> the factorization output format used in DSYTRF that is stored *> on exit in parameter A. It also converts in place details of -*> the intechanges stored in IPIV from the format used in DSYTRF_RK +*> the interchanges stored in IPIV from the format used in DSYTRF_RK *> (or DSYTRF_BK) into the format used in DSYTRF. *> \endverbatim * @@ -322,7 +322,7 @@ SUBROUTINE DSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -466,7 +466,7 @@ SUBROUTINE DSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -532,7 +532,7 @@ SUBROUTINE DSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/dsyconvf_rook.f b/SRC/dsyconvf_rook.f index d7f529358c..c3f2083bdb 100644 --- a/SRC/dsyconvf_rook.f +++ b/SRC/dsyconvf_rook.f @@ -517,7 +517,7 @@ SUBROUTINE DSYCONVF_ROOK( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/dsysv_aa_2stage.f b/SRC/dsysv_aa_2stage.f index 1100702ba0..72fbe1e9a8 100644 --- a/SRC/dsysv_aa_2stage.f +++ b/SRC/dsysv_aa_2stage.f @@ -89,7 +89,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/dsytrf_aa.f b/SRC/dsytrf_aa.f index 3467379537..9a0b26ce53 100644 --- a/SRC/dsytrf_aa.f +++ b/SRC/dsytrf_aa.f @@ -74,7 +74,7 @@ *> *> On exit, the tridiagonal matrix is stored in the diagonals *> and the subdiagonals of A just below (or above) the diagonals, -*> and L is stored below (or above) the subdiaonals, when UPLO +*> and L is stored below (or above) the subdiagonals, when UPLO *> is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/dsytrf_aa_2stage.f b/SRC/dsytrf_aa_2stage.f index b7f5f07c20..c65bd86e62 100644 --- a/SRC/dsytrf_aa_2stage.f +++ b/SRC/dsytrf_aa_2stage.f @@ -75,7 +75,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/sbdsvdx.f b/SRC/sbdsvdx.f index dcd554f1d7..d7cb2dc839 100644 --- a/SRC/sbdsvdx.f +++ b/SRC/sbdsvdx.f @@ -45,7 +45,7 @@ *> *> Given an upper bidiagonal B with diagonal D = [ d_1 d_2 ... d_N ] *> and superdiagonal E = [ e_1 e_2 ... e_N-1 ], SBDSVDX computes the -*> singular value decompositon of B through the eigenvalues and +*> singular value decomposition of B through the eigenvalues and *> eigenvectors of the N*2-by-N*2 tridiagonal matrix *> *> | 0 d_1 | diff --git a/SRC/sgejsv.f b/SRC/sgejsv.f index 1333e54fbb..42d2b8313d 100644 --- a/SRC/sgejsv.f +++ b/SRC/sgejsv.f @@ -253,7 +253,7 @@ *> If JOBV = 'V', 'J' then V contains on exit the N-by-N matrix of *> the right singular vectors; *> If JOBV = 'W', AND (JOBU = 'U' AND JOBT = 'T' AND M = N), -*> then V is used as workspace if the pprocedure +*> then V is used as workspace if the procedure *> replaces A with A^t. In that case, [U] is computed *> in V as right singular vectors of A^t and then *> copied back to the U array. This 'W' option is just diff --git a/SRC/sgesvdq.f b/SRC/sgesvdq.f index ebbfc70b15..6fb328b8cf 100644 --- a/SRC/sgesvdq.f +++ b/SRC/sgesvdq.f @@ -365,7 +365,7 @@ *> an optimal implementation would do all necessary scaling before calling *> CGESVD and the scaling in CGESVD can be switched off. *> 3. Other comments related to code optimization are given in comments in the -*> code, enlosed in [[double brackets]]. +*> code, enclosed in [[double brackets]]. *> \endverbatim * *> \par Bugs, examples and comments diff --git a/SRC/sgsvj0.f b/SRC/sgsvj0.f index 9249f42195..7e5fddeb0b 100644 --- a/SRC/sgsvj0.f +++ b/SRC/sgsvj0.f @@ -52,10 +52,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/sgsvj1.f b/SRC/sgsvj1.f index 79fd4d2d3f..f1d1f72392 100644 --- a/SRC/sgsvj1.f +++ b/SRC/sgsvj1.f @@ -75,10 +75,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/sla_gbrfsx_extended.f b/SRC/sla_gbrfsx_extended.f index 499d6bf900..c79330cb50 100644 --- a/SRC/sla_gbrfsx_extended.f +++ b/SRC/sla_gbrfsx_extended.f @@ -644,7 +644,7 @@ SUBROUTINE SLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL SAXPY( N, 1.0, DY, 1, Y(1,J), 1 ) diff --git a/SRC/sla_gerfsx_extended.f b/SRC/sla_gerfsx_extended.f index de05d8eb41..1a19a50714 100644 --- a/SRC/sla_gerfsx_extended.f +++ b/SRC/sla_gerfsx_extended.f @@ -628,7 +628,7 @@ SUBROUTINE SLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL SAXPY( N, 1.0, DY, 1, Y( 1, J ), 1 ) diff --git a/SRC/sla_porfsx_extended.f b/SRC/sla_porfsx_extended.f index ada4cad21e..9f33b14dde 100644 --- a/SRC/sla_porfsx_extended.f +++ b/SRC/sla_porfsx_extended.f @@ -617,7 +617,7 @@ SUBROUTINE SLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL SAXPY( N, 1.0, DY, 1, Y(1,J), 1 ) diff --git a/SRC/sla_syrfsx_extended.f b/SRC/sla_syrfsx_extended.f index d5096be024..2fa3b1c50f 100644 --- a/SRC/sla_syrfsx_extended.f +++ b/SRC/sla_syrfsx_extended.f @@ -647,7 +647,7 @@ SUBROUTINE SLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL SAXPY( N, 1.0, DY, 1, Y(1,J), 1 ) diff --git a/SRC/slaqz0.f b/SRC/slaqz0.f index 3dc3b7a09c..8b2d3286e4 100644 --- a/SRC/slaqz0.f +++ b/SRC/slaqz0.f @@ -100,7 +100,7 @@ *> Anal., 29(2006), pp. 199--227. *> *> Ref: T. Steel, D. Camps, K. Meerbergen, R. Vandebril "A multishift, -*> multipole rational QZ method with agressive early deflation" +*> multipole rational QZ method with aggressive early deflation" *> \endverbatim * * Arguments: @@ -563,7 +563,7 @@ RECURSIVE SUBROUTINE SLAQZ0( WANTS, WANTQ, WANTZ, N, ILO, IHI, A, DO WHILE ( K.GE.ISTART2 ) IF( ABS( B( K, K ) ) .LT. BTOL ) THEN -* A diagonal element of B is negligable, move it +* A diagonal element of B is negligible, move it * to the top and deflate it DO K2 = K, ISTART2+1, -1 diff --git a/SRC/slarfb_gett.f b/SRC/slarfb_gett.f index 7719f2965c..f1fdef7900 100644 --- a/SRC/slarfb_gett.f +++ b/SRC/slarfb_gett.f @@ -451,7 +451,7 @@ SUBROUTINE SLARFB_GETT( IDENT, M, N, K, T, LDT, A, LDA, B, LDB, IF( LNOTIDENT ) THEN * * col2_(2) Compute W2: = (V1**T) * W2 = (A1**T) * W2, -* V1 is not an identy matrix, but unit lower-triangular +* V1 is not an identity matrix, but unit lower-triangular * V1 stored in A1 (diagonal ones are not stored). * * diff --git a/SRC/slatrs3.f b/SRC/slatrs3.f index c3a08e524c..8f0c4bf163 100644 --- a/SRC/slatrs3.f +++ b/SRC/slatrs3.f @@ -574,7 +574,7 @@ SUBROUTINE SLATRS3( UPLO, TRANS, DIAG, NORMIN, N, NRHS, A, LDA, * Prepare the linear update to be executed with GEMM. * For each column, compute a consistent scaling, a * scaling factor to survive the linear update, and -* rescale the column segments, if necesssary. Then +* rescale the column segments, if necessary. Then * the linear update is safely executed. * DO KK = 1, K2-K1 diff --git a/SRC/sorbdb1.f b/SRC/sorbdb1.f index c860f43665..191e5742a4 100644 --- a/SRC/sorbdb1.f +++ b/SRC/sorbdb1.f @@ -37,7 +37,7 @@ *>\verbatim *> *> SORBDB1 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/sorbdb2.f b/SRC/sorbdb2.f index 484d352f8c..b2ff34bb1e 100644 --- a/SRC/sorbdb2.f +++ b/SRC/sorbdb2.f @@ -37,7 +37,7 @@ *>\verbatim *> *> SORBDB2 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/sorbdb3.f b/SRC/sorbdb3.f index 6209b24ee0..99478c5d0d 100644 --- a/SRC/sorbdb3.f +++ b/SRC/sorbdb3.f @@ -37,7 +37,7 @@ *>\verbatim *> *> SORBDB3 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/sorbdb4.f b/SRC/sorbdb4.f index bf60fb7bb4..0fef5b759b 100644 --- a/SRC/sorbdb4.f +++ b/SRC/sorbdb4.f @@ -38,7 +38,7 @@ *>\verbatim *> *> SORBDB4 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/ssyconvf.f b/SRC/ssyconvf.f index 6defc1f0eb..af55da51a0 100644 --- a/SRC/ssyconvf.f +++ b/SRC/ssyconvf.f @@ -39,7 +39,7 @@ *> SSYTRF provided on entry in parameter A into the factorization *> output format used in SSYTRF_RK (or SSYTRF_BK) that is stored *> on exit in parameters A and E. It also converts in place details of -*> the intechanges stored in IPIV from the format used in SSYTRF into +*> the interchanges stored in IPIV from the format used in SSYTRF into *> the format used in SSYTRF_RK (or SSYTRF_BK). *> *> If parameter WAY = 'R': @@ -48,7 +48,7 @@ *> (or SSYTRF_BK) provided on entry in parameters A and E into *> the factorization output format used in SSYTRF that is stored *> on exit in parameter A. It also converts in place details of -*> the intechanges stored in IPIV from the format used in SSYTRF_RK +*> the interchanges stored in IPIV from the format used in SSYTRF_RK *> (or SSYTRF_BK) into the format used in SSYTRF. *> \endverbatim * @@ -322,7 +322,7 @@ SUBROUTINE SSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -466,7 +466,7 @@ SUBROUTINE SSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -532,7 +532,7 @@ SUBROUTINE SSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/ssyconvf_rook.f b/SRC/ssyconvf_rook.f index c59f257bbb..efd7c57fec 100644 --- a/SRC/ssyconvf_rook.f +++ b/SRC/ssyconvf_rook.f @@ -517,7 +517,7 @@ SUBROUTINE SSYCONVF_ROOK( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/ssysv_aa_2stage.f b/SRC/ssysv_aa_2stage.f index b9eac83421..aa862f14b0 100644 --- a/SRC/ssysv_aa_2stage.f +++ b/SRC/ssysv_aa_2stage.f @@ -88,7 +88,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/ssytrf_aa.f b/SRC/ssytrf_aa.f index 13e849cdc7..4ba026fc8a 100644 --- a/SRC/ssytrf_aa.f +++ b/SRC/ssytrf_aa.f @@ -74,7 +74,7 @@ *> *> On exit, the tridiagonal matrix is stored in the diagonals *> and the subdiagonals of A just below (or above) the diagonals, -*> and L is stored below (or above) the subdiaonals, when UPLO +*> and L is stored below (or above) the subdiagonals, when UPLO *> is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/ssytrf_aa_2stage.f b/SRC/ssytrf_aa_2stage.f index 94b3aa4b50..07357f2ab3 100644 --- a/SRC/ssytrf_aa_2stage.f +++ b/SRC/ssytrf_aa_2stage.f @@ -75,7 +75,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/zgejsv.f b/SRC/zgejsv.f index a36a9188aa..b4bc531ab1 100644 --- a/SRC/zgejsv.f +++ b/SRC/zgejsv.f @@ -252,7 +252,7 @@ *> If JOBV = 'V', 'J' then V contains on exit the N-by-N matrix of *> the right singular vectors; *> If JOBV = 'W', AND (JOBU = 'U' AND JOBT = 'T' AND M = N), -*> then V is used as workspace if the pprocedure +*> then V is used as workspace if the procedure *> replaces A with A^*. In that case, [U] is computed *> in V as right singular vectors of A^* and then *> copied back to the U array. This 'W' option is just diff --git a/SRC/zgesvdq.f b/SRC/zgesvdq.f index 05eb722f87..b990f73893 100644 --- a/SRC/zgesvdq.f +++ b/SRC/zgesvdq.f @@ -363,7 +363,7 @@ *> an optimal implementation would do all necessary scaling before calling *> CGESVD and the scaling in CGESVD can be switched off. *> 3. Other comments related to code optimization are given in comments in the -*> code, enlosed in [[double brackets]]. +*> code, enclosed in [[double brackets]]. *> \endverbatim * *> \par Bugs, examples and comments diff --git a/SRC/zgsvj0.f b/SRC/zgsvj0.f index 11bfbd8dcb..075c243c29 100644 --- a/SRC/zgsvj0.f +++ b/SRC/zgsvj0.f @@ -52,10 +52,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/zgsvj1.f b/SRC/zgsvj1.f index efe0384ef8..ba71e155fa 100644 --- a/SRC/zgsvj1.f +++ b/SRC/zgsvj1.f @@ -75,10 +75,10 @@ *> Specifies whether the output from this procedure is used *> to compute the matrix V: *> = 'V': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the N-by-N array V. +*> by postmultiplying the N-by-N array V. *> (See the description of V.) *> = 'A': the product of the Jacobi rotations is accumulated -*> by postmulyiplying the MV-by-N array V. +*> by postmultiplying the MV-by-N array V. *> (See the descriptions of MV and V.) *> = 'N': the Jacobi rotations are not accumulated. *> \endverbatim diff --git a/SRC/zhesv_aa_2stage.f b/SRC/zhesv_aa_2stage.f index ee15968552..79c01c546e 100644 --- a/SRC/zhesv_aa_2stage.f +++ b/SRC/zhesv_aa_2stage.f @@ -88,7 +88,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/zhetf2_rk.f b/SRC/zhetf2_rk.f index 050c7993d0..87df901aa2 100644 --- a/SRC/zhetf2_rk.f +++ b/SRC/zhetf2_rk.f @@ -480,7 +480,7 @@ SUBROUTINE ZHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, K ) = DCONJG( A( P, J ) ) A( P, J ) = T 14 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = DCONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( K, K ) ) @@ -508,7 +508,7 @@ SUBROUTINE ZHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, KK ) = DCONJG( A( KP, J ) ) A( KP, J ) = T 15 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = DCONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( KK, KK ) ) @@ -834,7 +834,7 @@ SUBROUTINE ZHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, K ) = DCONJG( A( P, J ) ) A( P, J ) = T 44 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = DCONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( K, K ) ) @@ -862,7 +862,7 @@ SUBROUTINE ZHETF2_RK( UPLO, N, A, LDA, E, IPIV, INFO ) A( J, KK ) = DCONJG( A( KP, J ) ) A( KP, J ) = T 45 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = DCONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( KK, KK ) ) diff --git a/SRC/zhetf2_rook.f b/SRC/zhetf2_rook.f index 94bb297367..91172f6019 100644 --- a/SRC/zhetf2_rook.f +++ b/SRC/zhetf2_rook.f @@ -420,7 +420,7 @@ SUBROUTINE ZHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, K ) = DCONJG( A( P, J ) ) A( P, J ) = T 14 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = DCONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( K, K ) ) @@ -441,7 +441,7 @@ SUBROUTINE ZHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, KK ) = DCONJG( A( KP, J ) ) A( KP, J ) = T 15 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = DCONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( KK, KK ) ) @@ -733,7 +733,7 @@ SUBROUTINE ZHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, K ) = DCONJG( A( P, J ) ) A( P, J ) = T 44 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( P, K ) = DCONJG( A( P, K ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( K, K ) ) @@ -754,7 +754,7 @@ SUBROUTINE ZHETF2_ROOK( UPLO, N, A, LDA, IPIV, INFO ) A( J, KK ) = DCONJG( A( KP, J ) ) A( KP, J ) = T 45 CONTINUE -* (3) Swap and conjugate corner elements at row-col interserction +* (3) Swap and conjugate corner elements at row-col intersection A( KP, KK ) = DCONJG( A( KP, KK ) ) * (4) Swap diagonal elements at row-col intersection R1 = DBLE( A( KK, KK ) ) diff --git a/SRC/zhetrf_aa.f b/SRC/zhetrf_aa.f index 56722e7e6b..537c16e8cd 100644 --- a/SRC/zhetrf_aa.f +++ b/SRC/zhetrf_aa.f @@ -74,7 +74,7 @@ *> *> On exit, the tridiagonal matrix is stored in the diagonals *> and the subdiagonals of A just below (or above) the diagonals, -*> and L is stored below (or above) the subdiaonals, when UPLO +*> and L is stored below (or above) the subdiagonals, when UPLO *> is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/zhetrf_aa_2stage.f b/SRC/zhetrf_aa_2stage.f index 92f1c09b37..477602b5e6 100644 --- a/SRC/zhetrf_aa_2stage.f +++ b/SRC/zhetrf_aa_2stage.f @@ -75,7 +75,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/zla_gbrfsx_extended.f b/SRC/zla_gbrfsx_extended.f index fe4d635b12..2f57b7682d 100644 --- a/SRC/zla_gbrfsx_extended.f +++ b/SRC/zla_gbrfsx_extended.f @@ -651,7 +651,7 @@ SUBROUTINE ZLA_GBRFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, KL, KU, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL ZAXPY( N, (1.0D+0,0.0D+0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/zla_gerfsx_extended.f b/SRC/zla_gerfsx_extended.f index 9d618f2942..22e45c5a93 100644 --- a/SRC/zla_gerfsx_extended.f +++ b/SRC/zla_gerfsx_extended.f @@ -636,7 +636,7 @@ SUBROUTINE ZLA_GERFSX_EXTENDED( PREC_TYPE, TRANS_TYPE, N, NRHS, A, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL ZAXPY( N, (1.0D+0,0.0D+0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/zla_herfsx_extended.f b/SRC/zla_herfsx_extended.f index a55dd94318..689460a02e 100644 --- a/SRC/zla_herfsx_extended.f +++ b/SRC/zla_herfsx_extended.f @@ -655,7 +655,7 @@ SUBROUTINE ZLA_HERFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL ZAXPY( N, DCMPLX(1.0D+0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/zla_porfsx_extended.f b/SRC/zla_porfsx_extended.f index 12e05e049e..e853494fc1 100644 --- a/SRC/zla_porfsx_extended.f +++ b/SRC/zla_porfsx_extended.f @@ -626,7 +626,7 @@ SUBROUTINE ZLA_PORFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF (Y_PREC_STATE .LT. EXTRA_Y) THEN CALL ZAXPY( N, DCMPLX(1.0D+0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/zla_syrfsx_extended.f b/SRC/zla_syrfsx_extended.f index d6c241499a..fb1b9e2d7f 100644 --- a/SRC/zla_syrfsx_extended.f +++ b/SRC/zla_syrfsx_extended.f @@ -655,7 +655,7 @@ SUBROUTINE ZLA_SYRFSX_EXTENDED( PREC_TYPE, UPLO, N, NRHS, A, LDA, PREVNORMDX = NORMDX PREV_DZ_Z = DZ_Z * -* Update soluton. +* Update solution. * IF ( Y_PREC_STATE .LT. EXTRA_Y ) THEN CALL ZAXPY( N, DCMPLX(1.0D+0), DY, 1, Y(1,J), 1 ) diff --git a/SRC/zlaed7.f b/SRC/zlaed7.f index 83f32d8b81..86e5ec6b55 100644 --- a/SRC/zlaed7.f +++ b/SRC/zlaed7.f @@ -363,7 +363,7 @@ SUBROUTINE ZLAED7( N, CUTPNT, QSIZ, TLVLS, CURLVL, CURPBM, D, Q, RETURN END IF * -* Prepare the INDXQ sorting premutation. +* Prepare the INDXQ sorting permutation. * N1 = K N2 = N - K diff --git a/SRC/zlaqz0.f b/SRC/zlaqz0.f index 2c2c4124b9..dcb28850a2 100644 --- a/SRC/zlaqz0.f +++ b/SRC/zlaqz0.f @@ -89,7 +89,7 @@ *> Anal., 29(2006), pp. 199--227. *> *> Ref: T. Steel, D. Camps, K. Meerbergen, R. Vandebril "A multishift, -*> multipole rational QZ method with agressive early deflation" +*> multipole rational QZ method with aggressive early deflation" *> \endverbatim * * Arguments: @@ -534,7 +534,7 @@ RECURSIVE SUBROUTINE ZLAQZ0( WANTS, WANTQ, WANTZ, N, ILO, IHI, A, DO WHILE ( K.GE.ISTART2 ) IF( ABS( B( K, K ) ) .LT. BTOL ) THEN -* A diagonal element of B is negligable, move it +* A diagonal element of B is negligible, move it * to the top and deflate it DO K2 = K, ISTART2+1, -1 diff --git a/SRC/zlarfb_gett.f b/SRC/zlarfb_gett.f index 4a3c4dcf19..17d4b33aa5 100644 --- a/SRC/zlarfb_gett.f +++ b/SRC/zlarfb_gett.f @@ -452,7 +452,7 @@ SUBROUTINE ZLARFB_GETT( IDENT, M, N, K, T, LDT, A, LDA, B, LDB, IF( LNOTIDENT ) THEN * * col2_(2) Compute W2: = (V1**H) * W2 = (A1**H) * W2, -* V1 is not an identy matrix, but unit lower-triangular +* V1 is not an identity matrix, but unit lower-triangular * V1 stored in A1 (diagonal ones are not stored). * * diff --git a/SRC/zlatdf.f b/SRC/zlatdf.f index 25e71edced..41714a3e0f 100644 --- a/SRC/zlatdf.f +++ b/SRC/zlatdf.f @@ -227,7 +227,7 @@ SUBROUTINE ZLATDF( IJOB, N, Z, LDZ, RHS, RDSUM, RDSCAL, IPIV, BM = RHS( J ) - CONE SPLUS = ONE * -* Lockahead for L- part RHS(1:N-1) = +-1 +* Look-ahead for L- part RHS(1:N-1) = +-1 * SPLUS and SMIN computed more efficiently than in BSOLVE[1]. * SPLUS = SPLUS + DBLE( ZDOTC( N-J, Z( J+1, J ), 1, Z( J+1, diff --git a/SRC/zlatrs3.f b/SRC/zlatrs3.f index fc1be0517a..231a17274a 100644 --- a/SRC/zlatrs3.f +++ b/SRC/zlatrs3.f @@ -577,7 +577,7 @@ SUBROUTINE ZLATRS3( UPLO, TRANS, DIAG, NORMIN, N, NRHS, A, LDA, * Prepare the linear update to be executed with GEMM. * For each column, compute a consistent scaling, a * scaling factor to survive the linear update, and -* rescale the column segments, if necesssary. Then +* rescale the column segments, if necessary. Then * the linear update is safely executed. * DO KK = 1, K2 - K1 diff --git a/SRC/zsyconvf.f b/SRC/zsyconvf.f index eb49b0f3d8..0958a5f77a 100644 --- a/SRC/zsyconvf.f +++ b/SRC/zsyconvf.f @@ -39,7 +39,7 @@ *> ZSYTRF provided on entry in parameter A into the factorization *> output format used in ZSYTRF_RK (or ZSYTRF_BK) that is stored *> on exit in parameters A and E. It also converts in place details of -*> the intechanges stored in IPIV from the format used in ZSYTRF into +*> the interchanges stored in IPIV from the format used in ZSYTRF into *> the format used in ZSYTRF_RK (or ZSYTRF_BK). *> *> If parameter WAY = 'R': @@ -48,7 +48,7 @@ *> (or ZSYTRF_BK) provided on entry in parameters A and E into *> the factorization output format used in ZSYTRF that is stored *> on exit in parameter A. It also converts in place details of -*> the intechanges stored in IPIV from the format used in ZSYTRF_RK +*> the interchanges stored in IPIV from the format used in ZSYTRF_RK *> (or ZSYTRF_BK) into the format used in ZSYTRF. *> *> ZSYCONVF can also convert in Hermitian matrix case, i.e. between @@ -325,7 +325,7 @@ SUBROUTINE ZSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -469,7 +469,7 @@ SUBROUTINE ZSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) END IF * * Convert IPIV -* There is no interchnge of rows i and and IPIV(i), +* There is no interchange of rows i and and IPIV(i), * so this should be reflected in IPIV format for * *SYTRF_RK ( or *SYTRF_BK) * @@ -535,7 +535,7 @@ SUBROUTINE ZSYCONVF( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/zsyconvf_rook.f b/SRC/zsyconvf_rook.f index 3cfa694c39..62cca060b8 100644 --- a/SRC/zsyconvf_rook.f +++ b/SRC/zsyconvf_rook.f @@ -520,7 +520,7 @@ SUBROUTINE ZSYCONVF_ROOK( UPLO, WAY, N, A, LDA, E, IPIV, INFO ) * * Revert VALUE * Assign subdiagonal entries of D from array E to -* subgiagonal entries of A. +* subdiagonal entries of A. * I = 1 DO WHILE ( I.LE.N-1 ) diff --git a/SRC/zsysv_aa_2stage.f b/SRC/zsysv_aa_2stage.f index 4f19630a97..701d73a38e 100644 --- a/SRC/zsysv_aa_2stage.f +++ b/SRC/zsysv_aa_2stage.f @@ -87,7 +87,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/zsytrf_aa.f b/SRC/zsytrf_aa.f index 73d257cfe5..ddb19925a5 100644 --- a/SRC/zsytrf_aa.f +++ b/SRC/zsytrf_aa.f @@ -74,7 +74,7 @@ *> *> On exit, the tridiagonal matrix is stored in the diagonals *> and the subdiagonals of A just below (or above) the diagonals, -*> and L is stored below (or above) the subdiaonals, when UPLO +*> and L is stored below (or above) the subdiagonals, when UPLO *> is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/zsytrf_aa_2stage.f b/SRC/zsytrf_aa_2stage.f index b731cb7a22..95b9fda0dd 100644 --- a/SRC/zsytrf_aa_2stage.f +++ b/SRC/zsytrf_aa_2stage.f @@ -75,7 +75,7 @@ *> triangular part of the matrix A, and the strictly upper *> triangular part of A is not referenced. *> -*> On exit, L is stored below (or above) the subdiaonal blocks, +*> On exit, L is stored below (or above) the subdiagonal blocks, *> when UPLO is 'L' (or 'U'). *> \endverbatim *> diff --git a/SRC/ztrexc.f b/SRC/ztrexc.f index b92e63efa9..32aae51e4b 100644 --- a/SRC/ztrexc.f +++ b/SRC/ztrexc.f @@ -40,7 +40,7 @@ *> *> The Schur form T is reordered by a unitary similarity transformation *> Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by -*> postmultplying it with Z. +*> postmultiplying it with Z. *> \endverbatim * * Arguments: diff --git a/SRC/zunbdb1.f b/SRC/zunbdb1.f index 767788a74d..2fae170de4 100644 --- a/SRC/zunbdb1.f +++ b/SRC/zunbdb1.f @@ -37,7 +37,7 @@ *>\verbatim *> *> ZUNBDB1 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/zunbdb2.f b/SRC/zunbdb2.f index 46b08aa1ed..28e78fc23c 100644 --- a/SRC/zunbdb2.f +++ b/SRC/zunbdb2.f @@ -37,7 +37,7 @@ *>\verbatim *> *> ZUNBDB2 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/zunbdb3.f b/SRC/zunbdb3.f index 74083e41a9..9f32a7a886 100644 --- a/SRC/zunbdb3.f +++ b/SRC/zunbdb3.f @@ -37,7 +37,7 @@ *>\verbatim *> *> ZUNBDB3 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/SRC/zunbdb4.f b/SRC/zunbdb4.f index 4672cfa67b..a1db5eb793 100644 --- a/SRC/zunbdb4.f +++ b/SRC/zunbdb4.f @@ -38,7 +38,7 @@ *>\verbatim *> *> ZUNBDB4 simultaneously bidiagonalizes the blocks of a tall and skinny -*> matrix X with orthonomal columns: +*> matrix X with orthonormal columns: *> *> [ B11 ] *> [ X11 ] [ P1 | ] [ 0 ] diff --git a/TESTING/EIG/cchkst.f b/TESTING/EIG/cchkst.f index 96af7d654e..ed535e91f3 100644 --- a/TESTING/EIG/cchkst.f +++ b/TESTING/EIG/cchkst.f @@ -364,7 +364,7 @@ *> \verbatim *> D1 is REAL array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by CSTEQR simlutaneously +*> The eigenvalues of A, as computed by CSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/cchkst2stg.f b/TESTING/EIG/cchkst2stg.f index 21aceed734..668b51a36d 100644 --- a/TESTING/EIG/cchkst2stg.f +++ b/TESTING/EIG/cchkst2stg.f @@ -385,7 +385,7 @@ *> \verbatim *> D1 is REAL array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by CSTEQR simlutaneously +*> The eigenvalues of A, as computed by CSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/cdrgsx.f b/TESTING/EIG/cdrgsx.f index ef6d66e147..1729770a2f 100644 --- a/TESTING/EIG/cdrgsx.f +++ b/TESTING/EIG/cdrgsx.f @@ -916,7 +916,7 @@ SUBROUTINE CDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, $ / ' 2: A and B are upper triangular matrices, ', $ / ' 3: A and B are as type 2, but each second diagonal ', $ 'block in A_11 and ', / - $ ' each third diaongal block in A_22 are 2x2 blocks,', + $ ' each third diagonal block in A_22 are 2x2 blocks,', $ / ' 4: A and B are block diagonal matrices, ', $ / ' 5: (A,B) has potentially close or common ', $ 'eigenvalues.', / ) diff --git a/TESTING/EIG/cdrvsg.f b/TESTING/EIG/cdrvsg.f index 9b3e364dd8..7299767384 100644 --- a/TESTING/EIG/cdrvsg.f +++ b/TESTING/EIG/cdrvsg.f @@ -236,7 +236,7 @@ *> *> B COMPLEX array, dimension (LDB , max(NN)) *> Used to hold the Hermitian positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/cdrvsg2stg.f b/TESTING/EIG/cdrvsg2stg.f index 048804a00b..f7d323247d 100644 --- a/TESTING/EIG/cdrvsg2stg.f +++ b/TESTING/EIG/cdrvsg2stg.f @@ -242,7 +242,7 @@ *> *> B COMPLEX array, dimension (LDB , max(NN)) *> Used to hold the Hermitian positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/cdrvst.f b/TESTING/EIG/cdrvst.f index 92ddd5d43b..205f06f0da 100644 --- a/TESTING/EIG/cdrvst.f +++ b/TESTING/EIG/cdrvst.f @@ -204,7 +204,7 @@ *> Not modified. *> *> D1 REAL array, dimension (max(NN)) -*> The eigenvalues of A, as computed by CSTEQR simlutaneously +*> The eigenvalues of A, as computed by CSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/EIG/cdrvst2stg.f b/TESTING/EIG/cdrvst2stg.f index 66d39f054e..258f1f370c 100644 --- a/TESTING/EIG/cdrvst2stg.f +++ b/TESTING/EIG/cdrvst2stg.f @@ -204,7 +204,7 @@ *> Not modified. *> *> D1 REAL array, dimension (max(NN)) -*> The eigenvalues of A, as computed by CSTEQR simlutaneously +*> The eigenvalues of A, as computed by CSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/EIG/dchkst.f b/TESTING/EIG/dchkst.f index dad0a7e32c..6e02c84fbb 100644 --- a/TESTING/EIG/dchkst.f +++ b/TESTING/EIG/dchkst.f @@ -363,7 +363,7 @@ *> \verbatim *> D1 is DOUBLE PRECISION array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by DSTEQR simlutaneously +*> The eigenvalues of A, as computed by DSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/dchkst2stg.f b/TESTING/EIG/dchkst2stg.f index e33c908f7a..0fbebc8b7a 100644 --- a/TESTING/EIG/dchkst2stg.f +++ b/TESTING/EIG/dchkst2stg.f @@ -384,7 +384,7 @@ *> \verbatim *> D1 is DOUBLE PRECISION array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by DSTEQR simlutaneously +*> The eigenvalues of A, as computed by DSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/ddrgsx.f b/TESTING/EIG/ddrgsx.f index b7efc1e633..82470ead34 100644 --- a/TESTING/EIG/ddrgsx.f +++ b/TESTING/EIG/ddrgsx.f @@ -983,7 +983,7 @@ SUBROUTINE DDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, AI, $ / ' 2: A and B are upper triangular matrices, ', $ / ' 3: A and B are as type 2, but each second diagonal ', $ 'block in A_11 and ', / - $ ' each third diaongal block in A_22 are 2x2 blocks,', + $ ' each third diagonal block in A_22 are 2x2 blocks,', $ / ' 4: A and B are block diagonal matrices, ', $ / ' 5: (A,B) has potentially close or common ', $ 'eigenvalues.', / ) diff --git a/TESTING/EIG/ddrvsg.f b/TESTING/EIG/ddrvsg.f index 4327246e57..72c373086a 100644 --- a/TESTING/EIG/ddrvsg.f +++ b/TESTING/EIG/ddrvsg.f @@ -234,7 +234,7 @@ *> *> B DOUBLE PRECISION array, dimension (LDB , max(NN)) *> Used to hold the symmetric positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/ddrvsg2stg.f b/TESTING/EIG/ddrvsg2stg.f index a48dc8c192..0fe31cab17 100644 --- a/TESTING/EIG/ddrvsg2stg.f +++ b/TESTING/EIG/ddrvsg2stg.f @@ -240,7 +240,7 @@ *> *> B DOUBLE PRECISION array, dimension (LDB , max(NN)) *> Used to hold the symmetric positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/ddrvst.f b/TESTING/EIG/ddrvst.f index 7d34ca18e1..805fd8271c 100644 --- a/TESTING/EIG/ddrvst.f +++ b/TESTING/EIG/ddrvst.f @@ -214,7 +214,7 @@ *> Not modified. *> *> D1 DOUBLE PRECISION array, dimension (max(NN)) -*> The eigenvalues of A, as computed by DSTEQR simlutaneously +*> The eigenvalues of A, as computed by DSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/EIG/ddrvst2stg.f b/TESTING/EIG/ddrvst2stg.f index 1976712777..e38671e385 100644 --- a/TESTING/EIG/ddrvst2stg.f +++ b/TESTING/EIG/ddrvst2stg.f @@ -214,7 +214,7 @@ *> Not modified. *> *> D1 DOUBLE PRECISION array, dimension (max(NN)) -*> The eigenvalues of A, as computed by DSTEQR simlutaneously +*> The eigenvalues of A, as computed by DSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/EIG/schkst.f b/TESTING/EIG/schkst.f index 8e85eb737d..aecbdfe932 100644 --- a/TESTING/EIG/schkst.f +++ b/TESTING/EIG/schkst.f @@ -363,7 +363,7 @@ *> \verbatim *> D1 is REAL array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by SSTEQR simlutaneously +*> The eigenvalues of A, as computed by SSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/schkst2stg.f b/TESTING/EIG/schkst2stg.f index 33aa1926b0..49899a660e 100644 --- a/TESTING/EIG/schkst2stg.f +++ b/TESTING/EIG/schkst2stg.f @@ -384,7 +384,7 @@ *> \verbatim *> D1 is REAL array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by SSTEQR simlutaneously +*> The eigenvalues of A, as computed by SSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/sdrgsx.f b/TESTING/EIG/sdrgsx.f index fed861eea2..2015cac1c8 100644 --- a/TESTING/EIG/sdrgsx.f +++ b/TESTING/EIG/sdrgsx.f @@ -984,7 +984,7 @@ SUBROUTINE SDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, $ / ' 2: A and B are upper triangular matrices, ', $ / ' 3: A and B are as type 2, but each second diagonal ', $ 'block in A_11 and ', / - $ ' each third diaongal block in A_22 are 2x2 blocks,', + $ ' each third diagonal block in A_22 are 2x2 blocks,', $ / ' 4: A and B are block diagonal matrices, ', $ / ' 5: (A,B) has potentially close or common ', $ 'eigenvalues.', / ) diff --git a/TESTING/EIG/sdrvsg.f b/TESTING/EIG/sdrvsg.f index f670627122..0c82b6f493 100644 --- a/TESTING/EIG/sdrvsg.f +++ b/TESTING/EIG/sdrvsg.f @@ -234,7 +234,7 @@ *> *> B REAL array, dimension (LDB , max(NN)) *> Used to hold the symmetric positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/sdrvsg2stg.f b/TESTING/EIG/sdrvsg2stg.f index 92080c5676..38ed616281 100644 --- a/TESTING/EIG/sdrvsg2stg.f +++ b/TESTING/EIG/sdrvsg2stg.f @@ -240,7 +240,7 @@ *> *> B REAL array, dimension (LDB , max(NN)) *> Used to hold the symmetric positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/sdrvst.f b/TESTING/EIG/sdrvst.f index 9a3137b25a..be6d33cee4 100644 --- a/TESTING/EIG/sdrvst.f +++ b/TESTING/EIG/sdrvst.f @@ -214,7 +214,7 @@ *> Not modified. *> *> D1 REAL array, dimension (max(NN)) -*> The eigenvalues of A, as computed by SSTEQR simlutaneously +*> The eigenvalues of A, as computed by SSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/EIG/sdrvst2stg.f b/TESTING/EIG/sdrvst2stg.f index 450b33c45e..e05ec07491 100644 --- a/TESTING/EIG/sdrvst2stg.f +++ b/TESTING/EIG/sdrvst2stg.f @@ -214,7 +214,7 @@ *> Not modified. *> *> D1 REAL array, dimension (max(NN)) -*> The eigenvalues of A, as computed by SSTEQR simlutaneously +*> The eigenvalues of A, as computed by SSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/EIG/zchkst.f b/TESTING/EIG/zchkst.f index 9fdff96944..b77d944388 100644 --- a/TESTING/EIG/zchkst.f +++ b/TESTING/EIG/zchkst.f @@ -364,7 +364,7 @@ *> \verbatim *> D1 is DOUBLE PRECISION array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by ZSTEQR simlutaneously +*> The eigenvalues of A, as computed by ZSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/zchkst2stg.f b/TESTING/EIG/zchkst2stg.f index fb25b738da..3b333ef1c0 100644 --- a/TESTING/EIG/zchkst2stg.f +++ b/TESTING/EIG/zchkst2stg.f @@ -385,7 +385,7 @@ *> \verbatim *> D1 is DOUBLE PRECISION array of *> dimension( max(NN) ) -*> The eigenvalues of A, as computed by ZSTEQR simlutaneously +*> The eigenvalues of A, as computed by ZSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> \endverbatim diff --git a/TESTING/EIG/zdrgsx.f b/TESTING/EIG/zdrgsx.f index 085b9b9ad6..a486873fa4 100644 --- a/TESTING/EIG/zdrgsx.f +++ b/TESTING/EIG/zdrgsx.f @@ -917,7 +917,7 @@ SUBROUTINE ZDRGSX( NSIZE, NCMAX, THRESH, NIN, NOUT, A, LDA, B, AI, $ / ' 2: A and B are upper triangular matrices, ', $ / ' 3: A and B are as type 2, but each second diagonal ', $ 'block in A_11 and ', / - $ ' each third diaongal block in A_22 are 2x2 blocks,', + $ ' each third diagonal block in A_22 are 2x2 blocks,', $ / ' 4: A and B are block diagonal matrices, ', $ / ' 5: (A,B) has potentially close or common ', $ 'eigenvalues.', / ) diff --git a/TESTING/EIG/zdrvsg.f b/TESTING/EIG/zdrvsg.f index fa92f6fd5d..1796805ea3 100644 --- a/TESTING/EIG/zdrvsg.f +++ b/TESTING/EIG/zdrvsg.f @@ -236,7 +236,7 @@ *> *> B COMPLEX*16 array, dimension (LDB , max(NN)) *> Used to hold the Hermitian positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/zdrvsg2stg.f b/TESTING/EIG/zdrvsg2stg.f index ebe42bfa9b..c5ef4ce700 100644 --- a/TESTING/EIG/zdrvsg2stg.f +++ b/TESTING/EIG/zdrvsg2stg.f @@ -242,7 +242,7 @@ *> *> B COMPLEX*16 array, dimension (LDB , max(NN)) *> Used to hold the Hermitian positive definite matrix for -*> the generailzed problem. +*> the generalized problem. *> On exit, B contains the last matrix actually *> used. *> Modified. diff --git a/TESTING/EIG/zdrvst.f b/TESTING/EIG/zdrvst.f index 5ec5c52290..f838f0af2e 100644 --- a/TESTING/EIG/zdrvst.f +++ b/TESTING/EIG/zdrvst.f @@ -204,7 +204,7 @@ *> Not modified. *> *> D1 DOUBLE PRECISION array, dimension (max(NN)) -*> The eigenvalues of A, as computed by ZSTEQR simlutaneously +*> The eigenvalues of A, as computed by ZSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/EIG/zdrvst2stg.f b/TESTING/EIG/zdrvst2stg.f index f02186f2a9..4b989b4606 100644 --- a/TESTING/EIG/zdrvst2stg.f +++ b/TESTING/EIG/zdrvst2stg.f @@ -204,7 +204,7 @@ *> Not modified. *> *> D1 DOUBLE PRECISION array, dimension (max(NN)) -*> The eigenvalues of A, as computed by ZSTEQR simlutaneously +*> The eigenvalues of A, as computed by ZSTEQR simultaneously *> with Z. On exit, the eigenvalues in D1 correspond with the *> matrix in A. *> Modified. diff --git a/TESTING/LIN/alahd.f b/TESTING/LIN/alahd.f index f0423a23b9..dd75394b3a 100644 --- a/TESTING/LIN/alahd.f +++ b/TESTING/LIN/alahd.f @@ -777,7 +777,7 @@ SUBROUTINE ALAHD( IOUNIT, PATH ) $ 'triangular-pentagonal matrices' ) 8004 FORMAT( / 1X, A3, ': TS factorization for ', $ 'tall-skinny or short-wide matrices' ) - 8005 FORMAT( / 1X, A3, ': Householder recostruction from TSQR', + 8005 FORMAT( / 1X, A3, ': Householder reconstruction from TSQR', $ ' factorization output ', /,' for tall-skinny matrices.' ) * * GE matrix types diff --git a/TESTING/LIN/cchktp.f b/TESTING/LIN/cchktp.f index 18242ff54c..e14f1062eb 100644 --- a/TESTING/LIN/cchktp.f +++ b/TESTING/LIN/cchktp.f @@ -87,7 +87,7 @@ *> \verbatim *> NMAX is INTEGER *> The leading dimension of the work arrays. NMAX >= the -*> maximumm value of N in NVAL. +*> maximum value of N in NVAL. *> \endverbatim *> *> \param[out] AP diff --git a/TESTING/LIN/cerrhe.f b/TESTING/LIN/cerrhe.f index d0c5cf6b59..1798aed57f 100644 --- a/TESTING/LIN/cerrhe.f +++ b/TESTING/LIN/cerrhe.f @@ -133,7 +133,7 @@ SUBROUTINE CERRHE( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'HE' ) ) THEN * * Test error exits of the routines that use factorization -* of a Hermitian indefinite matrix with patrial +* of a Hermitian indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * CHETRF @@ -576,7 +576,7 @@ SUBROUTINE CERRHE( PATH, NUNIT ) CALL CHKXER( 'CHETRS_AA_STAGE', INFOT, NOUT, LERR, OK ) * * Test error exits of the routines that use factorization -* of a Hermitian indefinite packed matrix with patrial +* of a Hermitian indefinite packed matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * ELSE IF( LSAMEN( 2, C2, 'HP' ) ) THEN diff --git a/TESTING/LIN/cerrhex.f b/TESTING/LIN/cerrhex.f index b6c8897987..83b3a92ad9 100644 --- a/TESTING/LIN/cerrhex.f +++ b/TESTING/LIN/cerrhex.f @@ -137,7 +137,7 @@ SUBROUTINE CERRHE( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'HE' ) ) THEN * * Test error exits of the routines that use factorization -* of a Hermitian indefinite matrix with patrial +* of a Hermitian indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * CHETRF @@ -523,7 +523,7 @@ SUBROUTINE CERRHE( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'HP' ) ) THEN * * Test error exits of the routines that use factorization -* of a Hermitian indefinite packed matrix with patrial +* of a Hermitian indefinite packed matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * CHPTRF diff --git a/TESTING/LIN/cerrsy.f b/TESTING/LIN/cerrsy.f index a236d2d183..6d284be980 100644 --- a/TESTING/LIN/cerrsy.f +++ b/TESTING/LIN/cerrsy.f @@ -130,7 +130,7 @@ SUBROUTINE CERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * CSYTRF @@ -469,7 +469,7 @@ SUBROUTINE CERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * CSPTRF diff --git a/TESTING/LIN/cerrsyx.f b/TESTING/LIN/cerrsyx.f index 34972668e2..c8d269c84e 100644 --- a/TESTING/LIN/cerrsyx.f +++ b/TESTING/LIN/cerrsyx.f @@ -135,7 +135,7 @@ SUBROUTINE CERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * CSYTRF @@ -521,7 +521,7 @@ SUBROUTINE CERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * CSPTRF diff --git a/TESTING/LIN/cgtt01.f b/TESTING/LIN/cgtt01.f index e504515c58..64dc5f8fab 100644 --- a/TESTING/LIN/cgtt01.f +++ b/TESTING/LIN/cgtt01.f @@ -39,7 +39,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/cgtt02.f b/TESTING/LIN/cgtt02.f index 0d067c3378..8b951acd50 100644 --- a/TESTING/LIN/cgtt02.f +++ b/TESTING/LIN/cgtt02.f @@ -47,7 +47,7 @@ *> *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/chet01_3.f b/TESTING/LIN/chet01_3.f index 58104a3575..7e07b57901 100644 --- a/TESTING/LIN/chet01_3.f +++ b/TESTING/LIN/chet01_3.f @@ -188,7 +188,7 @@ SUBROUTINE CHET01_3( UPLO, N, A, LDA, AFAC, LDAFAC, E, IPIV, C, RETURN END IF * -* a) Revert to multiplyers of L +* a) Revert to multipliers of L * CALL CSYCONVF_ROOK( UPLO, 'R', N, AFAC, LDAFAC, E, IPIV, INFO ) * diff --git a/TESTING/LIN/clqt02.f b/TESTING/LIN/clqt02.f index 24eb053995..20297f6cc6 100644 --- a/TESTING/LIN/clqt02.f +++ b/TESTING/LIN/clqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> CLQT02 tests CUNGLQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the LQ factorization of an m-by-n matrix A, CLQT02 generates diff --git a/TESTING/LIN/cptt01.f b/TESTING/LIN/cptt01.f index e4520ec3da..3b117ad285 100644 --- a/TESTING/LIN/cptt01.f +++ b/TESTING/LIN/cptt01.f @@ -36,7 +36,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/cptt02.f b/TESTING/LIN/cptt02.f index da4f0e854d..ffaef89bd5 100644 --- a/TESTING/LIN/cptt02.f +++ b/TESTING/LIN/cptt02.f @@ -46,7 +46,7 @@ *> *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/cqlt02.f b/TESTING/LIN/cqlt02.f index fc4685aa53..53080cd172 100644 --- a/TESTING/LIN/cqlt02.f +++ b/TESTING/LIN/cqlt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> CQLT02 tests CUNGQL, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QL factorization of an m-by-n matrix A, CQLT02 generates diff --git a/TESTING/LIN/cqrt02.f b/TESTING/LIN/cqrt02.f index 62f176cd85..db22496cf1 100644 --- a/TESTING/LIN/cqrt02.f +++ b/TESTING/LIN/cqrt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> CQRT02 tests CUNGQR, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QR factorization of an m-by-n matrix A, CQRT02 generates diff --git a/TESTING/LIN/crqt02.f b/TESTING/LIN/crqt02.f index 8625c2f913..81c805dc40 100644 --- a/TESTING/LIN/crqt02.f +++ b/TESTING/LIN/crqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> CRQT02 tests CUNGRQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the RQ factorization of an m-by-n matrix A, CRQT02 generates diff --git a/TESTING/LIN/csyt01_3.f b/TESTING/LIN/csyt01_3.f index f0b316cefc..879749a10f 100644 --- a/TESTING/LIN/csyt01_3.f +++ b/TESTING/LIN/csyt01_3.f @@ -188,7 +188,7 @@ SUBROUTINE CSYT01_3( UPLO, N, A, LDA, AFAC, LDAFAC, E, IPIV, C, RETURN END IF * -* a) Revert to multiplyers of L +* a) Revert to multipliers of L * CALL CSYCONVF_ROOK( UPLO, 'R', N, AFAC, LDAFAC, E, IPIV, INFO ) * diff --git a/TESTING/LIN/dchktp.f b/TESTING/LIN/dchktp.f index 9af6150ca4..6db5b13760 100644 --- a/TESTING/LIN/dchktp.f +++ b/TESTING/LIN/dchktp.f @@ -86,7 +86,7 @@ *> \verbatim *> NMAX is INTEGER *> The leading dimension of the work arrays. NMAX >= the -*> maximumm value of N in NVAL. +*> maximum value of N in NVAL. *> \endverbatim *> *> \param[out] AP diff --git a/TESTING/LIN/ddrvab.f b/TESTING/LIN/ddrvab.f index 9110d8334b..5fd32b951f 100644 --- a/TESTING/LIN/ddrvab.f +++ b/TESTING/LIN/ddrvab.f @@ -346,7 +346,7 @@ SUBROUTINE DDRVAB( DOTYPE, NM, MVAL, NNS, CALL DGET08( TRANS, N, N, NRHS, A, LDA, X, LDA, WORK, $ LDA, RWORK, RESULT( 1 ) ) * -* Check if the test passes the tesing. +* Check if the test passes the testing. * Print information about the tests that did not * pass the testing. * diff --git a/TESTING/LIN/ddrvac.f b/TESTING/LIN/ddrvac.f index bd463cee40..3ecbc6a230 100644 --- a/TESTING/LIN/ddrvac.f +++ b/TESTING/LIN/ddrvac.f @@ -365,7 +365,7 @@ SUBROUTINE DDRVAC( DOTYPE, NM, MVAL, NNS, NSVAL, THRESH, NMAX, CALL DPOT06( UPLO, N, NRHS, A, LDA, X, LDA, WORK, $ LDA, RWORK, RESULT( 1 ) ) * -* Check if the test passes the tesing. +* Check if the test passes the testing. * Print information about the tests that did not * pass the testing. * diff --git a/TESTING/LIN/derrsy.f b/TESTING/LIN/derrsy.f index af15a4b8ed..eb08d4c7bf 100644 --- a/TESTING/LIN/derrsy.f +++ b/TESTING/LIN/derrsy.f @@ -133,7 +133,7 @@ SUBROUTINE DERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) pivoting. * * DSYTRF @@ -581,7 +581,7 @@ SUBROUTINE DERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) pivoting. * * DSPTRF diff --git a/TESTING/LIN/derrsyx.f b/TESTING/LIN/derrsyx.f index c2d14caab8..495302158a 100644 --- a/TESTING/LIN/derrsyx.f +++ b/TESTING/LIN/derrsyx.f @@ -138,7 +138,7 @@ SUBROUTINE DERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) pivoting. * * DSYTRF @@ -528,7 +528,7 @@ SUBROUTINE DERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) pivoting. * * DSPTRF diff --git a/TESTING/LIN/dgtt01.f b/TESTING/LIN/dgtt01.f index 3b5ff9e4ca..6fd754db20 100644 --- a/TESTING/LIN/dgtt01.f +++ b/TESTING/LIN/dgtt01.f @@ -39,7 +39,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/dgtt02.f b/TESTING/LIN/dgtt02.f index 2c4c0cc67f..4fecff86ec 100644 --- a/TESTING/LIN/dgtt02.f +++ b/TESTING/LIN/dgtt02.f @@ -48,7 +48,7 @@ *> *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/dlqt02.f b/TESTING/LIN/dlqt02.f index 158cd0b798..672d82bbc0 100644 --- a/TESTING/LIN/dlqt02.f +++ b/TESTING/LIN/dlqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> DLQT02 tests DORGLQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the LQ factorization of an m-by-n matrix A, DLQT02 generates diff --git a/TESTING/LIN/dptt01.f b/TESTING/LIN/dptt01.f index 2c6c440ffa..9e9c6bd85d 100644 --- a/TESTING/LIN/dptt01.f +++ b/TESTING/LIN/dptt01.f @@ -35,7 +35,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/dptt02.f b/TESTING/LIN/dptt02.f index a4802c6969..e045b87791 100644 --- a/TESTING/LIN/dptt02.f +++ b/TESTING/LIN/dptt02.f @@ -35,7 +35,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/dqlt02.f b/TESTING/LIN/dqlt02.f index 950cfe67bd..7799e08586 100644 --- a/TESTING/LIN/dqlt02.f +++ b/TESTING/LIN/dqlt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> DQLT02 tests DORGQL, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QL factorization of an m-by-n matrix A, DQLT02 generates diff --git a/TESTING/LIN/dqrt02.f b/TESTING/LIN/dqrt02.f index d0e4349d1d..d41c7b3241 100644 --- a/TESTING/LIN/dqrt02.f +++ b/TESTING/LIN/dqrt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> DQRT02 tests DORGQR, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QR factorization of an m-by-n matrix A, DQRT02 generates diff --git a/TESTING/LIN/drqt02.f b/TESTING/LIN/drqt02.f index 7fbb6a6d4d..faf639109e 100644 --- a/TESTING/LIN/drqt02.f +++ b/TESTING/LIN/drqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> DRQT02 tests DORGRQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the RQ factorization of an m-by-n matrix A, DRQT02 generates diff --git a/TESTING/LIN/dsyt01_3.f b/TESTING/LIN/dsyt01_3.f index 2a7d9d1422..060a9caed8 100644 --- a/TESTING/LIN/dsyt01_3.f +++ b/TESTING/LIN/dsyt01_3.f @@ -183,7 +183,7 @@ SUBROUTINE DSYT01_3( UPLO, N, A, LDA, AFAC, LDAFAC, E, IPIV, C, RETURN END IF * -* a) Revert to multiplyers of L +* a) Revert to multipliers of L * CALL DSYCONVF_ROOK( UPLO, 'R', N, AFAC, LDAFAC, E, IPIV, INFO ) * diff --git a/TESTING/LIN/schktp.f b/TESTING/LIN/schktp.f index ff05c1d97a..a5243f651b 100644 --- a/TESTING/LIN/schktp.f +++ b/TESTING/LIN/schktp.f @@ -86,7 +86,7 @@ *> \verbatim *> NMAX is INTEGER *> The leading dimension of the work arrays. NMAX >= the -*> maximumm value of N in NVAL. +*> maximum value of N in NVAL. *> \endverbatim *> *> \param[out] AP diff --git a/TESTING/LIN/serrsy.f b/TESTING/LIN/serrsy.f index c562b417b2..ab422ba5c1 100644 --- a/TESTING/LIN/serrsy.f +++ b/TESTING/LIN/serrsy.f @@ -133,7 +133,7 @@ SUBROUTINE SERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) pivoting. * * SSYTRF @@ -581,7 +581,7 @@ SUBROUTINE SERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) pivoting. * * SSPTRF diff --git a/TESTING/LIN/serrsyx.f b/TESTING/LIN/serrsyx.f index ed47c37bd9..cffd28a52f 100644 --- a/TESTING/LIN/serrsyx.f +++ b/TESTING/LIN/serrsyx.f @@ -137,7 +137,7 @@ SUBROUTINE SERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) pivoting. * * SSYTRF @@ -527,7 +527,7 @@ SUBROUTINE SERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) pivoting. * * SSPTRF diff --git a/TESTING/LIN/sgtt01.f b/TESTING/LIN/sgtt01.f index 5d88c91f77..5d639af990 100644 --- a/TESTING/LIN/sgtt01.f +++ b/TESTING/LIN/sgtt01.f @@ -39,7 +39,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/sgtt02.f b/TESTING/LIN/sgtt02.f index 97882436bc..6daea295fd 100644 --- a/TESTING/LIN/sgtt02.f +++ b/TESTING/LIN/sgtt02.f @@ -48,7 +48,7 @@ *> *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/slqt02.f b/TESTING/LIN/slqt02.f index d59a8a01c5..1c7bd4f0df 100644 --- a/TESTING/LIN/slqt02.f +++ b/TESTING/LIN/slqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> SLQT02 tests SORGLQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the LQ factorization of an m-by-n matrix A, SLQT02 generates diff --git a/TESTING/LIN/sptt01.f b/TESTING/LIN/sptt01.f index fef18dd2b4..5b33bfad50 100644 --- a/TESTING/LIN/sptt01.f +++ b/TESTING/LIN/sptt01.f @@ -35,7 +35,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/sptt02.f b/TESTING/LIN/sptt02.f index 51a6a074a1..2bd5535aa5 100644 --- a/TESTING/LIN/sptt02.f +++ b/TESTING/LIN/sptt02.f @@ -35,7 +35,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/sqlt02.f b/TESTING/LIN/sqlt02.f index 5d381b950a..f26352eb31 100644 --- a/TESTING/LIN/sqlt02.f +++ b/TESTING/LIN/sqlt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> SQLT02 tests SORGQL, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QL factorization of an m-by-n matrix A, SQLT02 generates diff --git a/TESTING/LIN/sqrt02.f b/TESTING/LIN/sqrt02.f index 72163f0a9d..44b9c62702 100644 --- a/TESTING/LIN/sqrt02.f +++ b/TESTING/LIN/sqrt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> SQRT02 tests SORGQR, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QR factorization of an m-by-n matrix A, SQRT02 generates diff --git a/TESTING/LIN/srqt02.f b/TESTING/LIN/srqt02.f index ca0594f7af..a33c98ba42 100644 --- a/TESTING/LIN/srqt02.f +++ b/TESTING/LIN/srqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> SRQT02 tests SORGRQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the RQ factorization of an m-by-n matrix A, SRQT02 generates diff --git a/TESTING/LIN/ssyt01_3.f b/TESTING/LIN/ssyt01_3.f index 147553db9e..951fcb7d6e 100644 --- a/TESTING/LIN/ssyt01_3.f +++ b/TESTING/LIN/ssyt01_3.f @@ -183,7 +183,7 @@ SUBROUTINE SSYT01_3( UPLO, N, A, LDA, AFAC, LDAFAC, E, IPIV, C, RETURN END IF * -* a) Revert to multiplyers of L +* a) Revert to multipliers of L * CALL SSYCONVF_ROOK( UPLO, 'R', N, AFAC, LDAFAC, E, IPIV, INFO ) * diff --git a/TESTING/LIN/zchktp.f b/TESTING/LIN/zchktp.f index 1798c24e77..ab46f5ce54 100644 --- a/TESTING/LIN/zchktp.f +++ b/TESTING/LIN/zchktp.f @@ -87,7 +87,7 @@ *> \verbatim *> NMAX is INTEGER *> The leading dimension of the work arrays. NMAX >= the -*> maximumm value of N in NVAL. +*> maximum value of N in NVAL. *> \endverbatim *> *> \param[out] AP diff --git a/TESTING/LIN/zdrvab.f b/TESTING/LIN/zdrvab.f index 1305159593..772eb08afb 100644 --- a/TESTING/LIN/zdrvab.f +++ b/TESTING/LIN/zdrvab.f @@ -348,7 +348,7 @@ SUBROUTINE ZDRVAB( DOTYPE, NM, MVAL, NNS, CALL ZGET08( TRANS, N, N, NRHS, A, LDA, X, LDA, WORK, $ LDA, RWORK, RESULT( 1 ) ) * -* Check if the test passes the tesing. +* Check if the test passes the testing. * Print information about the tests that did not * pass the testing. * diff --git a/TESTING/LIN/zdrvac.f b/TESTING/LIN/zdrvac.f index 20f8eb1e55..bbf73a263c 100644 --- a/TESTING/LIN/zdrvac.f +++ b/TESTING/LIN/zdrvac.f @@ -367,7 +367,7 @@ SUBROUTINE ZDRVAC( DOTYPE, NM, MVAL, NNS, NSVAL, THRESH, NMAX, CALL ZPOT06( UPLO, N, NRHS, A, LDA, X, LDA, WORK, $ LDA, RWORK, RESULT( 1 ) ) * -* Check if the test passes the tesing. +* Check if the test passes the testing. * Print information about the tests that did not * pass the testing. * diff --git a/TESTING/LIN/zerrhe.f b/TESTING/LIN/zerrhe.f index e49e5037c5..40dd25d750 100644 --- a/TESTING/LIN/zerrhe.f +++ b/TESTING/LIN/zerrhe.f @@ -135,7 +135,7 @@ SUBROUTINE ZERRHE( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'HE' ) ) THEN * * Test error exits of the routines that use factorization -* of a Hermitian indefinite matrix with patrial +* of a Hermitian indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * ZHETRF @@ -580,7 +580,7 @@ SUBROUTINE ZERRHE( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'HP' ) ) THEN * * Test error exits of the routines that use factorization -* of a Hermitian indefinite packed matrix with patrial +* of a Hermitian indefinite packed matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * ZHPTRF diff --git a/TESTING/LIN/zerrhex.f b/TESTING/LIN/zerrhex.f index b6e8b77ef3..bdcdefff7d 100644 --- a/TESTING/LIN/zerrhex.f +++ b/TESTING/LIN/zerrhex.f @@ -138,7 +138,7 @@ SUBROUTINE ZERRHE( PATH, NUNIT ) OK = .TRUE. * * Test error exits of the routines that use factorization -* of a Hermitian indefinite matrix with patrial +* of a Hermitian indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * IF( LSAMEN( 2, C2, 'HE' ) ) THEN @@ -526,7 +526,7 @@ SUBROUTINE ZERRHE( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'HP' ) ) THEN * * Test error exits of the routines that use factorization -* of a Hermitian indefinite packed matrix with patrial +* of a Hermitian indefinite packed matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * ZHPTRF diff --git a/TESTING/LIN/zerrsy.f b/TESTING/LIN/zerrsy.f index a50f9d24e3..932df19368 100644 --- a/TESTING/LIN/zerrsy.f +++ b/TESTING/LIN/zerrsy.f @@ -132,7 +132,7 @@ SUBROUTINE ZERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * ZSYTRF @@ -471,7 +471,7 @@ SUBROUTINE ZERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) pivoting. * * ZSPTRF diff --git a/TESTING/LIN/zerrsyx.f b/TESTING/LIN/zerrsyx.f index 23d2a5a2ba..9d5e71288b 100644 --- a/TESTING/LIN/zerrsyx.f +++ b/TESTING/LIN/zerrsyx.f @@ -139,7 +139,7 @@ SUBROUTINE ZERRSY( PATH, NUNIT ) IF( LSAMEN( 2, C2, 'SY' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite matrix with patrial +* of a symmetric indefinite matrix with partial * (Bunch-Kaufman) diagonal pivoting method. * * ZSYTRF @@ -525,7 +525,7 @@ SUBROUTINE ZERRSY( PATH, NUNIT ) ELSE IF( LSAMEN( 2, C2, 'SP' ) ) THEN * * Test error exits of the routines that use factorization -* of a symmetric indefinite packed matrix with patrial +* of a symmetric indefinite packed matrix with partial * (Bunch-Kaufman) pivoting. * * ZSPTRF diff --git a/TESTING/LIN/zgtt01.f b/TESTING/LIN/zgtt01.f index c63fdbc25d..a8ac13d2df 100644 --- a/TESTING/LIN/zgtt01.f +++ b/TESTING/LIN/zgtt01.f @@ -39,7 +39,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/zgtt02.f b/TESTING/LIN/zgtt02.f index 72cc9ea712..f86fe9244c 100644 --- a/TESTING/LIN/zgtt02.f +++ b/TESTING/LIN/zgtt02.f @@ -47,7 +47,7 @@ *> *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. N >= 0. *> \endverbatim *> diff --git a/TESTING/LIN/zhet01_3.f b/TESTING/LIN/zhet01_3.f index 0a76404d66..5beed9042f 100644 --- a/TESTING/LIN/zhet01_3.f +++ b/TESTING/LIN/zhet01_3.f @@ -188,7 +188,7 @@ SUBROUTINE ZHET01_3( UPLO, N, A, LDA, AFAC, LDAFAC, E, IPIV, C, RETURN END IF * -* a) Revert to multiplyers of L +* a) Revert to multipliers of L * CALL ZSYCONVF_ROOK( UPLO, 'R', N, AFAC, LDAFAC, E, IPIV, INFO ) * diff --git a/TESTING/LIN/zlqt02.f b/TESTING/LIN/zlqt02.f index c55d76ccdb..9ba98ff1f9 100644 --- a/TESTING/LIN/zlqt02.f +++ b/TESTING/LIN/zlqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> ZLQT02 tests ZUNGLQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the LQ factorization of an m-by-n matrix A, ZLQT02 generates diff --git a/TESTING/LIN/zptt01.f b/TESTING/LIN/zptt01.f index e842c7e46f..9f2359c2a8 100644 --- a/TESTING/LIN/zptt01.f +++ b/TESTING/LIN/zptt01.f @@ -36,7 +36,7 @@ * *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/zptt02.f b/TESTING/LIN/zptt02.f index 6e3a8aed09..8a1e2961c6 100644 --- a/TESTING/LIN/zptt02.f +++ b/TESTING/LIN/zptt02.f @@ -46,7 +46,7 @@ *> *> \param[in] N *> \verbatim -*> N is INTEGTER +*> N is INTEGER *> The order of the matrix A. *> \endverbatim *> diff --git a/TESTING/LIN/zqlt02.f b/TESTING/LIN/zqlt02.f index 1f84cfa5a2..7cb889931b 100644 --- a/TESTING/LIN/zqlt02.f +++ b/TESTING/LIN/zqlt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> ZQLT02 tests ZUNGQL, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QL factorization of an m-by-n matrix A, ZQLT02 generates diff --git a/TESTING/LIN/zqrt02.f b/TESTING/LIN/zqrt02.f index 2dbefaf84e..a32703c496 100644 --- a/TESTING/LIN/zqrt02.f +++ b/TESTING/LIN/zqrt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> ZQRT02 tests ZUNGQR, which generates an m-by-n matrix Q with -*> orthonornmal columns that is defined as the product of k elementary +*> orthonormal columns that is defined as the product of k elementary *> reflectors. *> *> Given the QR factorization of an m-by-n matrix A, ZQRT02 generates diff --git a/TESTING/LIN/zrqt02.f b/TESTING/LIN/zrqt02.f index 548321d000..c44e04cb69 100644 --- a/TESTING/LIN/zrqt02.f +++ b/TESTING/LIN/zrqt02.f @@ -27,7 +27,7 @@ *> \verbatim *> *> ZRQT02 tests ZUNGRQ, which generates an m-by-n matrix Q with -*> orthonornmal rows that is defined as the product of k elementary +*> orthonormal rows that is defined as the product of k elementary *> reflectors. *> *> Given the RQ factorization of an m-by-n matrix A, ZRQT02 generates diff --git a/TESTING/LIN/zsyt01_3.f b/TESTING/LIN/zsyt01_3.f index 202488db98..a572353f26 100644 --- a/TESTING/LIN/zsyt01_3.f +++ b/TESTING/LIN/zsyt01_3.f @@ -188,7 +188,7 @@ SUBROUTINE ZSYT01_3( UPLO, N, A, LDA, AFAC, LDAFAC, E, IPIV, C, RETURN END IF * -* a) Revert to multiplyers of L +* a) Revert to multipliers of L * CALL ZSYCONVF_ROOK( UPLO, 'R', N, AFAC, LDAFAC, E, IPIV, INFO ) *