summaryrefslogtreecommitdiff
path: root/numpy/linalg/lapack_lite
diff options
context:
space:
mode:
authorDongjoon Hyun <dongjoon@apache.org>2016-01-27 15:42:42 -0800
committerDongjoon Hyun <dongjoon@apache.org>2016-01-27 21:14:48 -0800
commit73a2fd11a74eedb97201fc8d54ea193e810ea9d3 (patch)
treea1ebf45fcdc82a939bedc61bde2e6a2836fae453 /numpy/linalg/lapack_lite
parent2b34f4bf652189e0415d5bf48ef7aa3294302871 (diff)
downloadnumpy-73a2fd11a74eedb97201fc8d54ea193e810ea9d3.tar.gz
MAINT: Fix some typos in a code string and comments
Diffstat (limited to 'numpy/linalg/lapack_lite')
-rw-r--r--numpy/linalg/lapack_lite/dlapack_lite.c6
-rw-r--r--numpy/linalg/lapack_lite/zlapack_lite.c2
2 files changed, 4 insertions, 4 deletions
diff --git a/numpy/linalg/lapack_lite/dlapack_lite.c b/numpy/linalg/lapack_lite/dlapack_lite.c
index 6b65397bd..9f864d7ce 100644
--- a/numpy/linalg/lapack_lite/dlapack_lite.c
+++ b/numpy/linalg/lapack_lite/dlapack_lite.c
@@ -22678,7 +22678,7 @@ L160:
===============
The algorithm used in this program is basically backward (forward)
- substitution, with scaling to make the the code robust against
+ substitution, with scaling to make the code robust against
possible overflow.
Each eigenvector is normalized so that the element of largest
@@ -61663,7 +61663,7 @@ L180:
===============
The algorithm used in this program is basically backward (forward)
- substitution, with scaling to make the the code robust against
+ substitution, with scaling to make the code robust against
possible overflow.
Each eigenvector is normalized so that the element of largest
@@ -99417,7 +99417,7 @@ L180:
===============
The algorithm used in this program is basically backward (forward)
- substitution, with scaling to make the the code robust against
+ substitution, with scaling to make the code robust against
possible overflow.
Each eigenvector is normalized so that the element of largest
diff --git a/numpy/linalg/lapack_lite/zlapack_lite.c b/numpy/linalg/lapack_lite/zlapack_lite.c
index e6b03429b..9ce05ec1f 100644
--- a/numpy/linalg/lapack_lite/zlapack_lite.c
+++ b/numpy/linalg/lapack_lite/zlapack_lite.c
@@ -22760,7 +22760,7 @@ L160:
===============
The algorithm used in this program is basically backward (forward)
- substitution, with scaling to make the the code robust against
+ substitution, with scaling to make the code robust against
possible overflow.
Each eigenvector is normalized so that the element of largest