Description: Fix various typos

Author: Sébastien Villemot <sebastien@debian.org>
Forwarded: yes, by email to lapack@cs.utk.edu on 2016-06-26

16 files changed, 22 insertions, 22 deletions

diff --git a/SRC/cgejsv.f b/SRC/cgejsv.f
index bee18fdf..459e1f42 100644
--- 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
diff --git a/SRC/cgelsd.f b/SRC/cgelsd.f
index 38da3093..3dc322b9 100644
--- 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
diff --git a/SRC/ctprfb.f b/SRC/ctprfb.f
index 77b376f3..fea50f94 100644
--- 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
diff --git a/SRC/dgejsv.f b/SRC/dgejsv.f
index fc91ab51..4f3143c7 100644
--- 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
diff --git a/SRC/dgelsd.f b/SRC/dgelsd.f
index 7629071f..53e77417 100644
--- 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
diff --git a/SRC/dlag2s.f b/SRC/dlag2s.f
index 3cf27db2..2bace1f7 100644
--- 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
diff --git a/SRC/dlat2s.f b/SRC/dlat2s.f
index 63f106ad..57613c0d 100644
--- 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
diff --git a/SRC/dtprfb.f b/SRC/dtprfb.f
index 08976d06..409cbf2f 100644
--- 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
diff --git a/SRC/sgejsv.f b/SRC/sgejsv.f
index 7d80d4ec..a89d5dae 100644
--- 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
diff --git a/SRC/sgelsd.f b/SRC/sgelsd.f
index d03f37b3..844b6cda 100644
--- 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
diff --git a/SRC/stprfb.f b/SRC/stprfb.f
index 01383aeb..4ae3f0b0 100644
--- 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
diff --git a/SRC/zgejsv.f b/SRC/zgejsv.f
index ad47a407..15bbab07 100644
--- 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
diff --git a/SRC/zgelsd.f b/SRC/zgelsd.f
index aeaa96ed..81731760 100644
--- 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
diff --git a/SRC/zlag2c.f b/SRC/zlag2c.f
index a8c1ce1f..7ff69d02 100644
--- 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
diff --git a/SRC/zlat2c.f b/SRC/zlat2c.f
index 8b9af860..7d60c125 100644
--- 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/SRC/ztprfb.f b/SRC/ztprfb.f
index 6e452bb6..c46c2ef2 100644
--- 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