public class org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer extends org.apache.commons.math.optim.nonlinear.vector.jacobian.AbstractLeastSquaresOptimizer
{
private final boolean useLU;
public void <init>(org.apache.commons.math.optim.ConvergenceChecker)
{
org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer v;
org.apache.commons.math.optim.ConvergenceChecker v;
v := @this: org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer;
v := @parameter: org.apache.commons.math.optim.ConvergenceChecker;
specialinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: void <init>(boolean,org.apache.commons.math.optim.ConvergenceChecker)>(1, v);
return;
}
public void <init>(boolean, org.apache.commons.math.optim.ConvergenceChecker)
{
org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer v;
org.apache.commons.math.optim.ConvergenceChecker v;
boolean v;
v := @this: org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer;
v := @parameter: boolean;
v := @parameter: org.apache.commons.math.optim.ConvergenceChecker;
specialinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.AbstractLeastSquaresOptimizer: void <init>(org.apache.commons.math.optim.ConvergenceChecker)>(v);
v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: boolean useLU> = v;
return;
}
public org.apache.commons.math.optim.PointVectorValuePair doOptimize()
{
org.apache.commons.math.linear.RealVector v;
org.apache.commons.math.exception.MathInternalError v;
org.apache.commons.math.linear.ArrayRealVector v;
boolean v, v;
org.apache.commons.math.exception.ConvergenceException v;
org.apache.commons.math.optim.PointVectorValuePair v, v, v;
org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer v;
org.apache.commons.math.linear.RealMatrix v, v;
double[][] v;
java.lang.Object[] v;
org.apache.commons.math.linear.BlockRealMatrix v;
double[] v, v, v, v, v, v, v, v, v;
org.apache.commons.math.linear.SingularMatrixException v;
int v, v, v, v, v, v, v, v, v;
org.apache.commons.math.linear.DecompositionSolver v;
double v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
org.apache.commons.math.exception.util.LocalizedFormats v;
org.apache.commons.math.linear.QRDecomposition v;
org.apache.commons.math.linear.LUDecomposition v;
org.apache.commons.math.exception.NullArgumentException v;
org.apache.commons.math.optim.ConvergenceChecker v;
v := @this: org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer;
specialinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: void checkParameters()>();
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: org.apache.commons.math.optim.ConvergenceChecker getConvergenceChecker()>();
if v != null goto label;
v = new org.apache.commons.math.exception.NullArgumentException;
specialinvoke v.<org.apache.commons.math.exception.NullArgumentException: void <init>()>();
throw v;
label:
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: double[] getTarget()>();
v = lengthof v;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: org.apache.commons.math.linear.RealMatrix getWeight()>();
v = newarray (double)[v];
v = 0;
label:
if v >= v goto label;
v = interfaceinvoke v.<org.apache.commons.math.linear.RealMatrix: double getEntry(int,int)>(v, v);
v[v] = v;
v = v + 1;
goto label;
label:
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: double[] getStartPoint()>();
v = lengthof v;
v = null;
v = 0;
label:
if v != 0 goto label;
virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: void incrementIterationCount()>();
v = v;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: double[] computeObjectiveValue(double[])>(v);
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: double[] computeResiduals(double[])>(v);
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: org.apache.commons.math.linear.RealMatrix computeWeightedJacobian(double[])>(v);
v = new org.apache.commons.math.optim.PointVectorValuePair;
specialinvoke v.<org.apache.commons.math.optim.PointVectorValuePair: void <init>(double[],double[])>(v, v);
v = v;
v = newarray (double)[v];
v = newmultiarray (double)[v][v];
v = 0;
label:
if v >= v goto label;
v = interfaceinvoke v.<org.apache.commons.math.linear.RealMatrix: double[] getRow(int)>(v);
v = v[v];
v = v[v];
v = v * v;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v[v] = v;
v = v + 1;
goto label;
label:
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v[v];
v = v * v;
v = v + v;
v[v] = v;
v = v + 1;
goto label;
label:
v = v + 1;
goto label;
label:
v = v + 1;
goto label;
label:
v = new org.apache.commons.math.linear.BlockRealMatrix;
specialinvoke v.<org.apache.commons.math.linear.BlockRealMatrix: void <init>(double[][])>(v);
v = v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: boolean useLU>;
if v == 0 goto label;
v = new org.apache.commons.math.linear.LUDecomposition;
specialinvoke v.<org.apache.commons.math.linear.LUDecomposition: void <init>(org.apache.commons.math.linear.RealMatrix)>(v);
v = virtualinvoke v.<org.apache.commons.math.linear.LUDecomposition: org.apache.commons.math.linear.DecompositionSolver getSolver()>();
goto label;
label:
v = new org.apache.commons.math.linear.QRDecomposition;
specialinvoke v.<org.apache.commons.math.linear.QRDecomposition: void <init>(org.apache.commons.math.linear.RealMatrix)>(v);
v = virtualinvoke v.<org.apache.commons.math.linear.QRDecomposition: org.apache.commons.math.linear.DecompositionSolver getSolver()>();
label:
v = new org.apache.commons.math.linear.ArrayRealVector;
specialinvoke v.<org.apache.commons.math.linear.ArrayRealVector: void <init>(double[],boolean)>(v, 0);
v = interfaceinvoke v.<org.apache.commons.math.linear.DecompositionSolver: org.apache.commons.math.linear.RealVector solve(org.apache.commons.math.linear.RealVector)>(v);
v = virtualinvoke v.<org.apache.commons.math.linear.RealVector: double[] toArray()>();
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v[v];
v = v + v;
v[v] = v;
v = v + 1;
goto label;
label:
v := @caughtexception;
v = new org.apache.commons.math.exception.ConvergenceException;
v = <org.apache.commons.math.exception.util.LocalizedFormats: org.apache.commons.math.exception.util.LocalizedFormats UNABLE_TO_SOLVE_SINGULAR_PROBLEM>;
v = newarray (java.lang.Object)[0];
specialinvoke v.<org.apache.commons.math.exception.ConvergenceException: void <init>(org.apache.commons.math.exception.util.Localizable,java.lang.Object[])>(v, v);
throw v;
label:
if v == null goto label;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: int getIterations()>();
v = interfaceinvoke v.<org.apache.commons.math.optim.ConvergenceChecker: boolean converged(int,java.lang.Object,java.lang.Object)>(v, v, v);
if v == 0 goto label;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: double computeCost(double[])>(v);
virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: void setCost(double)>(v);
return v;
label:
v = new org.apache.commons.math.exception.MathInternalError;
specialinvoke v.<org.apache.commons.math.exception.MathInternalError: void <init>()>();
throw v;
catch org.apache.commons.math.linear.SingularMatrixException from label to label with label;
}
private void checkParameters()
{
java.lang.Object[] v;
org.apache.commons.math.exception.util.LocalizedFormats v;
double[] v, v;
org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer v;
org.apache.commons.math.exception.MathUnsupportedOperationException v;
v := @this: org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: double[] getLowerBound()>();
if v != null goto label;
v = virtualinvoke v.<org.apache.commons.math.optim.nonlinear.vector.jacobian.GaussNewtonOptimizer: double[] getUpperBound()>();
if v == null goto label;
label:
v = new org.apache.commons.math.exception.MathUnsupportedOperationException;
v = <org.apache.commons.math.exception.util.LocalizedFormats: org.apache.commons.math.exception.util.LocalizedFormats CONSTRAINT>;
v = newarray (java.lang.Object)[0];
specialinvoke v.<org.apache.commons.math.exception.MathUnsupportedOperationException: void <init>(org.apache.commons.math.exception.util.Localizable,java.lang.Object[])>(v, v);
throw v;
label:
return;
}
}