diff --git a/doc/pub/Regression/html/._Regression-bs042.html b/doc/pub/Regression/html/._Regression-bs042.html index 5aed6efbe..525941a4c 100644 --- a/doc/pub/Regression/html/._Regression-bs042.html +++ b/doc/pub/Regression/html/._Regression-bs042.html @@ -407,9 +407,14 @@ MathJax.Hub.Config({ numpy and scipy.linalg at the cost of being slower. ''' U, s, VT = np.linalg.svd(A) +# print('test U') +# print( (np.transpose(U) @ U - U @np.transpose(U))) +# print('test VT') +# print( (np.transpose(VT) @ VT - VT @np.transpose(VT))) print(U) print(s) print(VT) + D = np.zeros((len(U),len(VT))) for i in range(0,len(VT)): D[i,i]=s[i] diff --git a/doc/pub/Regression/html/._Regression-bs044.html b/doc/pub/Regression/html/._Regression-bs044.html index 932067660..3f96d2e2e 100644 --- a/doc/pub/Regression/html/._Regression-bs044.html +++ b/doc/pub/Regression/html/._Regression-bs044.html @@ -409,7 +409,7 @@ with \( \boldsymbol{U}\in {\mathbb{R}}^{n\times n} \), \( \boldsymbol{\Sigma}\in and \( \boldsymbol{V}\in {\mathbb{R}}^{p\times p} \).
-We have \( \boldsymbol{U}^T\boldsymbol{U}=\boldsymbol{I} \) and \( \boldsymbol{V}^T\boldsymbol{V}=\boldsymbol{V}\boldsymbol{V}^T=\boldsymbol{I} \). +The matrices \( \boldsymbol{U} \) and \( \boldsymbol{V} \) are unitary/orthonormal matrices, that is in case the matrices are real we have \( \boldsymbol{U}^T\boldsymbol{U}=\boldsymbol{U}\boldsymbol{U}^T=\boldsymbol{I} \) and \( \boldsymbol{V}^T\boldsymbol{V}=\boldsymbol{V}\boldsymbol{V}^T=\boldsymbol{I} \).
diff --git a/doc/pub/Regression/html/Regression-reveal.html b/doc/pub/Regression/html/Regression-reveal.html
index fb956bca5..8d6fb0c6d 100644
--- a/doc/pub/Regression/html/Regression-reveal.html
+++ b/doc/pub/Regression/html/Regression-reveal.html
@@ -2035,9 +2035,14 @@ Similarly, Mehta et a
numpy and scipy.linalg at the cost of being slower.
'''
U, s, VT = np.linalg.svd(A)
+# print('test U')
+# print( (np.transpose(U) @ U - U @np.transpose(U)))
+# print('test VT')
+# print( (np.transpose(VT) @ VT - VT @np.transpose(VT)))
print(U)
print(s)
print(VT)
+
D = np.zeros((len(U),len(VT)))
for i in range(0,len(VT)):
D[i,i]=s[i]
@@ -2104,7 +2109,7 @@ with \( \boldsymbol{U}\in {\mathbb{R}}^{n\times n} \), \( \boldsymbol{\Sigma}\in
and \( \boldsymbol{V}\in {\mathbb{R}}^{p\times p} \).
-We have \( \boldsymbol{U}^T\boldsymbol{U}=\boldsymbol{I} \) and \( \boldsymbol{V}^T\boldsymbol{V}=\boldsymbol{V}\boldsymbol{V}^T=\boldsymbol{I} \).
+The matrices \( \boldsymbol{U} \) and \( \boldsymbol{V} \) are unitary/orthonormal matrices, that is in case the matrices are real we have \( \boldsymbol{U}^T\boldsymbol{U}=\boldsymbol{U}\boldsymbol{U}^T=\boldsymbol{I} \) and \( \boldsymbol{V}^T\boldsymbol{V}=\boldsymbol{V}\boldsymbol{V}^T=\boldsymbol{I} \).
diff --git a/doc/pub/Regression/html/Regression-solarized.html b/doc/pub/Regression/html/Regression-solarized.html
index 5f4d11cdd..76339995a 100644
--- a/doc/pub/Regression/html/Regression-solarized.html
+++ b/doc/pub/Regression/html/Regression-solarized.html
@@ -2039,9 +2039,14 @@ Similarly, Mehta et a
numpy and scipy.linalg at the cost of being slower.
'''
U, s, VT = np.linalg.svd(A)
+# print('test U')
+# print( (np.transpose(U) @ U - U @np.transpose(U)))
+# print('test VT')
+# print( (np.transpose(VT) @ VT - VT @np.transpose(VT)))
print(U)
print(s)
print(VT)
+
D = np.zeros((len(U),len(VT)))
for i in range(0,len(VT)):
D[i,i]=s[i]
@@ -2106,7 +2111,7 @@ with \( \boldsymbol{U}\in {\mathbb{R}}^{n\times n} \), \( \boldsymbol{\Sigma}\in
and \( \boldsymbol{V}\in {\mathbb{R}}^{p\times p} \).
-We have \( \boldsymbol{U}^T\boldsymbol{U}=\boldsymbol{I} \) and \( \boldsymbol{V}^T\boldsymbol{V}=\boldsymbol{V}\boldsymbol{V}^T=\boldsymbol{I} \).
+The matrices \( \boldsymbol{U} \) and \( \boldsymbol{V} \) are unitary/orthonormal matrices, that is in case the matrices are real we have \( \boldsymbol{U}^T\boldsymbol{U}=\boldsymbol{U}\boldsymbol{U}^T=\boldsymbol{I} \) and \( \boldsymbol{V}^T\boldsymbol{V}=\boldsymbol{V}\boldsymbol{V}^T=\boldsymbol{I} \).