|
Reference documentation for deal.II version 9.2.0
|
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\)
\(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\)
\(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\)
\(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Go to the documentation of this file.
17 #ifndef dealii_sparse_ilu_h
18 #define dealii_sparse_ilu_h
60 template <
typename number>
100 template <
typename somenumber>
111 template <
typename somenumber>
122 template <
typename somenumber>
144 <<
"The strengthening parameter " << arg1
145 <<
" is not greater or equal than zero!");
151 <<
"While computing the ILU decomposition, the algorithm "
152 "found a zero pivot on the diagonal of row "
154 <<
". This must stop the ILU algorithm because it means "
155 "that the matrix for which you try to compute a "
156 "decomposition is singular.");
166 #endif // dealii_sparse_ilu_h
void Tvmult(Vector< somenumber > &dst, const Vector< somenumber > &src) const
typename SparseMatrix< number >::size_type size_type
#define DEAL_II_NAMESPACE_OPEN
@ matrix
Contents is actually a matrix.
std::size_t memory_consumption() const override
static ::ExceptionBase & ExcInvalidStrengthening(double arg1)
void initialize(const SparseMatrix< somenumber > &matrix, const AdditionalData ¶meters=AdditionalData())
#define DeclException1(Exception1, type1, outsequence)
typename SparseLUDecomposition< number >::AdditionalData AdditionalData
void vmult(Vector< somenumber > &dst, const Vector< somenumber > &src) const
static ::ExceptionBase & ExcZeroPivot(size_type arg1)
#define DEAL_II_NAMESPACE_CLOSE