idrs.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 // Copyright (C) 2012 Kolja Brix <brix@igpm.rwth-aaachen.de>
6 //
7 // This Source Code Form is subject to the terms of the Mozilla
8 // Public License v. 2.0. If a copy of the MPL was not distributed
9 // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
10 
11 #include "../../test/sparse_solver.h"
12 #include <Eigen/IterativeSolvers>
13 
14 template<typename T> void test_idrs_T()
15 {
16  IDRS<SparseMatrix<T>, DiagonalPreconditioner<T> > idrs_colmajor_diag;
17  IDRS<SparseMatrix<T>, IncompleteLUT<T> > idrs_colmajor_ilut;
18 
19  CALL_SUBTEST( check_sparse_square_solving(idrs_colmajor_diag) );
20  CALL_SUBTEST( check_sparse_square_solving(idrs_colmajor_ilut) );
21 }
22 
24 {
25  CALL_SUBTEST_1(test_idrs_T<double>());
26  CALL_SUBTEST_2(test_idrs_T<std::complex<double> >());
27 }
A preconditioner based on the digonal entries.
The Induced Dimension Reduction method (IDR(s)) is a short-recurrences Krylov method for sparse squar...
Definition: IDRS.h:275
void test_idrs_T()
Definition: idrs.cpp:14
#define CALL_SUBTEST_1(FUNC)
EIGEN_DECLARE_TEST(idrs)
Definition: idrs.cpp:23
Incomplete LU factorization with dual-threshold strategy.
Definition: IncompleteLUT.h:99
#define CALL_SUBTEST(FUNC)
Definition: main.h:399
#define CALL_SUBTEST_2(FUNC)
bool idrs(const MatrixType &A, const Rhs &b, Dest &x, const Preconditioner &precond, Index &iter, typename Dest::RealScalar &relres, Index S, bool smoothing, typename Dest::RealScalar angle, bool replacement)
Definition: IDRS.h:59
void check_sparse_square_solving(Solver &solver, int maxSize=300, int maxRealWorldSize=100000, bool checkDeficient=false)


gtsam
Author(s):
autogenerated on Tue Jul 4 2023 02:34:21