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