[lapack] 08/10: Reintroduce new patch for fixing typos newly detected.
Sébastien Villemot
sebastien at debian.org
Sun Jun 26 18:21:37 UTC 2016
This is an automated email from the git hooks/post-receive script.
sebastien pushed a commit to branch master
in repository lapack.
commit 1d1b07216d0e72523e7e9ffc303411706450693b
Author: Sébastien Villemot <sebastien at debian.org>
Date: Sun Jun 26 15:44:37 2016 +0200
Reintroduce new patch for fixing typos newly detected.
---
debian/patches/fix-typos.patch | 705 +++++++++++++++++++++++++++++++++++++++++
debian/patches/series | 1 +
2 files changed, 706 insertions(+)
diff --git a/debian/patches/fix-typos.patch b/debian/patches/fix-typos.patch
new file mode 100644
index 0000000..3d6019f
--- /dev/null
+++ b/debian/patches/fix-typos.patch
@@ -0,0 +1,705 @@
+Description: Fix various typos
+Author: Sébastien Villemot <sebastien at debian.org>
+Forwarded: yes, by email to lapack at cs.utk.edu on 2016-06-26
+Last-Update: 2016-06-26
+----
+This patch header follows DEP-3: http://dep.debian.net/deps/dep3/
+--- a/SRC/zlag2c.f
++++ b/SRC/zlag2c.f
+@@ -38,7 +38,7 @@
+ *>
+ *> RMAX is the overflow for the SINGLE PRECISION arithmetic
+ *> ZLAG2C checks that all the entries of A are between -RMAX and
+-*> RMAX. If not the convertion is aborted and a flag is raised.
++*> RMAX. If not the conversion is aborted and a flag is raised.
+ *>
+ *> This is an auxiliary routine so there is no argument checking.
+ *> \endverbatim
+--- a/TESTING/LIN/cchkrfp.f
++++ b/TESTING/LIN/cchkrfp.f
+@@ -253,7 +253,7 @@
+ CALL CDRVRF1( NOUT, NN, NVAL, THRESH, WORKA, NMAX, WORKARF,
+ + S_WORK_CLANHE )
+ *
+-* Test the convertion routines:
++* Test the conversion routines:
+ * chfttp, ctpthf, ctfttr, ctrttf, ctrttp and ctpttr.
+ *
+ CALL CDRVRF2( NOUT, NN, NVAL, WORKA, NMAX, WORKARF,
+--- a/TESTING/LIN/cdrvrf2.f
++++ b/TESTING/LIN/cdrvrf2.f
+@@ -24,7 +24,7 @@
+ *>
+ *> \verbatim
+ *>
+-*> CDRVRF2 tests the LAPACK RFP convertion routines.
++*> CDRVRF2 tests the LAPACK RFP conversion routines.
+ *> \endverbatim
+ *
+ * Arguments:
+@@ -248,13 +248,13 @@
+ WRITE( NOUT, FMT = 9996 ) NERRS, NRUN
+ END IF
+ *
+- 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP convertion',
++ 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP conversion',
+ + ' routines ***')
+- 9998 FORMAT( 1X, ' Error in RFP,convertion routines N=',I5,
++ 9998 FORMAT( 1X, ' Error in RFP,conversion routines N=',I5,
+ + ' UPLO=''', A1, ''', FORM =''',A1,'''')
+- 9997 FORMAT( 1X, 'All tests for the RFP convertion routines passed ( ',
++ 9997 FORMAT( 1X, 'All tests for the RFP conversion routines passed ( ',
+ + I5,' tests run)')
+- 9996 FORMAT( 1X, 'RFP convertion routines: ',I5,' out of ',I5,
++ 9996 FORMAT( 1X, 'RFP conversion routines: ',I5,' out of ',I5,
+ + ' error message recorded')
+ *
+ RETURN
+--- a/TESTING/LIN/cdrvrfp.f
++++ b/TESTING/LIN/cdrvrfp.f
+@@ -53,7 +53,7 @@
+ *> This testing routine follow the same tests as CDRVPO (test for the full
+ *> format Symmetric Positive Definite solver).
+ *>
+-*> The tests are performed in Full Format, convertion back and forth from
++*> The tests are performed in Full Format, conversion back and forth from
+ *> full format to RFP format are performed using the routines CTRTTF and
+ *> CTFTTR.
+ *>
+--- a/TESTING/LIN/dchkrfp.f
++++ b/TESTING/LIN/dchkrfp.f
+@@ -252,7 +252,7 @@
+ CALL DDRVRF1( NOUT, NN, NVAL, THRESH, WORKA, NMAX, WORKARF,
+ + D_WORK_DLANSY )
+ *
+-* Test the convertion routines:
++* Test the conversion routines:
+ * dtfttp, dtpttf, dtfttr, dtrttf, dtrttp and dtpttr.
+ *
+ CALL DDRVRF2( NOUT, NN, NVAL, WORKA, NMAX, WORKARF,
+--- a/TESTING/LIN/ddrvrf2.f
++++ b/TESTING/LIN/ddrvrf2.f
+@@ -24,7 +24,7 @@
+ *>
+ *> \verbatim
+ *>
+-*> DDRVRF2 tests the LAPACK RFP convertion routines.
++*> DDRVRF2 tests the LAPACK RFP conversion routines.
+ *> \endverbatim
+ *
+ * Arguments:
+@@ -248,13 +248,13 @@
+ WRITE( NOUT, FMT = 9996 ) NERRS, NRUN
+ END IF
+ *
+- 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP convertion',
++ 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP conversion',
+ + ' routines ***')
+- 9998 FORMAT( 1X, ' Error in RFP,convertion routines N=',I5,
++ 9998 FORMAT( 1X, ' Error in RFP,conversion routines N=',I5,
+ + ' UPLO=''', A1, ''', FORM =''',A1,'''')
+- 9997 FORMAT( 1X, 'All tests for the RFP convertion routines passed ( ',
++ 9997 FORMAT( 1X, 'All tests for the RFP conversion routines passed ( ',
+ + I5,' tests run)')
+- 9996 FORMAT( 1X, 'RFP convertion routines: ',I5,' out of ',I5,
++ 9996 FORMAT( 1X, 'RFP conversion routines: ',I5,' out of ',I5,
+ + ' error message recorded')
+ *
+ RETURN
+--- a/TESTING/LIN/ddrvrfp.f
++++ b/TESTING/LIN/ddrvrfp.f
+@@ -52,7 +52,7 @@
+ *> This testing routine follow the same tests as DDRVPO (test for the full
+ *> format Symmetric Positive Definite solver).
+ *>
+-*> The tests are performed in Full Format, convertion back and forth from
++*> The tests are performed in Full Format, conversion back and forth from
+ *> full format to RFP format are performed using the routines DTRTTF and
+ *> DTFTTR.
+ *>
+--- a/TESTING/LIN/schkrfp.f
++++ b/TESTING/LIN/schkrfp.f
+@@ -251,7 +251,7 @@
+ CALL SDRVRF1( NOUT, NN, NVAL, THRESH, WORKA, NMAX, WORKARF,
+ + S_WORK_SLANSY )
+ *
+-* Test the convertion routines:
++* Test the conversion routines:
+ * stfttp, stpttf, stfttr, strttf, strttp and stpttr.
+ *
+ CALL SDRVRF2( NOUT, NN, NVAL, WORKA, NMAX, WORKARF,
+--- a/TESTING/LIN/sdrvrf2.f
++++ b/TESTING/LIN/sdrvrf2.f
+@@ -24,7 +24,7 @@
+ *>
+ *> \verbatim
+ *>
+-*> SDRVRF2 tests the LAPACK RFP convertion routines.
++*> SDRVRF2 tests the LAPACK RFP conversion routines.
+ *> \endverbatim
+ *
+ * Arguments:
+@@ -248,13 +248,13 @@
+ WRITE( NOUT, FMT = 9996 ) NERRS, NRUN
+ END IF
+ *
+- 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP convertion',
++ 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP conversion',
+ + ' routines ***')
+- 9998 FORMAT( 1X, ' Error in RFP,convertion routines N=',I5,
++ 9998 FORMAT( 1X, ' Error in RFP,conversion routines N=',I5,
+ + ' UPLO=''', A1, ''', FORM =''',A1,'''')
+- 9997 FORMAT( 1X, 'All tests for the RFP convertion routines passed ( ',
++ 9997 FORMAT( 1X, 'All tests for the RFP conversion routines passed ( ',
+ + I5,' tests run)')
+- 9996 FORMAT( 1X, 'RFP convertion routines: ',I5,' out of ',I5,
++ 9996 FORMAT( 1X, 'RFP conversion routines: ',I5,' out of ',I5,
+ + ' error message recorded')
+ *
+ RETURN
+--- a/TESTING/LIN/sdrvrfp.f
++++ b/TESTING/LIN/sdrvrfp.f
+@@ -52,7 +52,7 @@
+ *> This testing routine follow the same tests as DDRVPO (test for the full
+ *> format Symmetric Positive Definite solver).
+ *>
+-*> The tests are performed in Full Format, convertion back and forth from
++*> The tests are performed in Full Format, conversion back and forth from
+ *> full format to RFP format are performed using the routines STRTTF and
+ *> STFTTR.
+ *>
+--- a/TESTING/LIN/zchkrfp.f
++++ b/TESTING/LIN/zchkrfp.f
+@@ -253,7 +253,7 @@
+ CALL ZDRVRF1( NOUT, NN, NVAL, THRESH, WORKA, NMAX, WORKARF,
+ + D_WORK_ZLANHE )
+ *
+-* Test the convertion routines:
++* Test the conversion routines:
+ * zhfttp, ztpthf, ztfttr, ztrttf, ztrttp and ztpttr.
+ *
+ CALL ZDRVRF2( NOUT, NN, NVAL, WORKA, NMAX, WORKARF,
+--- a/TESTING/LIN/zdrvrf2.f
++++ b/TESTING/LIN/zdrvrf2.f
+@@ -24,7 +24,7 @@
+ *>
+ *> \verbatim
+ *>
+-*> ZDRVRF2 tests the LAPACK RFP convertion routines.
++*> ZDRVRF2 tests the LAPACK RFP conversion routines.
+ *> \endverbatim
+ *
+ * Arguments:
+@@ -248,13 +248,13 @@
+ WRITE( NOUT, FMT = 9996 ) NERRS, NRUN
+ END IF
+ *
+- 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP convertion',
++ 9999 FORMAT( 1X, ' *** Error(s) while testing the RFP conversion',
+ + ' routines ***')
+- 9998 FORMAT( 1X, ' Error in RFP,convertion routines N=',I5,
++ 9998 FORMAT( 1X, ' Error in RFP,conversion routines N=',I5,
+ + ' UPLO=''', A1, ''', FORM =''',A1,'''')
+- 9997 FORMAT( 1X, 'All tests for the RFP convertion routines passed (',
++ 9997 FORMAT( 1X, 'All tests for the RFP conversion routines passed (',
+ + I5,' tests run)')
+- 9996 FORMAT( 1X, 'RFP convertion routines:',I5,' out of ',I5,
++ 9996 FORMAT( 1X, 'RFP conversion routines:',I5,' out of ',I5,
+ + ' error message recorded')
+ *
+ RETURN
+--- a/TESTING/LIN/zdrvrfp.f
++++ b/TESTING/LIN/zdrvrfp.f
+@@ -53,7 +53,7 @@
+ *> This testing routine follow the same tests as ZDRVPO (test for the full
+ *> format Symmetric Positive Definite solver).
+ *>
+-*> The tests are performed in Full Format, convertion back and forth from
++*> The tests are performed in Full Format, conversion back and forth from
+ *> full format to RFP format are performed using the routines ZTRTTF and
+ *> ZTFTTR.
+ *>
+--- a/BLAS/SRC/ctbmv.f
++++ b/BLAS/SRC/ctbmv.f
+@@ -146,7 +146,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/ctpmv.f
++++ b/BLAS/SRC/ctpmv.f
+@@ -102,7 +102,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/ctrmv.f
++++ b/BLAS/SRC/ctrmv.f
+@@ -107,7 +107,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/dtbmv.f
++++ b/BLAS/SRC/dtbmv.f
+@@ -146,7 +146,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/dtpmv.f
++++ b/BLAS/SRC/dtpmv.f
+@@ -102,7 +102,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/dtrmv.f
++++ b/BLAS/SRC/dtrmv.f
+@@ -107,7 +107,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/stbmv.f
++++ b/BLAS/SRC/stbmv.f
+@@ -146,7 +146,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/stpmv.f
++++ b/BLAS/SRC/stpmv.f
+@@ -102,7 +102,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/strmv.f
++++ b/BLAS/SRC/strmv.f
+@@ -107,7 +107,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/ztbmv.f
++++ b/BLAS/SRC/ztbmv.f
+@@ -146,7 +146,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/ztpmv.f
++++ b/BLAS/SRC/ztpmv.f
+@@ -102,7 +102,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/BLAS/SRC/ztrmv.f
++++ b/BLAS/SRC/ztrmv.f
+@@ -107,7 +107,7 @@
+ *> ( 1 + ( n - 1 )*abs( INCX ) ).
+ *> Before entry, the incremented array X must contain the n
+ *> element vector x. On exit, X is overwritten with the
+-*> tranformed vector x.
++*> transformed vector x.
+ *> \endverbatim
+ *>
+ *> \param[in] INCX
+--- a/SRC/cgelsd.f
++++ b/SRC/cgelsd.f
+@@ -50,10 +50,10 @@
+ *>
+ *> The problem is solved in three steps:
+ *> (1) Reduce the coefficient matrix A to bidiagonal form with
+-*> Householder tranformations, reducing the original problem
++*> Householder transformations, reducing the original problem
+ *> into a "bidiagonal least squares problem" (BLS)
+ *> (2) Solve the BLS using a divide and conquer approach.
+-*> (3) Apply back all the Householder tranformations to solve
++*> (3) Apply back all the Householder transformations to solve
+ *> the original least squares problem.
+ *>
+ *> The effective rank of A is determined by treating as zero those
+--- a/SRC/dgelsd.f
++++ b/SRC/dgelsd.f
+@@ -52,7 +52,7 @@
+ *> Householder transformations, reducing the original problem
+ *> into a "bidiagonal least squares problem" (BLS)
+ *> (2) Solve the BLS using a divide and conquer approach.
+-*> (3) Apply back all the Householder tranformations to solve
++*> (3) Apply back all the Householder transformations to solve
+ *> the original least squares problem.
+ *>
+ *> The effective rank of A is determined by treating as zero those
+--- a/SRC/sgelsd.f
++++ b/SRC/sgelsd.f
+@@ -52,7 +52,7 @@
+ *> Householder transformations, reducing the original problem
+ *> into a "bidiagonal least squares problem" (BLS)
+ *> (2) Solve the BLS using a divide and conquer approach.
+-*> (3) Apply back all the Householder tranformations to solve
++*> (3) Apply back all the Householder transformations to solve
+ *> the original least squares problem.
+ *>
+ *> The effective rank of A is determined by treating as zero those
+--- a/SRC/zgelsd.f
++++ b/SRC/zgelsd.f
+@@ -50,10 +50,10 @@
+ *>
+ *> The problem is solved in three steps:
+ *> (1) Reduce the coefficient matrix A to bidiagonal form with
+-*> Householder tranformations, reducing the original problem
++*> Householder transformations, reducing the original problem
+ *> into a "bidiagonal least squares problem" (BLS)
+ *> (2) Solve the BLS using a divide and conquer approach.
+-*> (3) Apply back all the Householder tranformations to solve
++*> (3) Apply back all the Householder transformations to solve
+ *> the original least squares problem.
+ *>
+ *> The effective rank of A is determined by treating as zero those
+--- a/SRC/cgejsv.f
++++ b/SRC/cgejsv.f
+@@ -420,7 +420,7 @@
+ *> \verbatim
+ *> INFO is INTEGER
+ *> < 0 : if INFO = -i, then the i-th argument had an illegal value.
+-*> = 0 : successfull exit;
++*> = 0 : successful exit;
+ *> > 0 : CGEJSV did not converge in the maximal allowed number
+ *> of sweeps. The computed values may be inaccurate.
+ *> \endverbatim
+@@ -471,7 +471,7 @@
+ *> implemented as in [3]. We have a new version of CGEQP3 under development
+ *> that is more robust than the current one in LAPACK, with a cleaner cut in
+ *> rank defficient cases. It will be available in the SIGMA library [4].
+-*> If M is much larger than N, it is obvious that the inital QRF with
++*> If M is much larger than N, it is obvious that the initial QRF with
+ *> column pivoting can be preprocessed by the QRF without pivoting. That
+ *> well known trick is not used in CGEJSV because in some cases heavy row
+ *> weighting can be treated with complete pivoting. The overhead in cases
+--- a/SRC/ctprfb.f
++++ b/SRC/ctprfb.f
+@@ -145,7 +145,7 @@
+ *> (LDA,N) if SIDE = 'L' or (LDA,K) if SIDE = 'R'
+ *> On entry, the K-by-N or M-by-K matrix A.
+ *> On exit, A is overwritten by the corresponding block of
+-*> H*C or H**H*C or C*H or C*H**H. See Futher Details.
++*> H*C or H**H*C or C*H or C*H**H. See Further Details.
+ *> \endverbatim
+ *>
+ *> \param[in] LDA
+--- a/SRC/dgejsv.f
++++ b/SRC/dgejsv.f
+@@ -378,7 +378,7 @@
+ *> \verbatim
+ *> INFO is INTEGER
+ *> < 0 : if INFO = -i, then the i-th argument had an illegal value.
+-*> = 0 : successfull exit;
++*> = 0 : successful exit;
+ *> > 0 : DGEJSV did not converge in the maximal allowed number
+ *> of sweeps. The computed values may be inaccurate.
+ *> \endverbatim
+@@ -429,7 +429,7 @@
+ *> implemented as in [3]. We have a new version of DGEQP3 under development
+ *> that is more robust than the current one in LAPACK, with a cleaner cut in
+ *> rank defficient cases. It will be available in the SIGMA library [4].
+-*> If M is much larger than N, it is obvious that the inital QRF with
++*> If M is much larger than N, it is obvious that the initial QRF with
+ *> column pivoting can be preprocessed by the QRF without pivoting. That
+ *> well known trick is not used in DGEJSV because in some cases heavy row
+ *> weighting can be treated with complete pivoting. The overhead in cases
+--- a/SRC/dtprfb.f
++++ b/SRC/dtprfb.f
+@@ -145,7 +145,7 @@
+ *> (LDA,N) if SIDE = 'L' or (LDA,K) if SIDE = 'R'
+ *> On entry, the K-by-N or M-by-K matrix A.
+ *> On exit, A is overwritten by the corresponding block of
+-*> H*C or H**T*C or C*H or C*H**T. See Futher Details.
++*> H*C or H**T*C or C*H or C*H**T. See Further Details.
+ *> \endverbatim
+ *>
+ *> \param[in] LDA
+--- a/SRC/sgejsv.f
++++ b/SRC/sgejsv.f
+@@ -378,7 +378,7 @@
+ *> \verbatim
+ *> INFO is INTEGER
+ *> < 0 : if INFO = -i, then the i-th argument had an illegal value.
+-*> = 0 : successfull exit;
++*> = 0 : successful exit;
+ *> > 0 : SGEJSV did not converge in the maximal allowed number
+ *> of sweeps. The computed values may be inaccurate.
+ *> \endverbatim
+@@ -429,7 +429,7 @@
+ *> implemented as in [3]. We have a new version of SGEQP3 under development
+ *> that is more robust than the current one in LAPACK, with a cleaner cut in
+ *> rank defficient cases. It will be available in the SIGMA library [4].
+-*> If M is much larger than N, it is obvious that the inital QRF with
++*> If M is much larger than N, it is obvious that the initial QRF with
+ *> column pivoting can be preprocessed by the QRF without pivoting. That
+ *> well known trick is not used in SGEJSV because in some cases heavy row
+ *> weighting can be treated with complete pivoting. The overhead in cases
+--- a/SRC/stprfb.f
++++ b/SRC/stprfb.f
+@@ -145,7 +145,7 @@
+ *> (LDA,N) if SIDE = 'L' or (LDA,K) if SIDE = 'R'
+ *> On entry, the K-by-N or M-by-K matrix A.
+ *> On exit, A is overwritten by the corresponding block of
+-*> H*C or H^H*C or C*H or C*H^H. See Futher Details.
++*> H*C or H^H*C or C*H or C*H^H. See Further Details.
+ *> \endverbatim
+ *>
+ *> \param[in] LDA
+--- a/SRC/zgejsv.f
++++ b/SRC/zgejsv.f
+@@ -420,7 +420,7 @@
+ *> \verbatim
+ *> INFO is INTEGER
+ *> < 0 : if INFO = -i, then the i-th argument had an illegal value.
+-*> = 0 : successfull exit;
++*> = 0 : successful exit;
+ *> > 0 : ZGEJSV did not converge in the maximal allowed number
+ *> of sweeps. The computed values may be inaccurate.
+ *> \endverbatim
+@@ -471,7 +471,7 @@
+ *> implemented as in [3]. We have a new version of ZGEQP3 under development
+ *> that is more robust than the current one in LAPACK, with a cleaner cut in
+ *> rank defficient cases. It will be available in the SIGMA library [4].
+-*> If M is much larger than N, it is obvious that the inital QRF with
++*> If M is much larger than N, it is obvious that the initial QRF with
+ *> column pivoting can be preprocessed by the QRF without pivoting. That
+ *> well known trick is not used in ZGEJSV because in some cases heavy row
+ *> weighting can be treated with complete pivoting. The overhead in cases
+--- a/SRC/ztprfb.f
++++ b/SRC/ztprfb.f
+@@ -145,7 +145,7 @@
+ *> (LDA,N) if SIDE = 'L' or (LDA,K) if SIDE = 'R'
+ *> On entry, the K-by-N or M-by-K matrix A.
+ *> On exit, A is overwritten by the corresponding block of
+-*> H*C or H**H*C or C*H or C*H**H. See Futher Details.
++*> H*C or H**H*C or C*H or C*H**H. See Further Details.
+ *> \endverbatim
+ *>
+ *> \param[in] LDA
+--- a/TESTING/EIG/cchkbk.f
++++ b/TESTING/EIG/cchkbk.f
+@@ -21,7 +21,7 @@
+ *> \verbatim
+ *>
+ *> CCHKBK tests CGEBAK, a routine for backward transformation of
+-*> the computed right or left eigenvectors if the orginal matrix
++*> the computed right or left eigenvectors if the original matrix
+ *> was preprocessed by balance subroutine CGEBAL.
+ *> \endverbatim
+ *
+--- a/TESTING/EIG/dchkbk.f
++++ b/TESTING/EIG/dchkbk.f
+@@ -21,7 +21,7 @@
+ *> \verbatim
+ *>
+ *> DCHKBK tests DGEBAK, a routine for backward transformation of
+-*> the computed right or left eigenvectors if the orginal matrix
++*> the computed right or left eigenvectors if the original matrix
+ *> was preprocessed by balance subroutine DGEBAL.
+ *> \endverbatim
+ *
+--- a/TESTING/EIG/schkbk.f
++++ b/TESTING/EIG/schkbk.f
+@@ -21,7 +21,7 @@
+ *> \verbatim
+ *>
+ *> SCHKBK tests SGEBAK, a routine for backward transformation of
+-*> the computed right or left eigenvectors if the orginal matrix
++*> the computed right or left eigenvectors if the original matrix
+ *> was preprocessed by balance subroutine SGEBAL.
+ *> \endverbatim
+ *
+--- a/TESTING/EIG/zchkbk.f
++++ b/TESTING/EIG/zchkbk.f
+@@ -21,7 +21,7 @@
+ *> \verbatim
+ *>
+ *> ZCHKBK tests ZGEBAK, a routine for backward transformation of
+-*> the computed right or left eigenvectors if the orginal matrix
++*> the computed right or left eigenvectors if the original matrix
+ *> was preprocessed by balance subroutine ZGEBAL.
+ *> \endverbatim
+ *
+--- a/TESTING/MATGEN/clatm5.f
++++ b/TESTING/MATGEN/clatm5.f
+@@ -49,7 +49,7 @@
+ *> \verbatim
+ *> PRTYPE is INTEGER
+ *> "Points" to a certain type of the matrices to generate
+-*> (see futher details).
++*> (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] M
+--- a/TESTING/MATGEN/clatm6.f
++++ b/TESTING/MATGEN/clatm6.f
+@@ -71,7 +71,7 @@
+ *> \param[in] TYPE
+ *> \verbatim
+ *> TYPE is INTEGER
+-*> Specifies the problem type (see futher details).
++*> Specifies the problem type (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] N
+--- a/TESTING/MATGEN/dlatm5.f
++++ b/TESTING/MATGEN/dlatm5.f
+@@ -49,7 +49,7 @@
+ *> \verbatim
+ *> PRTYPE is INTEGER
+ *> "Points" to a certain type of the matrices to generate
+-*> (see futher details).
++*> (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] M
+--- a/TESTING/MATGEN/dlatm6.f
++++ b/TESTING/MATGEN/dlatm6.f
+@@ -73,7 +73,7 @@
+ *> \param[in] TYPE
+ *> \verbatim
+ *> TYPE is INTEGER
+-*> Specifies the problem type (see futher details).
++*> Specifies the problem type (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] N
+--- a/TESTING/MATGEN/slatm5.f
++++ b/TESTING/MATGEN/slatm5.f
+@@ -49,7 +49,7 @@
+ *> \verbatim
+ *> PRTYPE is INTEGER
+ *> "Points" to a certain type of the matrices to generate
+-*> (see futher details).
++*> (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] M
+--- a/TESTING/MATGEN/slatm6.f
++++ b/TESTING/MATGEN/slatm6.f
+@@ -73,7 +73,7 @@
+ *> \param[in] TYPE
+ *> \verbatim
+ *> TYPE is INTEGER
+-*> Specifies the problem type (see futher details).
++*> Specifies the problem type (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] N
+--- a/TESTING/MATGEN/zlatm5.f
++++ b/TESTING/MATGEN/zlatm5.f
+@@ -49,7 +49,7 @@
+ *> \verbatim
+ *> PRTYPE is INTEGER
+ *> "Points" to a certain type of the matrices to generate
+-*> (see futher details).
++*> (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] M
+--- a/TESTING/MATGEN/zlatm6.f
++++ b/TESTING/MATGEN/zlatm6.f
+@@ -71,7 +71,7 @@
+ *> \param[in] TYPE
+ *> \verbatim
+ *> TYPE is INTEGER
+-*> Specifies the problem type (see futher details).
++*> Specifies the problem type (see further details).
+ *> \endverbatim
+ *>
+ *> \param[in] N
+--- a/TESTING/MATGEN/claror.f
++++ b/TESTING/MATGEN/claror.f
+@@ -70,7 +70,7 @@
+ *> columns will be orthogonal, the remaining columns being
+ *> zero.
+ *> For matrices where M > N, just use the previous
+-*> explaination, interchanging 'L' and 'R' and "rows" and
++*> explanation, interchanging 'L' and 'R' and "rows" and
+ *> "columns".
+ *>
+ *> Not modified.
+--- a/SRC/dlag2s.f
++++ b/SRC/dlag2s.f
+@@ -39,7 +39,7 @@
+ *>
+ *> RMAX is the overflow for the SINGLE PRECISION arithmetic
+ *> DLAG2S checks that all the entries of A are between -RMAX and
+-*> RMAX. If not the convertion is aborted and a flag is raised.
++*> RMAX. If not the conversion is aborted and a flag is raised.
+ *>
+ *> This is an auxiliary routine so there is no argument checking.
+ *> \endverbatim
+--- a/SRC/dlat2s.f
++++ b/SRC/dlat2s.f
+@@ -40,7 +40,7 @@
+ *>
+ *> RMAX is the overflow for the SINGLE PRECISION arithmetic
+ *> DLAS2S checks that all the entries of A are between -RMAX and
+-*> RMAX. If not the convertion is aborted and a flag is raised.
++*> RMAX. If not the conversion is aborted and a flag is raised.
+ *>
+ *> This is an auxiliary routine so there is no argument checking.
+ *> \endverbatim
+--- a/SRC/zlat2c.f
++++ b/SRC/zlat2c.f
+@@ -40,7 +40,7 @@
+ *>
+ *> RMAX is the overflow for the SINGLE PRECISION arithmetic
+ *> ZLAT2C checks that all the entries of A are between -RMAX and
+-*> RMAX. If not the convertion is aborted and a flag is raised.
++*> RMAX. If not the conversion is aborted and a flag is raised.
+ *>
+ *> This is an auxiliary routine so there is no argument checking.
+ *> \endverbatim
diff --git a/debian/patches/series b/debian/patches/series
index fcfd422..a15d638 100644
--- a/debian/patches/series
+++ b/debian/patches/series
@@ -1,2 +1,3 @@
icamax-izamax-extended-precision.patch
doxygen-strip-source.patch
+fix-typos.patch
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/lapack.git
More information about the debian-science-commits
mailing list