Apache
/
commons-math
mirror of https://github.com/apache/commons-math.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Replaced call to FieldDecompositionSolver<T>.solve(T[]) by FieldDecompositionSolver<T>.solve(FieldVector<T>). This is in accordance with JIRA MATH-661. 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1172472 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Sebastien Brisard 2011-09-19 06:18:40 +00:00
parent d5341ec56c
commit efcbcd5cc6
3 changed files with 33 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/test/java/org/apache/commons/math/linear/BlockFieldMatrixTest.java
View File

@ -543,8 +543,13 @@ public final class BlockFieldMatrixTest {
{new Fraction(4), new Fraction(-3), new Fraction(-5)}
};
FieldMatrix<Fraction> coefficients = new BlockFieldMatrix<Fraction>(coefficientsData);
Fraction[] constants = {new Fraction(1), new Fraction(-2), new Fraction(1)};
Fraction[] solution = new FieldLUDecompositionImpl<Fraction>(coefficients).getSolver().solve(constants);
Fraction[] constants = {
new Fraction(1), new Fraction(-2), new Fraction(1)
};
Fraction[] solution;
solution = new FieldLUDecompositionImpl<Fraction>(coefficients)
.getSolver()
.solve(new ArrayFieldVector<Fraction>(constants, false)).toArray();
Assert.assertEquals(new Fraction(2).multiply(solution[0]).
add(new Fraction(3).multiply(solution[1])).
subtract(new Fraction(2).multiply(solution[2])),

9
src/test/java/org/apache/commons/math/linear/FieldMatrixImplTest.java
View File

@ -406,8 +406,13 @@ public final class FieldMatrixImplTest {
{new Fraction(4), new Fraction(-3), new Fraction(-5)}
};
FieldMatrix<Fraction> coefficients = new Array2DRowFieldMatrix<Fraction>(coefficientsData);
Fraction[] constants = {new Fraction(1), new Fraction(-2), new Fraction(1)};
Fraction[] solution = new FieldLUDecompositionImpl<Fraction>(coefficients).getSolver().solve(constants);
Fraction[] constants = {
new Fraction(1), new Fraction(-2), new Fraction(1)
};
Fraction[] solution;
solution = new FieldLUDecompositionImpl<Fraction>(coefficients)
.getSolver()
.solve(new ArrayFieldVector<Fraction>(constants, false)).toArray();
Assert.assertEquals(new Fraction(2).multiply(solution[0]).
add(new Fraction(3).multiply(solution[1])).
subtract(new Fraction(2).multiply(solution[2])), constants[0]);

5
src/test/java/org/apache/commons/math/linear/SparseFieldMatrixTest.java
View File

@ -396,7 +396,10 @@ public class SparseFieldMatrixTest {
{ new Fraction(4), new Fraction(-3), new Fraction(-5) } };
FieldMatrix<Fraction> coefficients = createSparseMatrix(coefficientsData);
Fraction[] constants = { new Fraction(1), new Fraction(-2), new Fraction(1) };
Fraction[] solution = new FieldLUDecompositionImpl<Fraction>(coefficients).getSolver().solve(constants);
Fraction[] solution;
solution = new FieldLUDecompositionImpl<Fraction>(coefficients)
.getSolver()
.solve(new ArrayFieldVector<Fraction>(constants, false)).toArray();
Assert.assertEquals((new Fraction(2).multiply((solution[0])).add(new Fraction(3).multiply(solution[1])).subtract(new Fraction(2).multiply(solution[2]))).doubleValue(),
constants[0].doubleValue(), 1E-12);
Assert.assertEquals(((new Fraction(-1).multiply(solution[0])).add(new Fraction(7).multiply(solution[1])).add(new Fraction(6).multiply(solution[2]))).doubleValue(),