Reference documentation for deal.II version 8.4.1
SparseMatrix< number > Member List

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

add(const size_type i, const size_type j, const number value)SparseMatrix< number >
add(const std::vector< size_type > &indices, const FullMatrix< number2 > &full_matrix, const bool elide_zero_values=true)SparseMatrix< number >
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 >
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 >
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 >
add(const number factor, const SparseMatrix< somenumber > &matrix)SparseMatrix< number >
begin() const SparseMatrix< number >
begin()SparseMatrix< number >
begin(const size_type r) const SparseMatrix< number >
begin(const size_type r)SparseMatrix< number >
block_read(std::istream &in)SparseMatrix< number >
block_write(std::ostream &out) const SparseMatrix< number >
BlockMatrixBase classSparseMatrix< number >friend
clear()SparseMatrix< number >virtual
colsSparseMatrix< number >private
compress(::VectorOperation::values)SparseMatrix< number >
const_iterator typedefSparseMatrix< number >
copy_from(const SparseMatrix< somenumber > &source)SparseMatrix< number >
copy_from(const ForwardIterator begin, const ForwardIterator end)SparseMatrix< number >
copy_from(const FullMatrix< somenumber > &matrix)SparseMatrix< number >
copy_from(const TrilinosWrappers::SparseMatrix &matrix)SparseMatrix< number >
DeclException0(ExcSourceEqualsDestination)SparseMatrix< number >
DeclException2(ExcInvalidIndex, int, int,<< "You are trying to access the matrix entry with index <"<< arg1<< ','<< arg2<< ">, but this entry does not exist in the sparsity pattern ""of this matrix.""\n\n""The most common cause for this problem is that you used ""a method to build the sparsity pattern that did not ""(completely) take into account all of the entries you ""will later try to write into. An example would be ""building a sparsity pattern that does not include ""the entries you will write into due to constraints ""on degrees of freedom such as hanging nodes or periodic ""boundary conditions. In such cases, building the ""sparsity pattern will succeed, but you will get errors ""such as the current one at one point or other when ""trying to write into the entries of the matrix.")SparseMatrix< number >
DeclException2(ExcIteratorRange, int, int,<< "The iterators denote a range of "<< arg1<< " elements, but the given number of rows was "<< arg2)SparseMatrix< number >
Subscriptor::DeclException2(ExcNoSubscriber, char *, char *,<< "No subscriber with identifier <"<< arg2<< "> subscribes to this object of class "<< arg1<< ". Consequently, it cannot be unsubscribed.")Subscriptor
DeclException3(ExcInUse, int, char *, std::string &,<< "Object of class "<< arg2<< " is still used by "<< arg1<< " other objects."<< "\n\n"<< "(Additional information: "<< arg3<< ")\n\n"<< "See the entry in the Frequently Asked Questions of "<< "deal.II (linked to from http://www.dealii.org/) for "<< "a lot more information on what this error means and "<< "how to fix programs in which it happens.")Subscriptor
DeclExceptionMsg(ExcDifferentSparsityPatterns,"When copying one sparse matrix into another, ""or when adding one sparse matrix to another, ""both matrices need to refer to the same ""sparsity pattern.")SparseMatrix< number >
diag_element(const size_type i) const SparseMatrix< number >
diag_element(const size_type i)SparseMatrix< number >
el(const size_type i, const size_type j) const SparseMatrix< number >
empty() const SparseMatrix< number >
end() const SparseMatrix< number >
end()SparseMatrix< number >
end(const size_type r) const SparseMatrix< number >
end(const size_type r)SparseMatrix< number >
frobenius_norm() const SparseMatrix< number >
get_row_length(const size_type row) const SparseMatrix< number >
get_sparsity_pattern() const SparseMatrix< number >
iterator typedefSparseMatrix< number >
Jacobi_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >
l1_norm() const SparseMatrix< number >
linfty_norm() const SparseMatrix< number >
list_subscribers() const Subscriptor
m() const SparseMatrix< number >
matrix_norm_square(const Vector< somenumber > &v) const SparseMatrix< number >
matrix_scalar_product(const Vector< somenumber > &u, const Vector< somenumber > &v) const SparseMatrix< number >
max_lenSparseMatrix< number >private
memory_consumption() const SparseMatrix< number >
mmult(SparseMatrix< numberC > &C, const SparseMatrix< numberB > &B, const Vector< number > &V=Vector< number >(), const bool rebuild_sparsity_pattern=true) const SparseMatrix< number >
n() const SparseMatrix< number >
n_actually_nonzero_elements(const double threshold=0.) const SparseMatrix< number >
n_nonzero_elements() const SparseMatrix< number >
n_subscriptions() const Subscriptor
operator()(const size_type i, const size_type j) const SparseMatrix< number >
operator*=(const number factor)SparseMatrix< number >
operator/=(const number factor)SparseMatrix< number >
operator=(const SparseMatrix< number > &)SparseMatrix< number >
operator=(const IdentityMatrix &id)SparseMatrix< number >
operator=(const double d)SparseMatrix< number >
Subscriptor::operator=(const Subscriptor &)Subscriptor
precondition_Jacobi(Vector< somenumber > &dst, const Vector< somenumber > &src, const number omega=1.) const SparseMatrix< number >
precondition_SOR(Vector< somenumber > &dst, const Vector< somenumber > &src, const number om=1.) const SparseMatrix< number >
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 >
precondition_TSOR(Vector< somenumber > &dst, const Vector< somenumber > &src, const number om=1.) const SparseMatrix< number >
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 >
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 >
print_pattern(std::ostream &out, const double threshold=0.) const SparseMatrix< number >
PSOR(Vector< somenumber > &v, const std::vector< size_type > &permutation, const std::vector< size_type > &inverse_permutation, const number om=1.) const SparseMatrix< number >
real_type typedefSparseMatrix< number >
reinit(const SparsityPattern &sparsity)SparseMatrix< number >virtual
residual(Vector< somenumber > &dst, const Vector< somenumber > &x, const Vector< somenumber > &b) const SparseMatrix< number >
serialize(Archive &ar, const unsigned int version)Subscriptorinline
set(const size_type i, const size_type j, const number value)SparseMatrix< number >
set(const std::vector< size_type > &indices, const FullMatrix< number2 > &full_matrix, const bool elide_zero_values=false)SparseMatrix< number >
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 >
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 >
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 >
size_type typedefSparseMatrix< number >
SOR(Vector< somenumber > &v, const number om=1.) const SparseMatrix< number >
SOR_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >
SparseMatrix classSparseMatrix< number >friend
SparseMatrix()SparseMatrix< number >
SparseMatrix(const SparseMatrix &)SparseMatrix< number >
SparseMatrix(const SparsityPattern &sparsity)SparseMatrix< number >explicit
SparseMatrix(const SparsityPattern &sparsity, const IdentityMatrix &id)SparseMatrix< number >
SparseMatrixIterators::Iterator classSparseMatrix< number >friend
SSOR(Vector< somenumber > &v, const number omega=1.) const SparseMatrix< number >
SSOR_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >
subscribe(const char *identifier=0) const Subscriptor
Subscriptor()Subscriptor
Subscriptor(const Subscriptor &)Subscriptor
symmetrize()SparseMatrix< number >
Tmmult(SparseMatrix< numberC > &C, const SparseMatrix< numberB > &B, const Vector< number > &V=Vector< number >(), const bool rebuild_sparsity_pattern=true) const SparseMatrix< number >
TPSOR(Vector< somenumber > &v, const std::vector< size_type > &permutation, const std::vector< size_type > &inverse_permutation, const number om=1.) const SparseMatrix< number >
TSOR(Vector< somenumber > &v, const number om=1.) const SparseMatrix< number >
TSOR_step(Vector< somenumber > &v, const Vector< somenumber > &b, const number om=1.) const SparseMatrix< number >
Tvmult(OutVector &dst, const InVector &src) const SparseMatrix< number >
Tvmult_add(OutVector &dst, const InVector &src) const SparseMatrix< number >
unsubscribe(const char *identifier=0) const Subscriptor
valSparseMatrix< number >private
value_type typedefSparseMatrix< number >
vmult(OutVector &dst, const InVector &src) const SparseMatrix< number >
vmult_add(OutVector &dst, const InVector &src) const SparseMatrix< number >
~SparseMatrix()SparseMatrix< number >virtual
~Subscriptor()Subscriptorvirtual