| /external/eigen/lapack/ |
| cholesky.cpp | 11 #include <Eigen/Cholesky>
13 // POTRF computes the Cholesky factorization of a real symmetric positive definite matrix A.
39 // positive definite matrix A using the Cholesky factorization
|
| /external/ceres-solver/internal/ceres/ |
| suitesparse.h | 135 // the fill-in in the Cholesky factorization of the corresponding
138 // Using this ordering, the symbolic Cholesky factorization of A (or
154 // If A is symmetric, then compute the symbolic Cholesky
184 LinearSolverTerminationType Cholesky(cholmod_sparse* A,
188 // Given a Cholesky factorization of a matrix A = LL^T, solve the
|
| sparse_normal_cholesky_solver.cc | 151 // using a sparse Cholesky factorization. Notice that when compared
154 // hand can just work off of Jt to compute the Cholesky
248 // using a sparse Cholesky factorization. Notice that when compared
251 // hand can just work off of Jt to compute the Cholesky
357 summary.termination_type = ss_.Cholesky(&lhs, factor_, &summary.message);
|
| suitesparse.cc | 248 LinearSolverTerminationType SuiteSparse::Cholesky(cholmod_sparse* A,
268 // that the return value Cholesky is two valued, but the state of
|
| schur_complement_solver.cc | 116 // Eigen's Cholesky factorization.
144 "Eigen failure. Unable to perform dense Cholesky factorization.";
270 // CHOLMOD's sparse cholesky factorization routines.
344 ss_.Cholesky(cholmod_lhs, factor_, &summary.message);
377 // CXSparse's sparse cholesky factorization routines.
433 // Eigen's sparse cholesky factorization routines.
|
| visibility_based_preconditioner.cc | 428 // Compute the sparse Cholesky factorization of the preconditioner
451 ? ss_.Cholesky(lhs, factor_, &status)
|
| /external/ceres-solver/scripts/ |
| ceres-solver.spec | 44 - Dense QR and Cholesky factorization (using Eigen) for small problems
45 - Sparse Cholesky factorization (using SuiteSparse) for large sparse problems
|
| /external/eigen/bench/ |
| benchCholesky.cpp | 14 #include <Eigen/Cholesky>
|
| sparse_cholesky.cpp | 61 #include <Eigen/Cholesky>
|
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 12 #include <Eigen/Cholesky>
19 template<typename MatrixType> void cholesky(const MatrixType& m) function
50 Gsl::cholesky(gMatA);
89 #if 0 // cholesky is not rank-revealing anyway
105 CALL_SUBTEST_1( cholesky(Matrix<double,1,1>()) );
106 CALL_SUBTEST_2( cholesky(Matrix2d()) );
107 CALL_SUBTEST_3( cholesky(Matrix3f()) );
108 CALL_SUBTEST_4( cholesky(Matrix4d()) );
109 CALL_SUBTEST_5( cholesky(MatrixXcd(7,7)) );
110 CALL_SUBTEST_6( cholesky(MatrixXf(17,17)) )
[all...] |
| sparse.h | 26 #include <Eigen/Cholesky>
|
| /external/eigen/bench/btl/libs/eigen2/ |
| eigen2_interface.hh | 22 #include <Eigen/Cholesky>
144 static inline void cholesky(const gene_matrix & X, gene_matrix & C, int N){ function in class:eigen2_interface
147 // Cholesky<gene_matrix>::computeInPlace(C);
148 // Cholesky<gene_matrix>::computeInPlaceBlock(C);
|
| /external/eigen/test/ |
| sparse.h | 38 #include <Eigen/Cholesky>
|
| nomalloc.cpp | 27 #include <Eigen/Cholesky>
129 // Cholesky module
|
| cholesky.cpp | 19 #include <Eigen/Cholesky>
61 template<typename MatrixType> void cholesky(const MatrixType& m) function
86 // to test if really Cholesky only uses the upper triangular part, uncomment the following
244 cholesky(m);
379 CALL_SUBTEST_1( cholesky(Matrix<double,1,1>()) );
380 CALL_SUBTEST_3( cholesky(Matrix2d()) );
383 CALL_SUBTEST_4( cholesky(Matrix3f()) );
384 CALL_SUBTEST_5( cholesky(Matrix4d()) );
386 CALL_SUBTEST_2( cholesky(MatrixXd(s,s)) );
|
| /external/eigen/bench/spbench/ |
| spbenchsolver.h | 17 #include <Eigen/Cholesky>
389 // Internal Cholesky
429 //Internal Sparse Cholesky
|
