Constructs and returns a new eigenvalue decomposition object;
The decomposed matrices can be retrieved via instance methods of the returned decomposition object.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Performs a binary search on an already-sorted range:
Finds the largest subrange in the supplied range such that an
element can be inserted at any point in that subrange without violating
the existing ordering.
Returns whether two objects are equal;
This default implementation returns true if the other object is a bin
and has the same size, value, error and center.
Returns whether two bins are equal;
They are equal if the other object is of the same class or a subclass of this class and both have the same size, minimum, maximum, sum and sumOfSquares.