--- rpl/lapack/lapack/dsyconvf_rook.f	2017/06/17 11:02:50	1.1
+++ rpl/lapack/lapack/dsyconvf_rook.f	2023/08/07 08:39:08	1.6
@@ -18,7 +18,7 @@
 *  Definition:
 *  ===========
 *
-*       SUBROUTINE DSYCONVF_ROOK( UPLO, WAY, N, A, LDA, IPIV, E, INFO )
+*       SUBROUTINE DSYCONVF_ROOK( UPLO, WAY, N, A, LDA, E, IPIV, INFO )
 *
 *       .. Scalar Arguments ..
 *       CHARACTER          UPLO, WAY
@@ -44,7 +44,7 @@
 *> If parameter WAY = 'R':
 *> DSYCONVF_ROOK performs the conversion in reverse direction, i.e.
 *> converts the factorization output format used in DSYTRF_RK
-*> (or DSYTRF_BK) provided on entry in parametes A and E into
+*> (or DSYTRF_BK) provided on entry in parameters A and E into
 *> the factorization output format used in DSYTRF_ROOK that is stored
 *> on exit in parameter A. IPIV format for DSYTRF_ROOK and
 *> DSYTRF_RK (or DSYTRF_BK) is the same and is not converted.
@@ -180,8 +180,6 @@
 *> \author Univ. of Colorado Denver
 *> \author NAG Ltd.
 *
-*> \date December 2016
-*
 *> \ingroup doubleSYcomputational
 *
 *> \par Contributors:
@@ -189,7 +187,7 @@
 *>
 *> \verbatim
 *>
-*>  December 2016,  Igor Kozachenko,
+*>  November 2017,  Igor Kozachenko,
 *>                  Computer Science Division,
 *>                  University of California, Berkeley
 *>
@@ -197,10 +195,9 @@
 *  =====================================================================
       SUBROUTINE DSYCONVF_ROOK( UPLO, WAY, N, A, LDA, E, IPIV, INFO )
 *
-*  -- LAPACK computational routine (version 3.7.0) --
+*  -- LAPACK computational routine --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
-*     December 2016
 *
 *     .. Scalar Arguments ..
       CHARACTER          UPLO, WAY
@@ -282,7 +279,7 @@
 *
 *           Convert PERMUTATIONS
 *
-*           Apply permutaions to submatrices of upper part of A
+*           Apply permutations to submatrices of upper part of A
 *           in factorization order where i decreases from N to 1
 *
             I = N
@@ -333,7 +330,7 @@
 *
 *           Revert PERMUTATIONS
 *
-*           Apply permutaions to submatrices of upper part of A
+*           Apply permutations to submatrices of upper part of A
 *           in reverse factorization order where i increases from 1 to N
 *
             I = 1
@@ -423,7 +420,7 @@
 *
 *           Convert PERMUTATIONS
 *
-*           Apply permutaions to submatrices of lower part of A
+*           Apply permutations to submatrices of lower part of A
 *           in factorization order where i increases from 1 to N
 *
             I = 1
@@ -474,7 +471,7 @@
 *
 *           Revert PERMUTATIONS
 *
-*           Apply permutaions to submatrices of lower part of A
+*           Apply permutations to submatrices of lower part of A
 *           in reverse factorization order where i decreases from N to 1
 *
             I = N