manolas
/
threed-beam-fea
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
threed-beam-fea/ext/eigen-3.3.4/Eigen/IterativeLinearSolvers

49 lines
2.0 KiB
Plaintext
Raw Normal View History

Updated to latest versions of external libraries: Eigen 3.2.9 -> 3.3.4, gtest 1.7.0 -> 1.8.0, boost 1.59.0 -> 1.65.1, rapidjson 1.0.2 -> 1.1.0.
2017-10-24 23:57:35 +02:00
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
Initial commit of open source version.
2015-11-05 19:36:26 +01:00
#ifndef EIGEN_ITERATIVELINEARSOLVERS_MODULE_H
#define EIGEN_ITERATIVELINEARSOLVERS_MODULE_H
#include "SparseCore"
#include "OrderingMethods"
#include "src/Core/util/DisableStupidWarnings.h"
/**
* \defgroup IterativeLinearSolvers_Module IterativeLinearSolvers module
*
* This module currently provides iterative methods to solve problems of the form \c A \c x = \c b, where \c A is a squared matrix, usually very large and sparse.
* Those solvers are accessible via the following classes:
* - ConjugateGradient for selfadjoint (hermitian) matrices,
Updated to latest versions of external libraries: Eigen 3.2.9 -> 3.3.4, gtest 1.7.0 -> 1.8.0, boost 1.59.0 -> 1.65.1, rapidjson 1.0.2 -> 1.1.0.
2017-10-24 23:57:35 +02:00
* - LeastSquaresConjugateGradient for rectangular least-square problems,
Initial commit of open source version.
2015-11-05 19:36:26 +01:00
* - BiCGSTAB for general square matrices.
*
* These iterative solvers are associated with some preconditioners:
* - IdentityPreconditioner - not really useful
Updated to latest versions of external libraries: Eigen 3.2.9 -> 3.3.4, gtest 1.7.0 -> 1.8.0, boost 1.59.0 -> 1.65.1, rapidjson 1.0.2 -> 1.1.0.
2017-10-24 23:57:35 +02:00
* - DiagonalPreconditioner - also called Jacobi preconditioner, work very well on diagonal dominant matrices.
* - IncompleteLUT - incomplete LU factorization with dual thresholding
Initial commit of open source version.
2015-11-05 19:36:26 +01:00
*
* Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, CholmodSupport, UmfPackSupport, SuperLUSupport.
*
Updated to latest versions of external libraries: Eigen 3.2.9 -> 3.3.4, gtest 1.7.0 -> 1.8.0, boost 1.59.0 -> 1.65.1, rapidjson 1.0.2 -> 1.1.0.
2017-10-24 23:57:35 +02:00
\code
#include <Eigen/IterativeLinearSolvers>
\endcode
Initial commit of open source version.
2015-11-05 19:36:26 +01:00
*/
Updated to latest versions of external libraries: Eigen 3.2.9 -> 3.3.4, gtest 1.7.0 -> 1.8.0, boost 1.59.0 -> 1.65.1, rapidjson 1.0.2 -> 1.1.0.
2017-10-24 23:57:35 +02:00
#include "src/IterativeLinearSolvers/SolveWithGuess.h"
Initial commit of open source version.
2015-11-05 19:36:26 +01:00
#include "src/IterativeLinearSolvers/IterativeSolverBase.h"
#include "src/IterativeLinearSolvers/BasicPreconditioners.h"
#include "src/IterativeLinearSolvers/ConjugateGradient.h"
Updated to latest versions of external libraries: Eigen 3.2.9 -> 3.3.4, gtest 1.7.0 -> 1.8.0, boost 1.59.0 -> 1.65.1, rapidjson 1.0.2 -> 1.1.0.
2017-10-24 23:57:35 +02:00
#include "src/IterativeLinearSolvers/LeastSquareConjugateGradient.h"
Initial commit of open source version.
2015-11-05 19:36:26 +01:00
#include "src/IterativeLinearSolvers/BiCGSTAB.h"
#include "src/IterativeLinearSolvers/IncompleteLUT.h"
Updated to latest versions of external libraries: Eigen 3.2.9 -> 3.3.4, gtest 1.7.0 -> 1.8.0, boost 1.59.0 -> 1.65.1, rapidjson 1.0.2 -> 1.1.0.
2017-10-24 23:57:35 +02:00
#include "src/IterativeLinearSolvers/IncompleteCholesky.h"
Initial commit of open source version.
2015-11-05 19:36:26 +01:00
#include "src/Core/util/ReenableStupidWarnings.h"
#endif // EIGEN_ITERATIVELINEARSOLVERS_MODULE_H