HomeSort by relevance Sort by last modified time
    Searched full:singular (Results 1 - 25 of 469) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/e2fsprogs/lib/support/
nls-enable.h 10 #define P_(singular, plural, n) (ngettext (singular, plural, n))
20 #define P_(singular, plural, n) ((n) == 1 ? (singular) : (plural))
  /external/testng/src/main/java/org/testng/reporters/jq/
BasePanel.java 26 protected static String pluralize(int count, String singular) {
28 ? (singular.endsWith("s") ? singular + "es" : singular + "s")
29 : singular);
  /external/eigen/doc/snippets/
JacobiSVD_basic.cpp 4 cout << "Its singular values are:" << endl << svd.singularValues() << endl;
5 cout << "Its left singular vectors are the columns of the thin U matrix:" << endl << svd.matrixU() << endl;
6 cout << "Its right singular vectors are the columns of the thin V matrix:" << endl << svd.matrixV() << endl;
  /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
SingularValueDecomposition.java 24 * Singular Value Decomposition of a real matrix.
26 * The Singular Value Decomposition of matrix A is a set of three matrices: U,
66 * @return the U matrix (or null if decomposed matrix is singular)
73 * <p>&Sigma; is a diagonal matrix. The singular values are provided in
81 * <p>The singular values are provided in non-increasing order, for
90 * @return the V matrix (or null if decomposed matrix is singular)
98 * @return the V matrix (or null if decomposed matrix is singular)
107 * the singular values.</p>
108 * @param minSingularValue value below which singular values are ignored
109 * (a 0 or negative value implies all singular value will be used
    [all...]
LUDecompositionImpl.java 51 private boolean singular; field in class:LUDecompositionImpl
76 * under which a matrix is considered singular
98 singular = false;
135 singular = true;
166 if ((cachedL == null) && !singular) {
182 if ((cachedU == null) && !singular) {
197 if ((cachedP == null) && !singular) {
214 if (singular) {
228 return new Solver(lu, pivot, singular);
241 private final boolean singular; field in class:LUDecompositionImpl.Solver
    [all...]
DecompositionSolver.java 44 * @exception InvalidMatrixException if decomposed matrix is singular
55 * @exception InvalidMatrixException if decomposed matrix is singular
66 * @exception InvalidMatrixException if decomposed matrix is singular
72 * Check if the decomposed matrix is non-singular.
73 * @return true if the decomposed matrix is non-singular
79 * @throws InvalidMatrixException if decomposed matrix is singular
FieldDecompositionSolver.java 46 * @exception InvalidMatrixException if decomposed matrix is singular
57 * @exception InvalidMatrixException if decomposed matrix is singular
68 * @exception InvalidMatrixException if decomposed matrix is singular
74 * Check if the decomposed matrix is non-singular.
75 * @return true if the decomposed matrix is non-singular
81 * @throws InvalidMatrixException if decomposed matrix is singular
FieldLUDecompositionImpl.java 56 private boolean singular; field in class:FieldLUDecompositionImpl
92 singular = false;
127 singular = true;
157 if ((cachedL == null) && !singular) {
173 if ((cachedU == null) && !singular) {
188 if ((cachedP == null) && !singular) {
205 if (singular) {
219 return new Solver<T>(field, lu, pivot, singular);
238 private final boolean singular; field in class:FieldLUDecompositionImpl.Solver
245 * @param singular singularity indicato
    [all...]
FieldLUDecomposition.java 53 * @return the L matrix (or null if decomposed matrix is singular)
60 * @return the U matrix (or null if decomposed matrix is singular)
70 * @return the P rows permutation matrix (or null if decomposed matrix is singular)
LUDecomposition.java 51 * @return the L matrix (or null if decomposed matrix is singular)
58 * @return the U matrix (or null if decomposed matrix is singular)
68 * @return the P rows permutation matrix (or null if decomposed matrix is singular)
SingularMatrixException.java 24 * Thrown when a matrix is singular.
SingularValueDecompositionImpl.java 25 * Calculates the compact Singular Value Decomposition of a matrix.
27 * The Singular Value Decomposition of matrix A is a set of three matrices: U,
49 /** Singular values. */
68 * Calculates the compact Singular Value Decomposition of the given matrix.
214 // get the number of singular values to consider
362 * Check if the decomposed matrix is non-singular.
363 * @return true if the decomposed matrix is non-singular
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
intl.h 41 # define ngettext(singular,plural,n) fake_ngettext(singular,plural,n)
45 extern const char *fake_ngettext(const char *singular,const char *plural,
  /external/libcxx/test/libcxx/experimental/filesystem/class.path/path.itr/
iterator_db.pass.cpp 32 // Test incrementing/decrementing a singular iterator
34 path::iterator singular; local
36 ++singular;
40 --singular;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/
safe_base.h 54 a singular iterator. */
59 * singular because of an operation on the container). This
62 * non-singular.
75 /** Initializes the iterator and makes it singular. */
84 * singular. Otherwise, the iterator will reference @p __seq and
132 /** Is this iterator singular? */
140 /** Invalidate the iterator, making it singular. */
200 /** Detach all iterators, leaving them singular. */
204 /** Detach all singular iterators.
211 /** Revalidates all attached singular iterators. This method ma
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/
safe_base.h 54 a singular iterator. */
59 * singular because of an operation on the container). This
62 * non-singular.
75 /** Initializes the iterator and makes it singular. */
84 * singular. Otherwise, the iterator will reference @p __seq and
132 /** Is this iterator singular? */
140 /** Invalidate the iterator, making it singular. */
200 /** Detach all iterators, leaving them singular. */
204 /** Detach all singular iterators.
211 /** Revalidates all attached singular iterators. This method ma
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/debug/
safe_base.h 54 a singular iterator. */
59 * singular because of an operation on the container). This
62 * non-singular.
75 /** Initializes the iterator and makes it singular. */
84 * singular. Otherwise, the iterator will reference @p __seq and
132 /** Is this iterator singular? */
140 /** Invalidate the iterator, making it singular. */
200 /** Detach all iterators, leaving them singular. */
204 /** Detach all singular iterators.
211 /** Revalidates all attached singular iterators. This method ma
    [all...]
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/
safe_base.h 54 a singular iterator. */
59 * singular because of an operation on the container). This
62 * non-singular.
75 /** Initializes the iterator and makes it singular. */
84 * singular. Otherwise, the iterator will reference @p __seq and
132 /** Is this iterator singular? */
140 /** Invalidate the iterator, making it singular. */
209 /** Detach all iterators, leaving them singular. */
213 /** Detach all singular iterators.
220 /** Revalidates all attached singular iterators. This method ma
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/
safe_base.h 54 a singular iterator. */
59 * singular because of an operation on the container). This
62 * non-singular.
75 /** Initializes the iterator and makes it singular. */
84 * singular. Otherwise, the iterator will reference @p __seq and
132 /** Is this iterator singular? */
140 /** Invalidate the iterator, making it singular. */
209 /** Detach all iterators, leaving them singular. */
213 /** Detach all singular iterators.
220 /** Revalidates all attached singular iterators. This method ma
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/
safe_base.h 54 a singular iterator. */
59 * singular because of an operation on the container). This
62 * non-singular.
75 /** Initializes the iterator and makes it singular. */
84 * singular. Otherwise, the iterator will reference @p __seq and
132 /** Is this iterator singular? */
140 /** Invalidate the iterator, making it singular. */
209 /** Detach all iterators, leaving them singular. */
213 /** Detach all singular iterators.
220 /** Revalidates all attached singular iterators. This method ma
    [all...]
  /external/eigen/Eigen/src/SVD/
SVDBase.h 32 * the diagonal entries of S are known as the \em singular \em values of \a A and the columns of \a U and \a V are known as the left
33 * and right \em singular \em vectors of \a A respectively.
35 * Singular values are always sorted in decreasing order.
39 * smaller value among \a n and \a p, there are only \a m singular vectors; the remaining columns of \a U and \a V do not correspond to actual
40 * singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix,
79 * The \a m first columns of \a U are the left singular vectors of the matrix being decomposed.
95 * The \a m first columns of \a V are the right singular vectors of the matrix being decomposed.
106 /** \returns the vector of singular values.
109 * returned vector has size \a m. Singular values are always sorted in decreasing order.
117 /** \returns the number of singular values that are not exactly 0 *
    [all...]
  /external/protobuf/javanano/src/test/java/com/google/protobuf/nano/
unittest_has_nano.proto 50 // Singular
70 // Singular with defaults
unittest_accessors_nano.proto 50 // Singular
70 // Singular with defaults
  /external/testng/src/main/java/org/testng/reporters/
JqReporter.java 230 private String pluralize(int count, String singular) {
232 + (count > 1 ? (singular.endsWith("s") ? singular + "es" : singular + "s") : singular);
  /external/eigen/doc/
LeastSquares.dox 20 solve linear squares systems. It is not enough to compute only the singular values (the default for
21 this class); you also need the singular vectors but the thin SVD decomposition suffices for

Completed in 555 milliseconds

1 2 3 4 5 6 7 8 91011>>