From 45b5d663d4ba47d6a754e73536c94e19dcb3d7d2 Mon Sep 17 00:00:00 2001 From: Julien Langou Date: Tue, 4 Apr 2023 20:21:43 -0600 Subject: [PATCH] fix #813 --- SRC/cgejsv.f | 6 +++--- SRC/cgsvj0.f | 6 +++--- SRC/cgsvj1.f | 6 +++--- SRC/clalsa.f | 4 ++-- SRC/cstegr.f | 2 +- SRC/ctgevc.f | 2 +- SRC/ctgsen.f | 2 +- SRC/dgejsv.f | 6 +++--- SRC/dgsvj0.f | 6 +++--- SRC/dgsvj1.f | 6 +++--- SRC/dlalsa.f | 4 ++-- SRC/dlarre.f | 2 +- SRC/dstegr.f | 2 +- SRC/dtgevc.f | 2 +- SRC/iparam2stage.F | 4 ++-- SRC/sgejsv.f | 6 +++--- SRC/sgsvj0.f | 6 +++--- SRC/sgsvj1.f | 6 +++--- SRC/slalsa.f | 4 ++-- SRC/slarre.f | 2 +- SRC/sstegr.f | 2 +- SRC/stgevc.f | 2 +- SRC/zgejsv.f | 6 +++--- SRC/zgsvj0.f | 6 +++--- SRC/zgsvj1.f | 6 +++--- SRC/zlalsa.f | 4 ++-- SRC/zstegr.f | 2 +- SRC/ztgevc.f | 2 +- SRC/ztgsy2.f | 2 +- TESTING/EIG/cdrgvx.f | 2 +- TESTING/EIG/ddrgvx.f | 2 +- TESTING/EIG/sdrgvx.f | 2 +- TESTING/EIG/zdrgvx.f | 2 +- TESTING/LIN/crzt01.f | 2 +- TESTING/LIN/drzt01.f | 2 +- TESTING/LIN/srzt01.f | 2 +- TESTING/LIN/zrzt01.f | 2 +- 37 files changed, 66 insertions(+), 66 deletions(-) diff --git a/SRC/cgejsv.f b/SRC/cgejsv.f index 8fe4159f62..2b7b2dc709 100644 --- a/SRC/cgejsv.f +++ b/SRC/cgejsv.f @@ -1819,7 +1819,7 @@ SUBROUTINE CGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, IF ( CONDR2 .GE. COND_OK ) THEN * .. save the Householder vectors used for Q3 * (this overwrites the copy of R2, as it will not be -* needed in this branch, but it does not overwritte the +* needed in this branch, but it does not overwrite the * Huseholder vectors of Q2.). CALL CLACPY( 'U', NR, NR, V, LDV, CWORK(2*N+1), N ) * .. and the rest of the information on Q3 is in @@ -1842,7 +1842,7 @@ SUBROUTINE CGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, END IF * * Second preconditioning finished; continue with Jacobi SVD -* The input matrix is lower trinagular. +* The input matrix is lower triangular. * * Recover the right singular vectors as solution of a well * conditioned triangular matrix equation. @@ -1886,7 +1886,7 @@ SUBROUTINE CGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, ELSE IF ( CONDR2 .LT. COND_OK ) THEN * * The matrix R2 is inverted. The solution of the matrix equation -* is Q3^* * V3 = the product of the Jacobi rotations (appplied to +* is Q3^* * V3 = the product of the Jacobi rotations (applied to * the lower triangular L3 from the LQ factorization of * R2=L3*Q3), pre-multiplied with the transposed Q3. CALL CGESVJ( 'L', 'U', 'N', NR, NR, V, LDV, SVA, NR, U, diff --git a/SRC/cgsvj0.f b/SRC/cgsvj0.f index 37853a10a1..9e6053013e 100644 --- a/SRC/cgsvj0.f +++ b/SRC/cgsvj0.f @@ -117,7 +117,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -125,9 +125,9 @@ *> \param[in,out] V *> \verbatim *> V is COMPLEX array, dimension (LDV,N) -*> If JOBV = 'V' then N rows of V are post-multipled by a +*> If JOBV = 'V' then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A' then MV rows of V are post-multipled by a +*> If JOBV = 'A' then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/cgsvj1.f b/SRC/cgsvj1.f index f1a5204e32..6d68e920d5 100644 --- a/SRC/cgsvj1.f +++ b/SRC/cgsvj1.f @@ -147,7 +147,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -155,9 +155,9 @@ *> \param[in,out] V *> \verbatim *> V is COMPLEX array, dimension (LDV,N) -*> If JOBV = 'V' then N rows of V are post-multipled by a +*> If JOBV = 'V' then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A' then MV rows of V are post-multipled by a +*> If JOBV = 'A' then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/clalsa.f b/SRC/clalsa.f index 06883ab207..fceb380f5b 100644 --- a/SRC/clalsa.f +++ b/SRC/clalsa.f @@ -42,9 +42,9 @@ *> *> \verbatim *> -*> CLALSA is an itermediate step in solving the least squares problem +*> CLALSA is an intermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The -*> singular vectors are computed as products of simple orthorgonal +*> singular vectors are computed as products of simple orthogonal *> matrices.). *> *> If ICOMPQ = 0, CLALSA applies the inverse of the left singular vector diff --git a/SRC/cstegr.f b/SRC/cstegr.f index 9d6e06da32..a162d50768 100644 --- a/SRC/cstegr.f +++ b/SRC/cstegr.f @@ -56,7 +56,7 @@ *> *> Note : CSTEGR and CSTEMR work only on machines which follow *> IEEE-754 floating-point standard in their handling of infinities and -*> NaNs. Normal execution may create these exceptiona values and hence +*> NaNs. Normal execution may create these exceptional values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. *> \endverbatim diff --git a/SRC/ctgevc.f b/SRC/ctgevc.f index d3869e68e9..0a907d5278 100644 --- a/SRC/ctgevc.f +++ b/SRC/ctgevc.f @@ -53,7 +53,7 @@ *> *> S*x = w*P*x, (y**H)*S = w*(y**H)*P, *> -*> where y**H denotes the conjugate tranpose of y. +*> where y**H denotes the conjugate transpose of y. *> The eigenvalues are not input to this routine, but are computed *> directly from the diagonal elements of S and P. *> diff --git a/SRC/ctgsen.f b/SRC/ctgsen.f index f9b6cd10c8..ffd6380996 100644 --- a/SRC/ctgsen.f +++ b/SRC/ctgsen.f @@ -339,7 +339,7 @@ *> [ kron(In2, B11) -kron(B22**H, In1) ]. *> *> Here, Inx is the identity matrix of size nx and A22**H is the -*> conjuguate transpose of A22. kron(X, Y) is the Kronecker product between +*> conjugate transpose of A22. kron(X, Y) is the Kronecker product between *> the matrices X and Y. *> *> When DIF(2) is small, small changes in (A, B) can cause large changes diff --git a/SRC/dgejsv.f b/SRC/dgejsv.f index ee769bb384..798e9154d8 100644 --- a/SRC/dgejsv.f +++ b/SRC/dgejsv.f @@ -1386,7 +1386,7 @@ SUBROUTINE DGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, IF ( CONDR2 .GE. COND_OK ) THEN * .. save the Householder vectors used for Q3 * (this overwrites the copy of R2, as it will not be -* needed in this branch, but it does not overwritte the +* needed in this branch, but it does not overwrite the * Huseholder vectors of Q2.). CALL DLACPY( 'U', NR, NR, V, LDV, WORK(2*N+1), N ) * .. and the rest of the information on Q3 is in @@ -1409,7 +1409,7 @@ SUBROUTINE DGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, END IF * * Second preconditioning finished; continue with Jacobi SVD -* The input matrix is lower trinagular. +* The input matrix is lower triangular. * * Recover the right singular vectors as solution of a well * conditioned triangular matrix equation. @@ -1454,7 +1454,7 @@ SUBROUTINE DGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, * :) .. the input matrix A is very likely a relative of * the Kahan matrix :) * The matrix R2 is inverted. The solution of the matrix equation -* is Q3^T*V3 = the product of the Jacobi rotations (appplied to +* is Q3^T*V3 = the product of the Jacobi rotations (applied to * the lower triangular L3 from the LQ factorization of * R2=L3*Q3), pre-multiplied with the transposed Q3. CALL DGESVJ( 'L', 'U', 'N', NR, NR, V, LDV, SVA, NR, U, diff --git a/SRC/dgsvj0.f b/SRC/dgsvj0.f index 197a9a626c..586723e648 100644 --- a/SRC/dgsvj0.f +++ b/SRC/dgsvj0.f @@ -117,7 +117,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -125,9 +125,9 @@ *> \param[in,out] V *> \verbatim *> V is DOUBLE PRECISION array, dimension (LDV,N) -*> If JOBV = 'V' then N rows of V are post-multipled by a +*> If JOBV = 'V' then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A' then MV rows of V are post-multipled by a +*> If JOBV = 'A' then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/dgsvj1.f b/SRC/dgsvj1.f index 11d1dde2bc..d757bb927b 100644 --- a/SRC/dgsvj1.f +++ b/SRC/dgsvj1.f @@ -147,7 +147,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -155,9 +155,9 @@ *> \param[in,out] V *> \verbatim *> V is DOUBLE PRECISION array, dimension (LDV,N) -*> If JOBV = 'V', then N rows of V are post-multipled by a +*> If JOBV = 'V', then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/dlalsa.f b/SRC/dlalsa.f index da8e0fa175..d89f5d2f9e 100644 --- a/SRC/dlalsa.f +++ b/SRC/dlalsa.f @@ -43,9 +43,9 @@ *> *> \verbatim *> -*> DLALSA is an itermediate step in solving the least squares problem +*> DLALSA is an intermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The -*> singular vectors are computed as products of simple orthorgonal +*> singular vectors are computed as products of simple orthogonal *> matrices.). *> *> If ICOMPQ = 0, DLALSA applies the inverse of the left singular vector diff --git a/SRC/dlarre.f b/SRC/dlarre.f index 70f59b8295..1cceed1a2e 100644 --- a/SRC/dlarre.f +++ b/SRC/dlarre.f @@ -51,7 +51,7 @@ *> DSTEMR to compute the eigenvectors of T. *> The accuracy varies depending on whether bisection is used to *> find a few eigenvalues or the dqds algorithm (subroutine DLASQ2) to -*> conpute all and then discard any unwanted one. +*> compute all and then discard any unwanted one. *> As an added benefit, DLARRE also outputs the n *> Gerschgorin intervals for the matrices L_i D_i L_i^T. *> \endverbatim diff --git a/SRC/dstegr.f b/SRC/dstegr.f index 01ec101d8c..598c60e8d5 100644 --- a/SRC/dstegr.f +++ b/SRC/dstegr.f @@ -56,7 +56,7 @@ *> *> Note : DSTEGR and DSTEMR work only on machines which follow *> IEEE-754 floating-point standard in their handling of infinities and -*> NaNs. Normal execution may create these exceptiona values and hence +*> NaNs. Normal execution may create these exceptional values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. *> \endverbatim diff --git a/SRC/dtgevc.f b/SRC/dtgevc.f index 282064890f..be70b20832 100644 --- a/SRC/dtgevc.f +++ b/SRC/dtgevc.f @@ -52,7 +52,7 @@ *> *> S*x = w*P*x, (y**H)*S = w*(y**H)*P, *> -*> where y**H denotes the conjugate tranpose of y. +*> where y**H denotes the conjugate transpose of y. *> The eigenvalues are not input to this routine, but are computed *> directly from the diagonal blocks of S and P. *> diff --git a/SRC/iparam2stage.F b/SRC/iparam2stage.F index c701c2be08..52d507e9d7 100644 --- a/SRC/iparam2stage.F +++ b/SRC/iparam2stage.F @@ -89,14 +89,14 @@ *> *> \param[in] NBI *> \verbatim -*> NBI is INTEGER which is the used in the reduciton, +*> NBI is INTEGER which is the used in the reduction, *> (e.g., the size of the band), needed to compute workspace *> and LHOUS2. *> \endverbatim *> *> \param[in] IBI *> \verbatim -*> IBI is INTEGER which represent the IB of the reduciton, +*> IBI is INTEGER which represent the IB of the reduction, *> needed to compute workspace and LHOUS2. *> \endverbatim *> diff --git a/SRC/sgejsv.f b/SRC/sgejsv.f index 923573bdb4..1333e54fbb 100644 --- a/SRC/sgejsv.f +++ b/SRC/sgejsv.f @@ -1386,7 +1386,7 @@ SUBROUTINE SGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, IF ( CONDR2 .GE. COND_OK ) THEN * .. save the Householder vectors used for Q3 * (this overwrites the copy of R2, as it will not be -* needed in this branch, but it does not overwritte the +* needed in this branch, but it does not overwrite the * Huseholder vectors of Q2.). CALL SLACPY( 'U', NR, NR, V, LDV, WORK(2*N+1), N ) * .. and the rest of the information on Q3 is in @@ -1409,7 +1409,7 @@ SUBROUTINE SGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, END IF * * Second preconditioning finished; continue with Jacobi SVD -* The input matrix is lower trinagular. +* The input matrix is lower triangular. * * Recover the right singular vectors as solution of a well * conditioned triangular matrix equation. @@ -1454,7 +1454,7 @@ SUBROUTINE SGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, * :) .. the input matrix A is very likely a relative of * the Kahan matrix :) * The matrix R2 is inverted. The solution of the matrix equation -* is Q3^T*V3 = the product of the Jacobi rotations (appplied to +* is Q3^T*V3 = the product of the Jacobi rotations (applied to * the lower triangular L3 from the LQ factorization of * R2=L3*Q3), pre-multiplied with the transposed Q3. CALL SGESVJ( 'L', 'U', 'N', NR, NR, V, LDV, SVA, NR, U, diff --git a/SRC/sgsvj0.f b/SRC/sgsvj0.f index 23b6f0077f..9249f42195 100644 --- a/SRC/sgsvj0.f +++ b/SRC/sgsvj0.f @@ -117,7 +117,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -125,9 +125,9 @@ *> \param[in,out] V *> \verbatim *> V is REAL array, dimension (LDV,N) -*> If JOBV = 'V' then N rows of V are post-multipled by a +*> If JOBV = 'V' then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A' then MV rows of V are post-multipled by a +*> If JOBV = 'A' then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/sgsvj1.f b/SRC/sgsvj1.f index 0345ccb421..79fd4d2d3f 100644 --- a/SRC/sgsvj1.f +++ b/SRC/sgsvj1.f @@ -147,7 +147,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -155,9 +155,9 @@ *> \param[in,out] V *> \verbatim *> V is REAL array, dimension (LDV,N) -*> If JOBV = 'V' then N rows of V are post-multipled by a +*> If JOBV = 'V' then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A' then MV rows of V are post-multipled by a +*> If JOBV = 'A' then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/slalsa.f b/SRC/slalsa.f index 465455e4a1..95becc76e9 100644 --- a/SRC/slalsa.f +++ b/SRC/slalsa.f @@ -43,9 +43,9 @@ *> *> \verbatim *> -*> SLALSA is an itermediate step in solving the least squares problem +*> SLALSA is an intermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The -*> singular vectors are computed as products of simple orthorgonal +*> singular vectors are computed as products of simple orthogonal *> matrices.). *> *> If ICOMPQ = 0, SLALSA applies the inverse of the left singular vector diff --git a/SRC/slarre.f b/SRC/slarre.f index 2e34ca5a6a..e1b52c3858 100644 --- a/SRC/slarre.f +++ b/SRC/slarre.f @@ -51,7 +51,7 @@ *> SSTEMR to compute the eigenvectors of T. *> The accuracy varies depending on whether bisection is used to *> find a few eigenvalues or the dqds algorithm (subroutine SLASQ2) to -*> conpute all and then discard any unwanted one. +*> compute all and then discard any unwanted one. *> As an added benefit, SLARRE also outputs the n *> Gerschgorin intervals for the matrices L_i D_i L_i^T. *> \endverbatim diff --git a/SRC/sstegr.f b/SRC/sstegr.f index 2e2975fdf5..2967a6969d 100644 --- a/SRC/sstegr.f +++ b/SRC/sstegr.f @@ -56,7 +56,7 @@ *> *> Note : SSTEGR and SSTEMR work only on machines which follow *> IEEE-754 floating-point standard in their handling of infinities and -*> NaNs. Normal execution may create these exceptiona values and hence +*> NaNs. Normal execution may create these exceptional values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. *> \endverbatim diff --git a/SRC/stgevc.f b/SRC/stgevc.f index dd7a24ddc3..be4cb18296 100644 --- a/SRC/stgevc.f +++ b/SRC/stgevc.f @@ -52,7 +52,7 @@ *> *> S*x = w*P*x, (y**H)*S = w*(y**H)*P, *> -*> where y**H denotes the conjugate tranpose of y. +*> where y**H denotes the conjugate transpose of y. *> The eigenvalues are not input to this routine, but are computed *> directly from the diagonal blocks of S and P. *> diff --git a/SRC/zgejsv.f b/SRC/zgejsv.f index 464c4a0fa3..a36a9188aa 100644 --- a/SRC/zgejsv.f +++ b/SRC/zgejsv.f @@ -1821,7 +1821,7 @@ SUBROUTINE ZGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, IF ( CONDR2 .GE. COND_OK ) THEN * .. save the Householder vectors used for Q3 * (this overwrites the copy of R2, as it will not be -* needed in this branch, but it does not overwritte the +* needed in this branch, but it does not overwrite the * Huseholder vectors of Q2.). CALL ZLACPY( 'U', NR, NR, V, LDV, CWORK(2*N+1), N ) * .. and the rest of the information on Q3 is in @@ -1844,7 +1844,7 @@ SUBROUTINE ZGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, END IF * * Second preconditioning finished; continue with Jacobi SVD -* The input matrix is lower trinagular. +* The input matrix is lower triangular. * * Recover the right singular vectors as solution of a well * conditioned triangular matrix equation. @@ -1888,7 +1888,7 @@ SUBROUTINE ZGEJSV( JOBA, JOBU, JOBV, JOBR, JOBT, JOBP, ELSE IF ( CONDR2 .LT. COND_OK ) THEN * * The matrix R2 is inverted. The solution of the matrix equation -* is Q3^* * V3 = the product of the Jacobi rotations (appplied to +* is Q3^* * V3 = the product of the Jacobi rotations (applied to * the lower triangular L3 from the LQ factorization of * R2=L3*Q3), pre-multiplied with the transposed Q3. CALL ZGESVJ( 'L', 'U', 'N', NR, NR, V, LDV, SVA, NR, U, diff --git a/SRC/zgsvj0.f b/SRC/zgsvj0.f index 672ab7590b..11bfbd8dcb 100644 --- a/SRC/zgsvj0.f +++ b/SRC/zgsvj0.f @@ -117,7 +117,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -125,9 +125,9 @@ *> \param[in,out] V *> \verbatim *> V is COMPLEX*16 array, dimension (LDV,N) -*> If JOBV = 'V' then N rows of V are post-multipled by a +*> If JOBV = 'V' then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A' then MV rows of V are post-multipled by a +*> If JOBV = 'A' then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/zgsvj1.f b/SRC/zgsvj1.f index 2461a95558..efe0384ef8 100644 --- a/SRC/zgsvj1.f +++ b/SRC/zgsvj1.f @@ -147,7 +147,7 @@ *> \param[in] MV *> \verbatim *> MV is INTEGER -*> If JOBV = 'A', then MV rows of V are post-multipled by a +*> If JOBV = 'A', then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then MV is not referenced. *> \endverbatim @@ -155,9 +155,9 @@ *> \param[in,out] V *> \verbatim *> V is COMPLEX*16 array, dimension (LDV,N) -*> If JOBV = 'V' then N rows of V are post-multipled by a +*> If JOBV = 'V' then N rows of V are post-multiplied by a *> sequence of Jacobi rotations. -*> If JOBV = 'A' then MV rows of V are post-multipled by a +*> If JOBV = 'A' then MV rows of V are post-multiplied by a *> sequence of Jacobi rotations. *> If JOBV = 'N', then V is not referenced. *> \endverbatim diff --git a/SRC/zlalsa.f b/SRC/zlalsa.f index 73ccf3a8bf..d419598d21 100644 --- a/SRC/zlalsa.f +++ b/SRC/zlalsa.f @@ -42,9 +42,9 @@ *> *> \verbatim *> -*> ZLALSA is an itermediate step in solving the least squares problem +*> ZLALSA is an intermediate step in solving the least squares problem *> by computing the SVD of the coefficient matrix in compact form (The -*> singular vectors are computed as products of simple orthorgonal +*> singular vectors are computed as products of simple orthogonal *> matrices.). *> *> If ICOMPQ = 0, ZLALSA applies the inverse of the left singular vector diff --git a/SRC/zstegr.f b/SRC/zstegr.f index ee43a0d214..3736a0517b 100644 --- a/SRC/zstegr.f +++ b/SRC/zstegr.f @@ -56,7 +56,7 @@ *> *> Note : ZSTEGR and ZSTEMR work only on machines which follow *> IEEE-754 floating-point standard in their handling of infinities and -*> NaNs. Normal execution may create these exceptiona values and hence +*> NaNs. Normal execution may create these exceptional values and hence *> may abort due to a floating point exception in environments which *> do not conform to the IEEE-754 standard. *> \endverbatim diff --git a/SRC/ztgevc.f b/SRC/ztgevc.f index 793eabc5bf..fa47e710ea 100644 --- a/SRC/ztgevc.f +++ b/SRC/ztgevc.f @@ -53,7 +53,7 @@ *> *> S*x = w*P*x, (y**H)*S = w*(y**H)*P, *> -*> where y**H denotes the conjugate tranpose of y. +*> where y**H denotes the conjugate transpose of y. *> The eigenvalues are not input to this routine, but are computed *> directly from the diagonal elements of S and P. *> diff --git a/SRC/ztgsy2.f b/SRC/ztgsy2.f index ee26b5e7b0..0cae8939ef 100644 --- a/SRC/ztgsy2.f +++ b/SRC/ztgsy2.f @@ -57,7 +57,7 @@ *> Z = [ kron(In, A) -kron(B**H, Im) ] (2) *> [ kron(In, D) -kron(E**H, Im) ], *> -*> Ik is the identity matrix of size k and X**H is the conjuguate transpose of X. +*> Ik is the identity matrix of size k and X**H is the conjugate transpose of X. *> kron(X, Y) is the Kronecker product between the matrices X and Y. *> *> If TRANS = 'C', y in the conjugate transposed system Z**H*y = scale*b diff --git a/TESTING/EIG/cdrgvx.f b/TESTING/EIG/cdrgvx.f index 830a39d869..4114b697f0 100644 --- a/TESTING/EIG/cdrgvx.f +++ b/TESTING/EIG/cdrgvx.f @@ -56,7 +56,7 @@ *> *> | l**H * (beta A - alpha B) | / ( ulp max( |beta A|, |alpha B| ) ) *> -*> where l**H is the conjugate tranpose of l. +*> where l**H is the conjugate transpose of l. *> *> (2) max over all right eigenvalue/-vector pairs (beta/alpha,r) of *> diff --git a/TESTING/EIG/ddrgvx.f b/TESTING/EIG/ddrgvx.f index c637621348..3de72eb70f 100644 --- a/TESTING/EIG/ddrgvx.f +++ b/TESTING/EIG/ddrgvx.f @@ -56,7 +56,7 @@ *> *> | l**H * (beta A - alpha B) | / ( ulp max( |beta A|, |alpha B| ) ) *> -*> where l**H is the conjugate tranpose of l. +*> where l**H is the conjugate transpose of l. *> *> (2) max over all right eigenvalue/-vector pairs (beta/alpha,r) of *> diff --git a/TESTING/EIG/sdrgvx.f b/TESTING/EIG/sdrgvx.f index f6da720ad5..91803f60a0 100644 --- a/TESTING/EIG/sdrgvx.f +++ b/TESTING/EIG/sdrgvx.f @@ -57,7 +57,7 @@ *> *> | l**H * (beta A - alpha B) | / ( ulp max( |beta A|, |alpha B| ) ) *> -*> where l**H is the conjugate tranpose of l. +*> where l**H is the conjugate transpose of l. *> *> (2) max over all right eigenvalue/-vector pairs (beta/alpha,r) of *> diff --git a/TESTING/EIG/zdrgvx.f b/TESTING/EIG/zdrgvx.f index 72e0303fbd..813151f139 100644 --- a/TESTING/EIG/zdrgvx.f +++ b/TESTING/EIG/zdrgvx.f @@ -55,7 +55,7 @@ *> *> | l**H * (beta A - alpha B) | / ( ulp max( |beta A|, |alpha B| ) ) *> -*> where l**H is the conjugate tranpose of l. +*> where l**H is the conjugate transpose of l. *> *> (2) max over all right eigenvalue/-vector pairs (beta/alpha,r) of *> diff --git a/TESTING/LIN/crzt01.f b/TESTING/LIN/crzt01.f index 6a75a8b31e..94fdcb4a92 100644 --- a/TESTING/LIN/crzt01.f +++ b/TESTING/LIN/crzt01.f @@ -158,7 +158,7 @@ REAL FUNCTION CRZT01( M, N, A, AF, LDA, TAU, WORK, * * R = R * P(1) * ... *P(m) * - CALL CUNMRZ( 'Right', 'No tranpose', M, N, M, N-M, AF, LDA, TAU, + CALL CUNMRZ( 'Right', 'No transpose', M, N, M, N-M, AF, LDA, TAU, $ WORK, M, WORK( M*N+1 ), LWORK-M*N, INFO ) * * R = R - A diff --git a/TESTING/LIN/drzt01.f b/TESTING/LIN/drzt01.f index 8e969aba78..7a88a2c20b 100644 --- a/TESTING/LIN/drzt01.f +++ b/TESTING/LIN/drzt01.f @@ -158,7 +158,7 @@ DOUBLE PRECISION FUNCTION DRZT01( M, N, A, AF, LDA, TAU, WORK, * * R = R * P(1) * ... *P(m) * - CALL DORMRZ( 'Right', 'No tranpose', M, N, M, N-M, AF, LDA, TAU, + CALL DORMRZ( 'Right', 'No transpose', M, N, M, N-M, AF, LDA, TAU, $ WORK, M, WORK( M*N+1 ), LWORK-M*N, INFO ) * * R = R - A diff --git a/TESTING/LIN/srzt01.f b/TESTING/LIN/srzt01.f index 4478c05067..a2b8b29bad 100644 --- a/TESTING/LIN/srzt01.f +++ b/TESTING/LIN/srzt01.f @@ -158,7 +158,7 @@ REAL FUNCTION SRZT01( M, N, A, AF, LDA, TAU, WORK, * * R = R * P(1) * ... *P(m) * - CALL SORMRZ( 'Right', 'No tranpose', M, N, M, N-M, AF, LDA, TAU, + CALL SORMRZ( 'Right', 'No transpose', M, N, M, N-M, AF, LDA, TAU, $ WORK, M, WORK( M*N+1 ), LWORK-M*N, INFO ) * * R = R - A diff --git a/TESTING/LIN/zrzt01.f b/TESTING/LIN/zrzt01.f index 2eba7ba6f3..b6e4d73f9a 100644 --- a/TESTING/LIN/zrzt01.f +++ b/TESTING/LIN/zrzt01.f @@ -159,7 +159,7 @@ DOUBLE PRECISION FUNCTION ZRZT01( M, N, A, AF, LDA, TAU, WORK, * * R = R * P(1) * ... *P(m) * - CALL ZUNMRZ( 'Right', 'No tranpose', M, N, M, N-M, AF, LDA, TAU, + CALL ZUNMRZ( 'Right', 'No transpose', M, N, M, N-M, AF, LDA, TAU, $ WORK, M, WORK( M*N+1 ), LWORK-M*N, INFO ) * * R = R - A