This is the complete list of members for SparseDirectUMFPACK, including all inherited members.

_m	SparseDirectUMFPACK	private
_n	SparseDirectUMFPACK	private
Ap	SparseDirectUMFPACK	private
clear()	SparseDirectUMFPACK	private
control	SparseDirectUMFPACK	private
DeclException2(ExcUMFPACKError, char *, int,<< "UMFPACK routine "<< arg1<< " returned error status "<< arg2<< "."<< "\"<<("A complete list of error codes can be found in the file " "<bundled/umfpack/UMFPACK/Include/umfpack.h>." "\" "That said, the two most common errors that can happen are " "that your matrix cannot be factorized because it is " "rank deficient, and that UMFPACK runs out of memory " "because your problem is too large." "\" "The first of these cases most often happens if you " "forget terms in your bilinear form necessary to ensure " "that the matrix has full rank, or if your equation has a " "spatially variable coefficient (or nonlinearity) that is " "supposed to be strictly positive but, for whatever " "reasons, is negative or zero. In either case, you probably " "want to check your assembly procedure. Similarly, a " "matrix can be rank deficient if you forgot to apply the " "appropriate boundary conditions. For example, the " "Laplace equation without boundary conditions has a " "single zero eigenvalue and its rank is therefore " "deficient by one." "\" "The other common situation is that you run out of memory." "On a typical laptop or desktop, it should easily be possible " "to solve problems with 100,000 unknowns in 2d. If you are " "solving problems with many more unknowns than that, in " "particular if you are in 3d, then you may be running out " "of memory and you will need to consider iterative " "solvers instead of the direct solver employed by " "UMFPACK."))	SparseDirectUMFPACK
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."<< "\"<< "(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
factorize(const Matrix &matrix)	SparseDirectUMFPACK
initialize(const SparsityPattern &sparsity_pattern)	SparseDirectUMFPACK
initialize(const Matrix &matrix, const AdditionalData additional_data=AdditionalData())	SparseDirectUMFPACK
list_subscribers() const	Subscriptor
m() const	SparseDirectUMFPACK
n() const	SparseDirectUMFPACK
n_subscriptions() const	Subscriptor
operator=(const Subscriptor &)	Subscriptor
serialize(Archive &ar, const unsigned int version)	Subscriptor	inline
size_type typedef	SparseDirectUMFPACK
solve(Vector< double > &rhs_and_solution, bool transpose=false) const	SparseDirectUMFPACK
solve(BlockVector< double > &rhs_and_solution, bool transpose=false) const	SparseDirectUMFPACK
solve(const Matrix &matrix, Vector< double > &rhs_and_solution, bool transpose=false)	SparseDirectUMFPACK
solve(const Matrix &matrix, BlockVector< double > &rhs_and_solution, bool transpose=false)	SparseDirectUMFPACK
sort_arrays(const SparseMatrixEZ< number > &)	SparseDirectUMFPACK	private
SparseDirectUMFPACK()	SparseDirectUMFPACK
subscribe(const char *identifier=0) const	Subscriptor
Subscriptor()	Subscriptor
Subscriptor(const Subscriptor &)	Subscriptor
symbolic_decomposition	SparseDirectUMFPACK	private
Tvmult(Vector< double > &dst, const Vector< double > &src) const	SparseDirectUMFPACK
Tvmult(BlockVector< double > &dst, const BlockVector< double > &src) const	SparseDirectUMFPACK
unsubscribe(const char *identifier=0) const	Subscriptor
vmult(Vector< double > &dst, const Vector< double > &src) const	SparseDirectUMFPACK
vmult(BlockVector< double > &dst, const BlockVector< double > &src) const	SparseDirectUMFPACK
~SparseDirectUMFPACK()	SparseDirectUMFPACK
~Subscriptor()	Subscriptor	virtual