Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
dune-istl
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Core Modules
dune-istl
Commits
f54c5442
Commit
f54c5442
authored
16 years ago
by
Markus Blatt
Browse files
Options
Downloads
Patches
Plain Diff
More documentation.
[[Imported from SVN: r968]]
parent
4851ae06
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
doc/doxygen/modules
+41
-2
41 additions, 2 deletions
doc/doxygen/modules
with
41 additions
and
2 deletions
doc/doxygen/modules
+
41
−
2
View file @
f54c5442
/**
/**
@defgroup ISTL
@defgroup ISTL Iterative Solvers Template Library (ISTL)
*/
@brief Iterative Solvers supporting block recursive matrix and
vector classes at compile time.
The Iterative Solver Template Library applies generic programming
in C++ to the
domain of iterative solvers of linear systems stemming
from finite element discretizations. Those discretizations exhibit a
lot of structure, e.g:
<ol>
<li>Certain discretizations for systems of PDEs or higher order
methods result in matrices where individual entries are replaced by
small blocks, say of size \f$2\times 2\f$ or \f$4\times 4\f$.
Dense blocks of different sizes
e.g. arise in \f$hp\f$ Discontinuous Galerkin discretization methods.
It is straightforward and
efficient to treat these small dense blocks as fully coupled and
solve them with direct methods within the iterative method.</li>
<li>Equation-wise ordering for systems results in matrices having an
\f$n\times n\f$ block structure where \f$n\f$ corresponds to the number of
variables in the PDE and the blocks themselves are large and sparse. As an
example we mention the Stokes system. </li>
<li>Other discretisation, e.~g. those of reaction/diffusion
systems, produce sparse matrices whose blocks are
sparse matrices of small dense blocks,</li>
</ol>
Our matrix
and vector interface supports a block recursive structure. Each
sparse matrix entry can itself be either a sparse or a small
dense matrix.
The solvers use this recursive block structure via template meta
programming at compile time.
ISTL consists of the \ref ISTL_SPMV "matrix and vector API" and
the \ref ISTL_Solvers "solvers" which use the \ref ISTL_Prec preconditioners.
*/
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment