diff options
| author | Nao Pross <np@0hm.ch> | 2024-02-12 15:23:24 +0100 |
|---|---|---|
| committer | Nao Pross <np@0hm.ch> | 2024-02-12 15:23:24 +0100 |
| commit | fbd6758fb4649b146176dbbc2dfe9384c69ef58d (patch) | |
| tree | 0993d5c74a5cd1773ff9a572e4926d3102c0299f /src/Eigen/IterativeLinearSolvers | |
| parent | Move into version control (diff) | |
| download | fsisotool-fbd6758fb4649b146176dbbc2dfe9384c69ef58d.tar.gz fsisotool-fbd6758fb4649b146176dbbc2dfe9384c69ef58d.zip | |
Remove old stuff with Eigen
Diffstat (limited to '')
| -rw-r--r-- | src/Eigen/IterativeLinearSolvers | 48 |
1 files changed, 0 insertions, 48 deletions
diff --git a/src/Eigen/IterativeLinearSolvers b/src/Eigen/IterativeLinearSolvers deleted file mode 100644 index 957d575..0000000 --- a/src/Eigen/IterativeLinearSolvers +++ /dev/null @@ -1,48 +0,0 @@ -// 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/. - -#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, - * - LeastSquaresConjugateGradient for rectangular least-square problems, - * - BiCGSTAB for general square matrices. - * - * These iterative solvers are associated with some preconditioners: - * - IdentityPreconditioner - not really useful - * - DiagonalPreconditioner - also called Jacobi preconditioner, work very well on diagonal dominant matrices. - * - IncompleteLUT - incomplete LU factorization with dual thresholding - * - * Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, CholmodSupport, UmfPackSupport, SuperLUSupport. - * - \code - #include <Eigen/IterativeLinearSolvers> - \endcode - */ - -#include "src/IterativeLinearSolvers/SolveWithGuess.h" -#include "src/IterativeLinearSolvers/IterativeSolverBase.h" -#include "src/IterativeLinearSolvers/BasicPreconditioners.h" -#include "src/IterativeLinearSolvers/ConjugateGradient.h" -#include "src/IterativeLinearSolvers/LeastSquareConjugateGradient.h" -#include "src/IterativeLinearSolvers/BiCGSTAB.h" -#include "src/IterativeLinearSolvers/IncompleteLUT.h" -#include "src/IterativeLinearSolvers/IncompleteCholesky.h" - -#include "src/Core/util/ReenableStupidWarnings.h" - -#endif // EIGEN_ITERATIVELINEARSOLVERS_MODULE_H |