Author: celestin
Date: Sat Sep 24 04:01:05 2011
New Revision: 1175097
URL: http://svn.apache.org/viewvc?rev=1175097&view=rev
Log:
Minor change to the Javadoc.
Modified:
commons/proper/math/trunk/src/main/java/org/apache/commons/math/linear/FieldDecompositionSolver.java
Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math/linear/FieldDecompositionSolver.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math/linear/FieldDecompositionSolver.java?rev=1175097&r1=1175096&r2=1175097&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math/linear/FieldDecompositionSolver.java (original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math/linear/FieldDecompositionSolver.java Sat Sep 24 04:01:05 2011
@@ -25,7 +25,7 @@ import org.apache.commons.math.FieldElem
* Decomposition algorithms decompose an A matrix has a product of several specific
* matrices from which they can solve A × X = B in least squares sense: they find X
* such that ||A × X - B|| is minimal.

- * Some solvers like {@link LUDecomposition} can only find the solution for
+ *

Some solvers like {@link FieldLUDecomposition} can only find the solution for
* square matrices and when the solution is an exact linear solution, i.e. when
* ||A × X - B|| is exactly 0. Other solvers can also find solutions
* with non-square matrix A and with non-null minimal norm. If an exact linear