optimize(LeastSquaresProblem) |   | 94% |   | 95% | 4 | 41 | 6 | 145 | 0 | 1 |
qrDecomposition(RealMatrix, int) |   | 94% |   | 92% | 2 | 14 | 2 | 47 | 0 | 1 |
determineLMDirection(double[], double[], double[], LevenbergMarquardtOptimizer.InternalData, int, double[], double[]) |   | 97% |   | 81% | 5 | 17 | 2 | 55 | 0 | 1 |
determineLMParameter(double[], double, double[], LevenbergMarquardtOptimizer.InternalData, int, double[], double[], double[], double[], double) |   | 98% |   | 92% | 4 | 29 | 2 | 95 | 0 | 1 |
getInitialStepBoundFactor() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getCostRelativeTolerance() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getParameterRelativeTolerance() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getOrthoTolerance() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
getRankingThreshold() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
qTy(double[], LevenbergMarquardtOptimizer.InternalData) |  | 100% |  | 100% | 0 | 4 | 0 | 14 | 0 | 1 |
LevenbergMarquardtOptimizer(double, double, double, double, double) |  | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
withInitialStepBoundFactor(double) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
withCostRelativeTolerance(double) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
withParameterRelativeTolerance(double) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
withOrthoTolerance(double) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
withRankingThreshold(double) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
LevenbergMarquardtOptimizer() |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |