gmres.cpp
Go to the documentation of this file.
00001 // This file is part of Eigen, a lightweight C++ template library
00002 // for linear algebra.
00003 //
00004 // Copyright (C) 2011 Gael Guennebaud <g.gael@free.fr>
00005 // Copyright (C) 2012 Kolja Brix <brix@igpm.rwth-aaachen.de>
00006 //
00007 // This Source Code Form is subject to the terms of the Mozilla
00008 // Public License v. 2.0. If a copy of the MPL was not distributed
00009 // with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
00010 
00011 #include "../../test/sparse_solver.h"
00012 #include <Eigen/IterativeSolvers>
00013 
00014 template<typename T> void test_gmres_T()
00015 {
00016   GMRES<SparseMatrix<T>, DiagonalPreconditioner<T> > gmres_colmajor_diag;
00017   GMRES<SparseMatrix<T>, IdentityPreconditioner    > gmres_colmajor_I;
00018   GMRES<SparseMatrix<T>, IncompleteLUT<T> >           gmres_colmajor_ilut;
00019   //GMRES<SparseMatrix<T>, SSORPreconditioner<T> >     gmres_colmajor_ssor;
00020 
00021   CALL_SUBTEST( check_sparse_square_solving(gmres_colmajor_diag)  );
00022 //   CALL_SUBTEST( check_sparse_square_solving(gmres_colmajor_I)     );
00023   CALL_SUBTEST( check_sparse_square_solving(gmres_colmajor_ilut)     );
00024   //CALL_SUBTEST( check_sparse_square_solving(gmres_colmajor_ssor)     );
00025 }
00026 
00027 void test_gmres()
00028 {
00029   CALL_SUBTEST_1(test_gmres_T<double>());
00030   CALL_SUBTEST_2(test_gmres_T<std::complex<double> >());
00031 }


shape_reconstruction
Author(s): Roberto Martín-Martín
autogenerated on Sat Jun 8 2019 18:31:28