diff options
author | Gael Guennebaud <g.gael@free.fr> | 2011-11-12 15:22:35 +0100 |
---|---|---|
committer | Gael Guennebaud <g.gael@free.fr> | 2011-11-12 15:22:35 +0100 |
commit | cb2f1944e2c4d44c9488d7a71340dc905d4271e9 (patch) | |
tree | 639c547e56357606af8310c38c4a76b3cb612876 /Eigen/IterativeLinearSolvers | |
parent | 53fa8517245e0136c83b77526b05ce67de232a56 (diff) |
add the new module headers
Diffstat (limited to 'Eigen/IterativeLinearSolvers')
-rw-r--r-- | Eigen/IterativeLinearSolvers | 37 |
1 files changed, 37 insertions, 0 deletions
diff --git a/Eigen/IterativeLinearSolvers b/Eigen/IterativeLinearSolvers new file mode 100644 index 000000000..a6f29b07e --- /dev/null +++ b/Eigen/IterativeLinearSolvers @@ -0,0 +1,37 @@ +#ifndef EIGEN_ITERATIVELINEARSOLVERS_MODULE_H +#define EIGEN_ITERATIVELINEARSOLVERS_MODULE_H + +#include "SparseCore" + +#include "../../Eigen/src/Core/util/DisableStupidWarnings.h" + +namespace Eigen { + +/** \ingroup Sparse_modules + * \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: + * - ConjugateGrdient for selfadjoint (hermitian) matrices, + * - BiCGSTAB for general square matrices. + * + * Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, CholmodSupport, UmfPackSupport, SuperLUSupport. + * + * \code + * #include <Eigen/IterativeLinearSolvers> + * \endcode + */ + +#include "src/misc/Solve.h" +#include "src/misc/SparseSolve.h" + +#include "src/IterativeLinearSolvers/IterativeSolverBase.h" +#include "src/IterativeLinearSolvers/BasicPreconditioners.h" +#include "src/IterativeLinearSolvers/ConjugateGradient.h" +#include "src/IterativeLinearSolvers/BiCGSTAB.h" + +} // namespace Eigen + +#include "../../Eigen/src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_ITERATIVELINEARSOLVERS_MODULE_H |