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

optimized matrix update loop 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@790374 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Luc Maisonobe 2009-07-01 20:57:20 +00:00
parent 5129af7587
commit c22eec05d3
1 changed files with 8 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
src/java/org/apache/commons/math/ode/nonstiff/AdamsNordsieckTransformer.java
View File

@ -25,13 +25,10 @@ import org.apache.commons.math.fraction.BigFraction;
import org.apache.commons.math.linear.Array2DRowFieldMatrix;
import org.apache.commons.math.linear.Array2DRowRealMatrix;
import org.apache.commons.math.linear.DefaultFieldMatrixChangingVisitor;
import org.apache.commons.math.linear.DefaultRealMatrixChangingVisitor;
import org.apache.commons.math.linear.FieldDecompositionSolver;
import org.apache.commons.math.linear.FieldLUDecompositionImpl;
import org.apache.commons.math.linear.FieldMatrix;
import org.apache.commons.math.linear.MatrixUtils;
import org.apache.commons.math.linear.MatrixVisitorException;
import org.apache.commons.math.linear.RealMatrix;
/** Transformer to Nordsieck vectors for Adams integrators.
* <p>This class i used by {@link AdamsBashforthIntegrator Adams-Bashforth} and
@ -301,15 +298,15 @@ public class AdamsNordsieckTransformer {
*/
public void updateHighOrderDerivativesPhase2(final double[] start,
final double[] end,
final RealMatrix highOrder) {
highOrder.walkInOptimizedOrder(new DefaultRealMatrixChangingVisitor() {
/** {@inheritDoc} */
@Override
public double visit(int row, int column, double value)
throws MatrixVisitorException {
return value + c1[row] * (start[column] - end[column]);
final Array2DRowRealMatrix highOrder) {
final double[][] data = highOrder.getDataRef();
for (int i = 0; i < data.length; ++i) {
final double[] dataI = data[i];
final double c1I = c1[i];
for (int j = 0; j < dataI.length; ++j) {
dataI[j] += c1I * (start[j] - end[j]);
}
});
}
}
}