Reference documentation for deal.II version 9.2.0
|
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 typedef | SparseILU< 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 |
SparseMatrix::check_no_subscribers() const noexcept | Subscriptor | private |
clear() override | SparseLUDecomposition< number > | virtual |
cols | SparseMatrix< number > | private |
compress(::VectorOperation::values) | SparseMatrix< number > | protected |
const_iterator typedef | SparseMatrix< 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 |
SparseMatrix::counter | Subscriptor | mutableprivate |
SparseMatrix::counter_map | Subscriptor | mutableprivate |
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, std::string arg2, std::string arg3) | Subscriptor | protectedstatic |
Subscriptor::ExcInUse(int arg1, std::string arg2, std::string arg3) | Subscriptor | static |
ExcInvalidIndex(int arg1, int arg2) | SparseMatrix< number > | protectedstatic |
ExcInvalidStrengthening(double arg1) | SparseILU< number > | static |
ExcIteratorRange(int arg1, int arg2) | SparseMatrix< number > | protectedstatic |
SparseMatrix::ExcNoSubscriber(std::string arg1, std::string arg2) | Subscriptor | protectedstatic |
Subscriptor::ExcNoSubscriber(std::string arg1, std::string arg2) | Subscriptor | static |
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 ¶meters=AdditionalData()) | SparseILU< number > | |
SparseLUDecomposition::initialize(const SparseMatrix< somenumber > &matrix, const AdditionalData parameters) | SparseLUDecomposition< number > | |
iterator typedef | SparseMatrix< 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(StreamType &stream) const | Subscriptor | inlineprotected |
SparseMatrix::list_subscribers() const | Subscriptor | protected |
Subscriptor::list_subscribers(StreamType &stream) const | Subscriptor | inline |
Subscriptor::list_subscribers() const | Subscriptor | |
m() const | SparseLUDecomposition< number > | |
SparseMatrix::map_iterator typedef | Subscriptor | private |
SparseMatrix::map_value_type typedef | Subscriptor | private |
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 |
max_len | SparseMatrix< number > | private |
memory_consumption() const override | 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 |
SparseMatrix::mutex | Subscriptor | privatestatic |
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 | Subscriptor | inlineprotected |
Subscriptor::n_subscriptions() const | Subscriptor | inline |
SparseMatrix::object_info | Subscriptor | mutableprivate |
operator()(const size_type i, const size_type j) const | SparseMatrix< number > | protected |
operator()(const size_type i, const size_type j) | 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) noexcept | SparseMatrix< number > | protected |
operator=(const IdentityMatrix &id) | SparseMatrix< number > | protected |
operator=(const double d) | SparseMatrix< number > | protected |
SparseMatrix::Subscriptor::operator=(const Subscriptor &) | Subscriptor | inlineprotected |
SparseMatrix::Subscriptor::operator=(Subscriptor &&) noexcept | Subscriptor | protected |
Subscriptor::operator=(const Subscriptor &) | Subscriptor | inline |
Subscriptor::operator=(Subscriptor &&) noexcept | Subscriptor | |
own_sparsity | SparseLUDecomposition< number > | private |
prebuild_lower_bound() | SparseLUDecomposition< number > | protected |
prebuilt_lower_bound | SparseLUDecomposition< 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_as_numpy_arrays(std::ostream &out, const unsigned int precision=9) 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 typedef | SparseMatrix< 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) | Subscriptor | inlineprotected |
Subscriptor::serialize(Archive &ar, const unsigned int version) | Subscriptor | inline |
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 typedef | SparseILU< 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()=default | SparseILU< number > | |
SparseLUDecomposition() | SparseLUDecomposition< number > | protected |
SparseMatrix() | SparseMatrix< number > | protected |
SparseMatrix(const SparseMatrix &) | SparseMatrix< number > | protected |
SparseMatrix(SparseMatrix< number > &&m) noexcept | 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_diagonal | SparseLUDecomposition< number > | protected |
strengthen_diagonal_impl() | SparseLUDecomposition< number > | protectedvirtual |
SparseMatrix::subscribe(std::atomic< bool > *const validity, const std::string &identifier="") const | Subscriptor | protected |
Subscriptor::subscribe(std::atomic< bool > *const validity, const std::string &identifier="") const | Subscriptor | |
SparseMatrix::Subscriptor() | Subscriptor | inlineprotected |
SparseMatrix::Subscriptor(const Subscriptor &) | Subscriptor | inlineprotected |
SparseMatrix::Subscriptor(Subscriptor &&) noexcept | Subscriptor | protected |
Subscriptor::Subscriptor() | Subscriptor | inline |
Subscriptor::Subscriptor(const Subscriptor &) | Subscriptor | inline |
Subscriptor::Subscriptor(Subscriptor &&) noexcept | Subscriptor | |
sum(const SparseMatrix< Number > &local, const MPI_Comm &mpi_communicator, SparseMatrix< Number > &global) | SparseMatrix< number > | related |
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(std::atomic< bool > *const validity, const std::string &identifier="") const | Subscriptor | protected |
Subscriptor::unsubscribe(std::atomic< bool > *const validity, const std::string &identifier="") const | Subscriptor | |
val | SparseMatrix< number > | private |
SparseMatrix::validity_pointers | Subscriptor | mutableprivate |
value_type typedef | SparseMatrix< 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() override=0 | SparseLUDecomposition< number > | pure virtual |
~SparseMatrix() override | SparseMatrix< number > | protectedvirtual |
~Subscriptor() | Subscriptor | protectedvirtual |