mirror of
https://gitlab.com/libeigen/eigen.git
synced 2024-12-15 07:10:37 +08:00
93ee82b1fd
- Organize the documentation into "chapters". - Each chapter include many documentation pages, reference pages organized as modules, and a quick reference page. - The "Chapters" tree is created using the defgroup/ingroup mechanism, even for the documentation pages (i.e., .dox files for which I added an \eigenManualPage macro that we can switch between \page or \defgroup ). - Add a "General topics" entry for all pages that do not fit well in the previous "chapters". - The highlevel struture is managed by a new eigendoxy_layout.xml file. - remove the "index" and quite useless pages (namespace list, class hierarchy, member list, file list, etc.) - add the javascript search-engine. - add the "treeview" panel. - remove \tableofcontents (replace them by a custom \eigenAutoToc macro to be able to easily re-enable if needed). - add javascript to automatically generate a TOC from the h1/h2 tags of the current page, and put the TOC in the left side panel. - overload various javascript function generated by doxygen to: - remove the root of the treeview - remove links to section/subsection from the treeview - automatically expand the "Chapters" section - automatically expand the current section - adjust the height of the treeview to take into account the TOC - always use the default .css file, eigendoxy.css now only includes our modifications - use Doxyfile to specify our logo - remove cross references to unsupported modules (temporarily)
41 lines
1.6 KiB
Plaintext
41 lines
1.6 KiB
Plaintext
#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,
|
|
* - 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.
|
|
* - IncompleteILUT - 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/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"
|
|
#include "src/IterativeLinearSolvers/IncompleteLUT.h"
|
|
|
|
#include "src/Core/util/ReenableStupidWarnings.h"
|
|
|
|
#endif // EIGEN_ITERATIVELINEARSOLVERS_MODULE_H
|