simplicial_cholesky.cpp
Go to the documentation of this file.
1 // This file is part of Eigen, a lightweight C++ template library
2 // for linear algebra.
3 //
4 // Copyright (C) 2011 Gael Guennebaud <g.gael@free.fr>
5 //
6 // This Source Code Form is subject to the terms of the Mozilla
7 // Public License v. 2.0. If a copy of the MPL was not distributed
8 // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 
10 #include "sparse_solver.h"
11 
12 template<typename T, typename I_, int flag> void test_simplicial_cholesky_T()
13 {
14  typedef SparseMatrix<T,flag,I_> SparseMatrixType;
15  SimplicialCholesky<SparseMatrixType, Lower> chol_colmajor_lower_amd;
16  SimplicialCholesky<SparseMatrixType, Upper> chol_colmajor_upper_amd;
17  SimplicialLLT< SparseMatrixType, Lower> llt_colmajor_lower_amd;
18  SimplicialLLT< SparseMatrixType, Upper> llt_colmajor_upper_amd;
19  SimplicialLDLT< SparseMatrixType, Lower> ldlt_colmajor_lower_amd;
20  SimplicialLDLT< SparseMatrixType, Upper> ldlt_colmajor_upper_amd;
23 
24  check_sparse_spd_solving(chol_colmajor_lower_amd);
25  check_sparse_spd_solving(chol_colmajor_upper_amd);
26  check_sparse_spd_solving(llt_colmajor_lower_amd);
27  check_sparse_spd_solving(llt_colmajor_upper_amd);
28  check_sparse_spd_solving(ldlt_colmajor_lower_amd);
29  check_sparse_spd_solving(ldlt_colmajor_upper_amd);
30 
31  check_sparse_spd_determinant(chol_colmajor_lower_amd);
32  check_sparse_spd_determinant(chol_colmajor_upper_amd);
33  check_sparse_spd_determinant(llt_colmajor_lower_amd);
34  check_sparse_spd_determinant(llt_colmajor_upper_amd);
35  check_sparse_spd_determinant(ldlt_colmajor_lower_amd);
36  check_sparse_spd_determinant(ldlt_colmajor_upper_amd);
37 
38  check_sparse_spd_solving(ldlt_colmajor_lower_nat, (std::min)(300,EIGEN_TEST_MAX_SIZE), 1000);
39  check_sparse_spd_solving(ldlt_colmajor_upper_nat, (std::min)(300,EIGEN_TEST_MAX_SIZE), 1000);
40 }
41 
42 EIGEN_DECLARE_TEST(simplicial_cholesky)
43 {
44  CALL_SUBTEST_11(( test_simplicial_cholesky_T<double, int, ColMajor>() ));
45  CALL_SUBTEST_12(( test_simplicial_cholesky_T<std::complex<double>, int, ColMajor>() ));
46  CALL_SUBTEST_13(( test_simplicial_cholesky_T<double, long int, ColMajor>() ));
47  CALL_SUBTEST_21(( test_simplicial_cholesky_T<double, int, RowMajor>() ));
48  CALL_SUBTEST_22(( test_simplicial_cholesky_T<std::complex<double>, int, RowMajor>() ));
49  CALL_SUBTEST_23(( test_simplicial_cholesky_T<double, long int, RowMajor>() ));
50 }
#define CALL_SUBTEST_12(FUNC)
A versatible sparse matrix representation.
Definition: SparseMatrix.h:96
#define min(a, b)
Definition: datatypes.h:19
#define CALL_SUBTEST_13(FUNC)
#define CALL_SUBTEST_11(FUNC)
#define CALL_SUBTEST_22(FUNC)
void check_sparse_spd_determinant(Solver &solver)
A direct sparse LDLT Cholesky factorizations without square root.
EIGEN_DECLARE_TEST(simplicial_cholesky)
#define CALL_SUBTEST_23(FUNC)
void test_simplicial_cholesky_T()
#define CALL_SUBTEST_21(FUNC)
#define EIGEN_TEST_MAX_SIZE
A direct sparse LLT Cholesky factorizations.
void check_sparse_spd_solving(Solver &solver, int maxSize=(std::min)(300, EIGEN_TEST_MAX_SIZE), int maxRealWorldSize=100000)


gtsam
Author(s):
autogenerated on Tue Jul 4 2023 02:35:43