Skip to content

Commit a461082

Browse files
committed
make superscript show up correctly in doc
1 parent 861ec48 commit a461082

File tree

1 file changed

+3
-3
lines changed
  • mllib/src/main/scala/org/apache/spark/mllib/linalg/distributed

1 file changed

+3
-3
lines changed

mllib/src/main/scala/org/apache/spark/mllib/linalg/distributed/RowMatrix.scala

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -254,12 +254,12 @@ class RowMatrix(
254254
* We assume n is smaller than m. The singular values and the right singular vectors are derived
255255
* from the eigenvalues and the eigenvectors of the Gramian matrix A' * A. U, the matrix
256256
* storing the right singular vectors, is computed via matrix multiplication as
257-
* U = A * (V * S^{-1}), if requested by user. The actual method to use is determined
257+
* U = A * (V * S^-1^), if requested by user. The actual method to use is determined
258258
* automatically based on the cost:
259259
* - If n is small (n < 100) or k is large compared with n (k > n / 2), we compute the Gramian
260260
* matrix first and then compute its top eigenvalues and eigenvectors locally on the driver.
261-
* This requires a single pass with O(n^2) storage on each executor and on the driver, and
262-
* O(n^2 k) time on the driver.
261+
* This requires a single pass with O(n^2^) storage on each executor and on the driver, and
262+
* O(n^2^ k) time on the driver.
263263
* - Otherwise, we compute (A' * A) * v in a distributive way and send it to ARPACK's DSAUPD to
264264
* compute (A' * A)'s top eigenvalues and eigenvectors on the driver node. This requires O(k)
265265
* passes, O(n) storage on each executor, and O(n k) storage on the driver.

0 commit comments

Comments
 (0)