summaryrefslogtreecommitdiff
path: root/numpy/linalg/lapack_lite/dlapack_lite.c
diff options
context:
space:
mode:
Diffstat (limited to 'numpy/linalg/lapack_lite/dlapack_lite.c')
-rw-r--r--numpy/linalg/lapack_lite/dlapack_lite.c6
1 files changed, 3 insertions, 3 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