| /external/eigen/failtest/ |
| jacobisvd_int.cpp | 13 JacobiSVD<Matrix<SCALAR,Dynamic,Dynamic> > qr(Matrix<SCALAR,Dynamic,Dynamic>::Random(10,10));
|
| /external/eigen/test/ |
| jacobisvd.cpp | 17 #define SVD_DEFAULT(M) JacobiSVD<M>
18 #define SVD_FOR_MIN_NORM(M) JacobiSVD<M,ColPivHouseholderQRPreconditioner>
21 // Check all variants of JacobiSVD
23 void jacobisvd(const MatrixType& a = MatrixType(), bool pickrandom = true) function
29 CALL_SUBTEST(( svd_test_all_computation_options<JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner> >(m, true) )); // check full only
30 CALL_SUBTEST(( svd_test_all_computation_options<JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner> >(m, false) ));
31 CALL_SUBTEST(( svd_test_all_computation_options<JacobiSVD<MatrixType, HouseholderQRPreconditioner> >(m, false) ));
33 CALL_SUBTEST(( svd_test_all_computation_options<JacobiSVD<MatrixType, NoQRPreconditioner> >(m, false) ));
38 svd_verify_assert<JacobiSVD<MatrixType> >(m);
53 JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner> svd_fullqr
[all...] |
| bdcsvd.cpp | 27 // Check all variants of JacobiSVD
57 JacobiSVD<MatrixType> jacobi_svd(m);
|
| qr_colpivoting.cpp | 57 JacobiSVD<MatrixType> svd(matrix, ComputeThinU | ComputeThinV);
89 JacobiSVD<MatrixType> svd(matrix, ComputeFullU | ComputeFullV);
|
| nomalloc.cpp | 156 Eigen::JacobiSVD<Matrix> jSVD; jSVD.compute(A, ComputeFullU | ComputeFullV);
|
| /external/eigen/doc/snippets/ |
| JacobiSVD_basic.cpp | 3 JacobiSVD<MatrixXf> svd(m, ComputeThinU | ComputeThinV);
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 27 *** JacobiSVD which by itself is only able to work on square matrices.
55 void allocate(const JacobiSVD<MatrixType, QRPreconditioner>&) {}
56 bool run(JacobiSVD<MatrixType, QRPreconditioner>&, const MatrixType&)
76 void allocate(const JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd)
86 bool run(JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix)
122 void allocate(const JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd)
133 bool run(JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix)
159 void allocate(const JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner>& svd)
170 bool run(JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix)
213 void allocate(const JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner>& svd
[all...] |
| JacobiSVD_LAPACKE.h | 42 JacobiSVD<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>, ColPivHouseholderQRPreconditioner>& \
43 JacobiSVD<Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>, ColPivHouseholderQRPreconditioner>::compute(const Matrix<EIGTYPE, Dynamic, Dynamic, EIGCOLROW, Dynamic, Dynamic>& matrix, unsigned int computationOptions) \
|
| BDCSVD.h | 54 * and then performs a divide-and-conquer diagonalization. Small blocks are diagonalized using class JacobiSVD.
56 * For small matrice (<16), it is thus preferable to directly use JacobiSVD. For larger ones, BDCSVD is highly
64 * \sa class JacobiSVD
248 //**** step -1 - If the problem is too small, directly falls back to JacobiSVD and return
252 JacobiSVD<MatrixType> jsvd(matrix,computationOptions);
410 JacobiSVD<MatrixXr> b(m_computed.block(firstCol, firstCol, n + 1, n), ComputeFullU | (m_compV ? ComputeFullV : 0));
515 ArrayXr tmp1 = (m_computed.block(firstCol+shift, firstCol+shift, n, n)).jacobiSvd().singularValues();
520 ArrayXr tmp2 = (m_computed.block(firstCol+shift, firstCol+shift, n, n)).jacobiSvd().singularValues();
615 std::cout << " j: " << (m_computed.block(firstCol, firstCol, n, n)).jacobiSvd().singularValues().transpose().reverse() << "\n\n";
684 JacobiSVD<MatrixXr> jsvd(m_computed.block(firstCol, firstCol, n, n) )
[all...] |
| /external/eigen/unsupported/bench/ |
| bench_svd.cpp | 55 JacobiSVD<MatrixType> jacobi_matrix(m);
86 JacobiSVD<MatrixType> jacobi_matrix(m, ComputeFullU|ComputeFullV);
|
| /external/eigen/Eigen/src/Geometry/ |
| Umeyama.h | 131 JacobiSVD<MatrixType> svd(sigma, ComputeFullU | ComputeFullV);
|
| Hyperplane.h | 109 JacobiSVD<Matrix<Scalar,2,3> > svd(m, ComputeFullV);
|
| Transform.h | [all...] |
| Quaternion.h | 596 JacobiSVD<Matrix<Scalar,2,3> > svd(m, ComputeFullV);
|
| /external/eigen/bench/ |
| dense_solvers.cpp | 56 JacobiSVD<MatDyn> jsvd(A.rows(),A.cols());
69 if(size<500) // JacobiSVD is really too slow for too large matrices
82 results["JacobiSVD"][id] = t_jsvd.best();
97 labels.push_back("JacobiSVD");
184 // cout << "JacobiSVD (%) " << (results["JacobiSVD"]/results["LLT"]).format(fmt) << "\n";
|
| /external/eigen/lapack/ |
| svd.cpp | 124 JacobiSVD<PlainMatrixType> svd(mat,option);
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 258 template<typename MatrixType, int QRPreconditioner = ColPivHouseholderQRPreconditioner> class JacobiSVD;
|
| /external/eigen/Eigen/src/Core/ |
| MatrixBase.h | 374 inline JacobiSVD<PlainObject> jacobiSvd(unsigned int computationOptions = 0) const;
|
