class org.apache.commons.math.linear.LUDecomposition$Solver extends java.lang.Object implements org.apache.commons.math.linear.DecompositionSolver
{
private final double[][] lu;
private final int[] pivot;
private final boolean singular;
private void <init>(double[][], int[], boolean)
{
int[] v;
org.apache.commons.math.linear.LUDecomposition$Solver v;
double[][] v;
boolean v;
v := @this: org.apache.commons.math.linear.LUDecomposition$Solver;
v := @parameter: double[][];
v := @parameter: int[];
v := @parameter: boolean;
specialinvoke v.<java.lang.Object: void <init>()>();
v.<org.apache.commons.math.linear.LUDecomposition$Solver: double[][] lu> = v;
v.<org.apache.commons.math.linear.LUDecomposition$Solver: int[] pivot> = v;
v.<org.apache.commons.math.linear.LUDecomposition$Solver: boolean singular> = v;
return;
}
public boolean isNonSingular()
{
org.apache.commons.math.linear.LUDecomposition$Solver v;
boolean v, v;
v := @this: org.apache.commons.math.linear.LUDecomposition$Solver;
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: boolean singular>;
if v != 0 goto label;
v = 1;
goto label;
label:
v = 0;
label:
return v;
}
public org.apache.commons.math.linear.RealVector solve(org.apache.commons.math.linear.RealVector)
{
org.apache.commons.math.linear.RealVector v;
int[] v, v;
org.apache.commons.math.linear.ArrayRealVector v;
boolean v;
double[][] v, v, v;
double[] 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.LUDecomposition$Solver v;
double v, v, v, v, v, v, v, v, v, v, v, v, v, v;
org.apache.commons.math.exception.DimensionMismatchException v;
v := @this: org.apache.commons.math.linear.LUDecomposition$Solver;
v := @parameter: org.apache.commons.math.linear.RealVector;
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: int[] pivot>;
v = lengthof v;
v = virtualinvoke v.<org.apache.commons.math.linear.RealVector: int getDimension()>();
if v == v goto label;
v = new org.apache.commons.math.exception.DimensionMismatchException;
v = virtualinvoke v.<org.apache.commons.math.linear.RealVector: int getDimension()>();
specialinvoke v.<org.apache.commons.math.exception.DimensionMismatchException: void <init>(int,int)>(v, v);
throw v;
label:
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: boolean singular>;
if v == 0 goto label;
v = new org.apache.commons.math.linear.SingularMatrixException;
specialinvoke v.<org.apache.commons.math.linear.SingularMatrixException: void <init>()>();
throw v;
label:
v = newarray (double)[v];
v = 0;
label:
if v >= v goto label;
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: int[] pivot>;
v = v[v];
v = virtualinvoke v.<org.apache.commons.math.linear.RealVector: double getEntry(int)>(v);
v[v] = v;
v = v + 1;
goto label;
label:
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v + 1;
label:
if v >= v goto label;
v = v[v];
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: double[][] lu>;
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;
label:
if v < 0 goto label;
v = v[v];
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: double[][] lu>;
v = v[v];
v = v[v];
v = v / v;
v[v] = v;
v = v[v];
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: double[][] lu>;
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 = new org.apache.commons.math.linear.ArrayRealVector;
specialinvoke v.<org.apache.commons.math.linear.ArrayRealVector: void <init>(double[],boolean)>(v, 0);
return v;
}
public org.apache.commons.math.linear.RealMatrix solve(org.apache.commons.math.linear.RealMatrix)
{
int[] v, v;
boolean v;
org.apache.commons.math.linear.RealMatrix v;
double[][] v, v, v, v;
double[] 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, v, v, v, v, v;
org.apache.commons.math.linear.LUDecomposition$Solver v;
double v, v, v, v, v, v, v, v, v, v, v, v, v, v;
org.apache.commons.math.linear.Array2DRowRealMatrix v;
org.apache.commons.math.exception.DimensionMismatchException v;
v := @this: org.apache.commons.math.linear.LUDecomposition$Solver;
v := @parameter: org.apache.commons.math.linear.RealMatrix;
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: int[] pivot>;
v = lengthof v;
v = interfaceinvoke v.<org.apache.commons.math.linear.RealMatrix: int getRowDimension()>();
if v == v goto label;
v = new org.apache.commons.math.exception.DimensionMismatchException;
v = interfaceinvoke v.<org.apache.commons.math.linear.RealMatrix: int getRowDimension()>();
specialinvoke v.<org.apache.commons.math.exception.DimensionMismatchException: void <init>(int,int)>(v, v);
throw v;
label:
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: boolean singular>;
if v == 0 goto label;
v = new org.apache.commons.math.linear.SingularMatrixException;
specialinvoke v.<org.apache.commons.math.linear.SingularMatrixException: void <init>()>();
throw v;
label:
v = interfaceinvoke v.<org.apache.commons.math.linear.RealMatrix: int getColumnDimension()>();
v = newmultiarray (double)[v][v];
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: int[] pivot>;
v = v[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 = v + 1;
goto label;
label:
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v + 1;
label:
if v >= v goto label;
v = v[v];
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: double[][] lu>;
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 = v - 1;
label:
if v < 0 goto label;
v = v[v];
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: double[][] lu>;
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 + 1;
goto label;
label:
v = 0;
label:
if v >= v goto label;
v = v[v];
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: double[][] lu>;
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.Array2DRowRealMatrix;
specialinvoke v.<org.apache.commons.math.linear.Array2DRowRealMatrix: void <init>(double[][],boolean)>(v, 0);
return v;
}
public org.apache.commons.math.linear.RealMatrix getInverse()
{
int[] v;
int v;
org.apache.commons.math.linear.RealMatrix v, v;
org.apache.commons.math.linear.LUDecomposition$Solver v;
v := @this: org.apache.commons.math.linear.LUDecomposition$Solver;
v = v.<org.apache.commons.math.linear.LUDecomposition$Solver: int[] pivot>;
v = lengthof v;
v = staticinvoke <org.apache.commons.math.linear.MatrixUtils: org.apache.commons.math.linear.RealMatrix createRealIdentityMatrix(int)>(v);
v = virtualinvoke v.<org.apache.commons.math.linear.LUDecomposition$Solver: org.apache.commons.math.linear.RealMatrix solve(org.apache.commons.math.linear.RealMatrix)>(v);
return v;
}
}