 |
Reference documentation for deal.II version 8.4.2
|
|
Reference documentation for deal.II version 8.4.2
|
This is the complete list of members for SparseLUDecomposition< 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 |
| 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 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 |
| DeclException0(ExcSourceEqualsDestination) | SparseMatrix< number > | protected |
| DeclException1(ExcInvalidStrengthening, double,<< "The strengthening parameter "<< arg1<< " is not greater or equal than zero!") | SparseLUDecomposition< 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." "\" "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 > | protected |
| DeclException2(ExcIteratorRange, int, int,<< "The iterators denote a range of "<< arg1<< " elements, but the given number of rows was "<< arg2) | SparseMatrix< number > | protected |
| SparseMatrix::Subscriptor::DeclException2(ExcNoSubscriber, char *, char *,<< "No subscriber with identifier <"<< arg2<< "> subscribes to this object of class "<< arg1<< ". Consequently, it cannot be unsubscribed.") | Subscriptor | protected |
| Subscriptor::DeclException2(ExcNoSubscriber, char *, char *,<< "No subscriber with identifier <"<< arg2<< "> subscribes to this object of class "<< arg1<< ". Consequently, it cannot be unsubscribed.") | Subscriptor | |
| SparseMatrix::DeclException3(ExcInUse, int, char *, std::string &,<< "Object of class "<< arg2<< " is still used by "<< arg1<< " other objects."<< "\"<< "(Additional information: "<< arg3<< ")\"<< "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 | protected |
| Subscriptor::DeclException3(ExcInUse, int, char *, std::string &,<< "Object of class "<< arg2<< " is still used by "<< arg1<< " other objects."<< "\"<< "(Additional information: "<< arg3<< ")\"<< "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 > | 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 |
| 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) | 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() const | Subscriptor | protected |
| 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 | SparseLUDecomposition< 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 | Subscriptor | protected |
| 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=(const IdentityMatrix &id) | SparseMatrix< number > | protected |
| operator=(const double d) | SparseMatrix< number > | protected |
| SparseMatrix::Subscriptor::operator=(const Subscriptor &) | Subscriptor | protected |
| Subscriptor::operator=(const Subscriptor &) | 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_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 | SparseLUDecomposition< 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 |
| SparseLUDecomposition() | SparseLUDecomposition< number > | protected |
| SparseMatrix() | SparseMatrix< number > | protected |
| SparseMatrix(const SparseMatrix &) | 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(const char *identifier=0) const | Subscriptor | protected |
| Subscriptor::subscribe(const char *identifier=0) const | Subscriptor | |
| SparseMatrix::Subscriptor() | Subscriptor | protected |
| SparseMatrix::Subscriptor(const Subscriptor &) | Subscriptor | protected |
| Subscriptor::Subscriptor() | Subscriptor | |
| Subscriptor::Subscriptor(const 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(OutVector &dst, const InVector &src) const | SparseMatrix< number > | protected |
| Tvmult_add(OutVector &dst, const InVector &src) const | SparseLUDecomposition< number > | |
| SparseMatrix::unsubscribe(const char *identifier=0) const | Subscriptor | protected |
| Subscriptor::unsubscribe(const char *identifier=0) const | Subscriptor | |
| value_type typedef | SparseMatrix< number > | protected |
| vmult(OutVector &dst, const InVector &src) const | SparseMatrix< number > | protected |
| vmult_add(OutVector &dst, const InVector &src) const | SparseLUDecomposition< number > | |
| ~SparseLUDecomposition()=0 | SparseLUDecomposition< number > | pure virtual |
| ~SparseMatrix() | SparseMatrix< number > | protectedvirtual |
| ~Subscriptor() | Subscriptor | protectedvirtual |
1.8.12