Reference documentation for deal.II version Git ca6ed5c 2017-11-20 14:53:00 +0100
SparseILU< number > Member List

This is the complete list of members for SparseILU< number >, including all inherited members.

add(const size_type i, const size_type j, const number value)SparseMatrix< number >protected
add(const std::vector< size_type > &indices, const FullMatrix< number2 > &full_matrix, const bool elide_zero_values=true)SparseMatrix< number >protected
add(const std::vector< size_type > &row_indices, const std::vector< size_type > &col_indices, const FullMatrix< number2 > &full_matrix, const bool elide_zero_values=true)SparseMatrix< number >protected
add(const size_type row, const std::vector< size_type > &col_indices, const std::vector< number2 > &values, const bool elide_zero_values=true)SparseMatrix< number >protected
add(const size_type row, const size_type n_cols, const size_type *col_indices, const number2 *values, const bool elide_zero_values=true, const bool col_indices_are_sorted=false)SparseMatrix< number >protected
add(const number factor, const SparseMatrix< somenumber > &matrix)SparseMatrix< number >protected
AdditionalData typedefSparseILU< number >
begin() const SparseMatrix< number >protected
begin()SparseMatrix< number >protected
begin(const size_type r) const SparseMatrix< number >protected
begin(const size_type r)SparseMatrix< number >protected
block_read(std::istream &in)SparseMatrix< number >protected
block_write(std::ostream &out) const SparseMatrix< number >protected
clear()SparseLUDecomposition< number >virtual
compress(::VectorOperation::values)SparseMatrix< number >protected
const_iterator typedefSparseMatrix< number >protected
copy_from(const SparseMatrix< somenumber > &matrix)SparseLUDecomposition< number >protected
SparseMatrix::copy_from(const ForwardIterator begin, const ForwardIterator end)SparseMatrix< number >protected
SparseMatrix::copy_from(const FullMatrix< somenumber > &matrix)SparseMatrix< number >protected
SparseMatrix::copy_from(const TrilinosWrappers::SparseMatrix &matrix)SparseMatrix< number >protected
diag_element(const size_type i) const SparseMatrix< number >protected
diag_element(const size_type i)SparseMatrix< number >protected
el(const size_type i, const size_type j) const SparseMatrix< number >protected
empty() const SparseLUDecomposition< number >
end() const SparseMatrix< number >protected
end()SparseMatrix< number >protected
end(const size_type r) const SparseMatrix< number >protected
end(const size_type r)SparseMatrix< number >protected
ExcDifferentSparsityPatterns()SparseMatrix< number >protectedstatic
SparseMatrix::ExcInUse(int arg1, char *arg2, std::string &arg3)Subscriptorprotectedstatic
Subscriptor::ExcInUse(int arg1, char *arg2, std::string &arg3)Subscriptorstatic
ExcInvalidIndex(int arg1, int arg2)SparseMatrix< number >protectedstatic
ExcInvalidStrengthening(double arg1)SparseILU< number >static
ExcIteratorRange(int arg1, int arg2)SparseMatrix< number >protectedstatic
SparseMatrix::ExcNoSubscriber(char *arg1, char *arg2)Subscriptorprotectedstatic
Subscriptor::ExcNoSubscriber(char *arg1, char *arg2)Subscriptorstatic
ExcSourceEqualsDestination()SparseMatrix< number >protectedstatic
ExcZeroPivot(size_type arg1)SparseILU< number >static
frobenius_norm() const SparseMatrix< number >protected
get_row_length(const size_type row) const SparseMatrix< number >protected
get_sparsity_pattern() const SparseMatrix< number >protected
get_strengthen_diagonal(const number rowsum, const size_type row) const SparseLUDecomposition< number >protectedvirtual
initialize(const SparseMatrix< somenumber > &matrix, const AdditionalData &parameters=AdditionalData())SparseILU< number >
SparseLUDecomposition::initialize(const SparseMatrix< somenumber > &matrix, const AdditionalData parameters)SparseLUDecomposition< number >
iterator typedefSparseMatrix< number >protected
Jacobi_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >protected
l1_norm() const SparseMatrix< number >protected
linfty_norm() const SparseMatrix< number >protected
SparseMatrix::list_subscribers() const Subscriptorprotected
Subscriptor::list_subscribers() const Subscriptor
m() const SparseLUDecomposition< number >
matrix_norm_square(const Vector< somenumber > &v) const SparseMatrix< number >protected
matrix_scalar_product(const Vector< somenumber > &u, const Vector< somenumber > &v) const SparseMatrix< number >protected
memory_consumption() const SparseILU< number >virtual
mmult(SparseMatrix< numberC > &C, const SparseMatrix< numberB > &B, const Vector< number > &V=Vector< number >(), const bool rebuild_sparsity_pattern=true) const SparseMatrix< number >protected
n() const SparseLUDecomposition< number >
n_actually_nonzero_elements(const double threshold=0.) const SparseMatrix< number >protected
n_nonzero_elements() const SparseMatrix< number >protected
SparseMatrix::n_subscriptions() const Subscriptorprotected
Subscriptor::n_subscriptions() const Subscriptor
operator()(const size_type i, const size_type j) const SparseMatrix< number >protected
operator*=(const number factor)SparseMatrix< number >protected
operator/=(const number factor)SparseMatrix< number >protected
operator=(const SparseMatrix< number > &)SparseMatrix< number >protected
operator=(SparseMatrix< number > &&m)SparseMatrix< number >protected
operator=(const IdentityMatrix &id)SparseMatrix< number >protected
operator=(const double d)SparseMatrix< number >protected
SparseMatrix::Subscriptor::operator=(const Subscriptor &)Subscriptorprotected
SparseMatrix::Subscriptor::operator=(Subscriptor &&)Subscriptorprotected
Subscriptor::operator=(const Subscriptor &)Subscriptor
Subscriptor::operator=(Subscriptor &&)Subscriptor
prebuild_lower_bound()SparseLUDecomposition< number >protected
prebuilt_lower_boundSparseLUDecomposition< number >protected
precondition_Jacobi(Vector< somenumber > &dst, const Vector< somenumber > &src, const number omega=1.) const SparseMatrix< number >protected
precondition_SOR(Vector< somenumber > &dst, const Vector< somenumber > &src, const number om=1.) const SparseMatrix< number >protected
precondition_SSOR(Vector< somenumber > &dst, const Vector< somenumber > &src, const number omega=1., const std::vector< std::size_t > &pos_right_of_diagonal=std::vector< std::size_t >()) const SparseMatrix< number >protected
precondition_TSOR(Vector< somenumber > &dst, const Vector< somenumber > &src, const number om=1.) const SparseMatrix< number >protected
prepare_add()SparseMatrix< number >protected
prepare_set()SparseMatrix< number >protected
print(StreamType &out, const bool across=false, const bool diagonal_first=true) const SparseMatrix< number >protected
print_formatted(std::ostream &out, const unsigned int precision=3, const bool scientific=true, const unsigned int width=0, const char *zero_string=" ", const double denominator=1.) const SparseMatrix< number >protected
print_pattern(std::ostream &out, const double threshold=0.) const SparseMatrix< number >protected
PSOR(Vector< somenumber > &v, const std::vector< size_type > &permutation, const std::vector< size_type > &inverse_permutation, const number om=1.) const SparseMatrix< number >protected
real_type typedefSparseMatrix< number >protected
reinit(const SparsityPattern &sparsity)SparseMatrix< number >protectedvirtual
residual(Vector< somenumber > &dst, const Vector< somenumber > &x, const Vector< somenumber > &b) const SparseMatrix< number >protected
SparseMatrix::serialize(Archive &ar, const unsigned int version)Subscriptorinlineprotected
Subscriptor::serialize(Archive &ar, const unsigned int version)Subscriptorinline
set(const size_type i, const size_type j, const number value)SparseMatrix< number >protected
set(const std::vector< size_type > &indices, const FullMatrix< number2 > &full_matrix, const bool elide_zero_values=false)SparseMatrix< number >protected
set(const std::vector< size_type > &row_indices, const std::vector< size_type > &col_indices, const FullMatrix< number2 > &full_matrix, const bool elide_zero_values=false)SparseMatrix< number >protected
set(const size_type row, const std::vector< size_type > &col_indices, const std::vector< number2 > &values, const bool elide_zero_values=false)SparseMatrix< number >protected
set(const size_type row, const size_type n_cols, const size_type *col_indices, const number2 *values, const bool elide_zero_values=false)SparseMatrix< number >protected
size_type typedefSparseILU< number >
SOR(Vector< somenumber > &v, const number om=1.) const SparseMatrix< number >protected
SOR_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >protected
SparseILU()=defaultSparseILU< number >
SparseLUDecomposition()SparseLUDecomposition< number >protected
SparseMatrix()SparseMatrix< number >protected
SparseMatrix(const SparseMatrix &)SparseMatrix< number >protected
SparseMatrix(SparseMatrix< number > &&m)SparseMatrix< number >protected
SparseMatrix(const SparsityPattern &sparsity)SparseMatrix< number >explicitprotected
SparseMatrix(const SparsityPattern &sparsity, const IdentityMatrix &id)SparseMatrix< number >protected
SSOR(Vector< somenumber > &v, const number omega=1.) const SparseMatrix< number >protected
SSOR_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >protected
strengthen_diagonalSparseLUDecomposition< number >protected
strengthen_diagonal_impl()SparseLUDecomposition< number >protectedvirtual
SparseMatrix::subscribe(const char *identifier=nullptr) const Subscriptorprotected
Subscriptor::subscribe(const char *identifier=nullptr) const Subscriptor
SparseMatrix::Subscriptor()Subscriptorprotected
SparseMatrix::Subscriptor(const Subscriptor &)Subscriptorprotected
SparseMatrix::Subscriptor(Subscriptor &&)Subscriptorprotected
Subscriptor::Subscriptor()Subscriptor
Subscriptor::Subscriptor(const Subscriptor &)Subscriptor
Subscriptor::Subscriptor(Subscriptor &&)Subscriptor
symmetrize()SparseMatrix< number >protected
Tmmult(SparseMatrix< numberC > &C, const SparseMatrix< numberB > &B, const Vector< number > &V=Vector< number >(), const bool rebuild_sparsity_pattern=true) const SparseMatrix< number >protected
TPSOR(Vector< somenumber > &v, const std::vector< size_type > &permutation, const std::vector< size_type > &inverse_permutation, const number om=1.) const SparseMatrix< number >protected
TSOR(Vector< somenumber > &v, const number om=1.) const SparseMatrix< number >protected
TSOR_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >protected
Tvmult(Vector< somenumber > &dst, const Vector< somenumber > &src) const SparseILU< number >
SparseLUDecomposition::Tvmult(OutVector &dst, const InVector &src) const SparseMatrix< number >
Tvmult_add(OutVector &dst, const InVector &src) const SparseLUDecomposition< number >
SparseMatrix::unsubscribe(const char *identifier=nullptr) const Subscriptorprotected
Subscriptor::unsubscribe(const char *identifier=nullptr) const Subscriptor
value_type typedefSparseMatrix< number >protected
vmult(Vector< somenumber > &dst, const Vector< somenumber > &src) const SparseILU< number >
SparseLUDecomposition::vmult(OutVector &dst, const InVector &src) const SparseMatrix< number >
vmult_add(OutVector &dst, const InVector &src) const SparseLUDecomposition< number >
~SparseLUDecomposition()=0SparseLUDecomposition< number >pure virtual
~SparseMatrix()SparseMatrix< number >protectedvirtual
~Subscriptor()Subscriptorprotectedvirtual