devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Clang-format tests, examples, libraries, benchmarks, etc.

Browse Source
This commit is contained in:
Antonio Sánchez
2023-12-05 21:22:55 +00:00
committed by Rasmus Munk Larsen
parent 3252ecc7a4
commit 46e9cdb7fe
876 changed files with 33453 additions and 37795 deletions
Download Patch File Download Diff File Expand all files Collapse all files

69
test/incomplete_cholesky.cpp
View File

@@ -11,58 +11,53 @@
#include "sparse_solver.h"
#include <Eigen/IterativeLinearSolvers>
template<typename T, typename I_> void test_incomplete_cholesky_T()
{
typedef SparseMatrix<T,0,I_> SparseMatrixType;
ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, AMDOrdering<I_> > > cg_illt_lower_amd;
ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, NaturalOrdering<I_> > > cg_illt_lower_nat;
ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, AMDOrdering<I_> > > cg_illt_upper_amd;
ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, NaturalOrdering<I_> > > cg_illt_upper_nat;
ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I_> > > cg_illt_uplo_amd;
template <typename T, typename I_>
void test_incomplete_cholesky_T() {
typedef SparseMatrix<T, 0, I_> SparseMatrixType;
ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, AMDOrdering<I_> > > cg_illt_lower_amd;
ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, NaturalOrdering<I_> > > cg_illt_lower_nat;
ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, AMDOrdering<I_> > > cg_illt_upper_amd;
ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, NaturalOrdering<I_> > > cg_illt_upper_nat;
ConjugateGradient<SparseMatrixType, Upper | Lower, IncompleteCholesky<T, Lower, AMDOrdering<I_> > > cg_illt_uplo_amd;
CALL_SUBTEST( check_sparse_spd_solving(cg_illt_lower_amd) );
CALL_SUBTEST( check_sparse_spd_solving(cg_illt_lower_nat) );
CALL_SUBTEST( check_sparse_spd_solving(cg_illt_upper_amd) );
CALL_SUBTEST( check_sparse_spd_solving(cg_illt_upper_nat) );
CALL_SUBTEST( check_sparse_spd_solving(cg_illt_uplo_amd) );
CALL_SUBTEST(check_sparse_spd_solving(cg_illt_lower_amd));
CALL_SUBTEST(check_sparse_spd_solving(cg_illt_lower_nat));
CALL_SUBTEST(check_sparse_spd_solving(cg_illt_upper_amd));
CALL_SUBTEST(check_sparse_spd_solving(cg_illt_upper_nat));
CALL_SUBTEST(check_sparse_spd_solving(cg_illt_uplo_amd));
}
template<int>
void bug1150()
{
template <int>
void bug1150() {
// regression for bug 1150
for(int N = 1; N<20; ++N)
{
Eigen::MatrixXd b( N, N );
for (int N = 1; N < 20; ++N) {
Eigen::MatrixXd b(N, N);
b.setOnes();
Eigen::SparseMatrix<double> m( N, N );
m.reserve(Eigen::VectorXi::Constant(N,4));
for( int i = 0; i < N; ++i )
{
m.insert( i, i ) = 1;
m.coeffRef( i, i / 2 ) = 2;
m.coeffRef( i, i / 3 ) = 2;
m.coeffRef( i, i / 4 ) = 2;
Eigen::SparseMatrix<double> m(N, N);
m.reserve(Eigen::VectorXi::Constant(N, 4));
for (int i = 0; i < N; ++i) {
m.insert(i, i) = 1;
m.coeffRef(i, i / 2) = 2;
m.coeffRef(i, i / 3) = 2;
m.coeffRef(i, i / 4) = 2;
}
Eigen::SparseMatrix<double> A;
A = m * m.transpose();
Eigen::ConjugateGradient<Eigen::SparseMatrix<double>,
Eigen::Lower | Eigen::Upper,
Eigen::IncompleteCholesky<double> > solver( A );
Eigen::ConjugateGradient<Eigen::SparseMatrix<double>, Eigen::Lower | Eigen::Upper,
Eigen::IncompleteCholesky<double> >
solver(A);
VERIFY(solver.preconditioner().info() == Eigen::Success);
VERIFY(solver.info() == Eigen::Success);
}
}
EIGEN_DECLARE_TEST(incomplete_cholesky)
{
CALL_SUBTEST_1(( test_incomplete_cholesky_T<double,int>() ));
CALL_SUBTEST_2(( test_incomplete_cholesky_T<std::complex<double>, int>() ));
CALL_SUBTEST_3(( test_incomplete_cholesky_T<double,long int>() ));
EIGEN_DECLARE_TEST(incomplete_cholesky) {
CALL_SUBTEST_1((test_incomplete_cholesky_T<double, int>()));
CALL_SUBTEST_2((test_incomplete_cholesky_T<std::complex<double>, int>()));
CALL_SUBTEST_3((test_incomplete_cholesky_T<double, long int>()));
CALL_SUBTEST_1(( bug1150<0>() ));
CALL_SUBTEST_1((bug1150<0>()));
}