Package | Description |
---|---|
org.orekit.estimation.measurements.gnss |
This package provides methods to handle GNSS measurements.
|
Modifier and Type | Method and Description |
---|---|
IntegerLeastSquareSolution |
SimpleRatioAmbiguityAcceptance.accept(IntegerLeastSquareSolution[] candidates)
Check if one of the candidate solutions can be accepted.
|
IntegerLeastSquareSolution |
AmbiguityAcceptance.accept(IntegerLeastSquareSolution[] candidates)
Check if one of the candidate solutions can be accepted.
|
protected IntegerLeastSquareSolution[] |
IntegerBootstrapping.recoverAmbiguities()
Recover ambiguities prior to the Z-transformation.
|
protected IntegerLeastSquareSolution[] |
AbstractLambdaMethod.recoverAmbiguities()
Recover ambiguities prior to the Z-transformation.
|
IntegerLeastSquareSolution[] |
IntegerLeastSquareSolver.solveILS(int nbSol,
double[] floatAmbiguities,
int[] indirection,
org.hipparchus.linear.RealMatrix covariance)
Find the best solutions to an Integer Least Square problem.
|
IntegerLeastSquareSolution[] |
AbstractLambdaMethod.solveILS(int nbSol,
double[] floatAmbiguities,
int[] indirection,
org.hipparchus.linear.RealMatrix covariance)
Find the best solutions to an Integer Least Square problem.
|
Modifier and Type | Method and Description |
---|---|
IntegerLeastSquareSolution |
SimpleRatioAmbiguityAcceptance.accept(IntegerLeastSquareSolution[] candidates)
Check if one of the candidate solutions can be accepted.
|
IntegerLeastSquareSolution |
AmbiguityAcceptance.accept(IntegerLeastSquareSolution[] candidates)
Check if one of the candidate solutions can be accepted.
|
int |
IntegerLeastSquareComparator.compare(IntegerLeastSquareSolution ilss1,
IntegerLeastSquareSolution ilss2)
The comparison is based on the squared
distance to the float solution.
|
Modifier and Type | Method and Description |
---|---|
void |
AbstractLambdaMethod.setComparator(Comparator<IntegerLeastSquareSolution> newCompartor)
Set a custom comparator for integer least square solutions comparison.
|
Copyright © 2002-2023 CS GROUP. All rights reserved.