| /external/ceres-solver/docs/source/ |
| solving.rst | [all...] |
| /external/ceres-solver/internal/ceres/ |
| dogleg_strategy.h | 48 // because the Jacobian is often rank-deficient and in such cases
105 // Gauss-Newton solve full rank. In each solve, the strategy starts
|
| lapack.h | 65 // rectangular) matrix with full column rank.
|
| covariance_impl.cc | 671 const SuiteSparse_long rank = local
683 if (rank < cholmod_jacobian.ncol) {
684 LOG(WARNING) << "Jacobian matrix is rank deficient."
686 << " rank: " << rank;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 37 * zeros in the bottom right rank(A) - n submatrix. Avoiding the square root
40 * Remember that Cholesky decompositions are not rank-revealing. Also, do not use a Cholesky
285 // Finish early if the matrix is not full rank.
334 // Reference for the algorithm: Davis and Hager, "Multiple Rank
337 // allow their algorithm to work for rank-1 updates even if the
338 // original matrix is not of full rank.
339 // Here only rank-1 updates are implemented, to reduce the
357 // Check for termination due to an original decomposition of low-rank
|
| LLT.h | 37 * Remember that Cholesky decompositions are not rank-revealing. This LLT decomposition is only stable on positive definite matrices,
397 /** Performs a rank one update (or dowdate) of the current decomposition.
398 * If A = LL^* before the rank one update,
|
| /external/valgrind/main/mpi/ |
| mpiwrap_type_test.c | 224 int rank, size; local
244 MPI_Comm_rank( MPI_COMM_WORLD, &rank );
246 if (rank == 0) {
|
| /external/ceres-solver/include/ceres/ |
| normal_prior.h | 56 // which would be the case if the covariance matrix S is rank
|
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
| prrwlock.h | 65 ** INPUTS: Lock rank
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LU.h | 40 Dynamic, // we don't know at compile time the dimension of the image (the rank)
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 36 * This is \b not a rank-revealing LU decomposition. Many features are intentionally absent from this class,
37 * such as rank computation. If you need these features, use class FullPivLU.
87 * \warning The matrix should have full rank (e.g. if it's square, it should be invertible).
88 * If you need to deal with non-full rank, use class FullPivLU instead.
|
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 89 #if 0 // cholesky is not rank-revealing anyway
|
| /external/eigen/test/ |
| inverse.cpp | 61 //Second: a rank one matrix (not invertible, except for 1x1 matrices)
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| r1updt.h | 59 /* add the spike from the rank 1 update to w. */
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| stochastic_linear_ranker.cpp | 101 ALOGE("Unknown rank loss type: %d", rank_loss_type_);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/rpcsvc/ |
| nis.x | 257 int rank;
268 int min_rank; /* minimum rank of bound endpoints */
269 int optimal_rank; /* best possible rank of all endpoints */
280 int rank;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| nis.x | 257 int rank;
268 int min_rank; /* minimum rank of bound endpoints */
269 int optimal_rank; /* best possible rank of all endpoints */
280 int rank;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| nis.x | 257 int rank;
268 int min_rank; /* minimum rank of bound endpoints */
269 int optimal_rank; /* best possible rank of all endpoints */
280 int rank;
|
| /external/eigen/blas/ |
| level2_real_impl.h | 187 /** DSPR performs the symmetric rank 1 operation
199 /** DSPR2 performs the symmetric rank 2 operation
|
| /external/llvm/lib/CodeGen/ |
| StrongPHIElimination.cpp | 82 Node(unsigned v) : value(v), rank(0) { parent.setPointer(this); }
88 unsigned rank; member in struct:__anon23601::StrongPHIElimination::Node
442 if (Node1->rank > Node2->rank) {
444 } else if (Node1->rank < Node2->rank) {
448 Node1->rank++;
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| bitvect.c | 1768 wordptr rank; member in struct:BitVector_from_Dec_static_data
1820 wordptr rank; local
1931 wordptr rank; local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| Eigen3f.java | 90 // Rank was 0 (or very close to 0), so just return.
272 * Check the rank of the given Matrix to determine if it is positive. While
284 * @return true if the given matrix has a non 0 rank.
|
| /frameworks/base/docs/html/reference/com/google/android/gms/games/leaderboard/ |
| LeaderboardVariant.html | 780 <td class="jd-descrcol" width="100%">Constant returned when a player's rank for this variant is unknown.</td>
866 <div class="jd-descrdiv">Retrieves the viewing player's formatted rank for this variant, if any.</div>
920 <div class="jd-descrdiv">Retrieves the viewing player's rank for this variant, if any.</div>
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ |
| type_traits | 370 /// rank
372 struct rank
376 struct rank<_Tp[_Size]>
377 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
380 struct rank<_Tp[]>
381 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ |
| type_traits | 370 /// rank
372 struct rank
376 struct rank<_Tp[_Size]>
377 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
380 struct rank<_Tp[]>
381 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
[all...] |
