svn commit: r1522746 - /mahout/trunk/math/src/main/java/org/apache/mahout/math/QRDecomposition.java

[ss...@apache.org]

Author: sslavic
Date: Thu Sep 12 22:47:47 2013
New Revision: 1522746

URL: http://svn.apache.org/r1522746
Log:
Fixed typos in comment and JavaDoc

Modified:
    mahout/trunk/math/src/main/java/org/apache/mahout/math/QRDecomposition.java

Modified: mahout/trunk/math/src/main/java/org/apache/mahout/math/QRDecomposition.java
URL: http://svn.apache.org/viewvc/mahout/trunk/math/src/main/java/org/apache/mahout/math/QRDecomposition.java?rev=1522746&r1=1522745&r2=1522746&view=diff
==============================================================================
--- mahout/trunk/math/src/main/java/org/apache/mahout/math/QRDecomposition.java (original)
+++ mahout/trunk/math/src/main/java/org/apache/mahout/math/QRDecomposition.java Thu Sep 12 22:47:47 2013
@@ -33,9 +33,9 @@ import java.util.Locale;
  orthogonal matrix <tt>Q</tt> and an <tt>n x n</tt> upper triangular matrix <tt>R</tt> so that
  <tt>A = Q*R</tt>.
  <P>
- The QR decompostion always exists, even if the matrix does not have
+ The QR decomposition always exists, even if the matrix does not have
  full rank, so the constructor will never fail.  The primary use of the
- QR decomposition is in the least squares solution of nonsquare systems
+ QR decomposition is in the least squares solution of non-square systems
  of simultaneous linear equations.  This will fail if <tt>isFullRank()</tt>
  returns <tt>false</tt>.
  */
@@ -151,7 +151,7 @@ public class QRDecomposition implements 
     Matrix x = B.like(columns, cols);
 
     // this can all be done a bit more efficiently if we don't actually
-    // form explicit versions of Q^T and R but this code isn't soo bad
+    // form explicit versions of Q^T and R but this code isn't so bad
     // and it is much easier to understand
     Matrix qt = getQ().transpose();
     Matrix y = qt.times(B);