Reference documentation for deal.II version Git 96dee1a3e7 2019-03-21 22:06:48 +0100

#include <deal.II/lac/sparse_direct.h>

Inheritance diagram for SparseDirectUMFPACK:
[legend]

Public Types

using size_type = types::global_dof_index

Public Member Functions

SparseDirectUMFPACK ()

~SparseDirectUMFPACK () override

Setting up a sparse factorization
void initialize (const SparsityPattern &sparsity_pattern)

template<class Matrix >
void factorize (const Matrix &matrix)

template<class Matrix >

Functions that represent the inverse of a matrix
void vmult (Vector< double > &dst, const Vector< double > &src) const

void vmult (BlockVector< double > &dst, const BlockVector< double > &src) const

void Tvmult (Vector< double > &dst, const Vector< double > &src) const

void Tvmult (BlockVector< double > &dst, const BlockVector< double > &src) const

size_type m () const

size_type n () const

Functions that solve linear systems
void solve (Vector< double > &rhs_and_solution, const bool transpose=false) const

void solve (BlockVector< double > &rhs_and_solution, const bool transpose=false) const

template<class Matrix >
void solve (const Matrix &matrix, Vector< double > &rhs_and_solution, const bool transpose=false)

template<class Matrix >
void solve (const Matrix &matrix, BlockVector< double > &rhs_and_solution, const bool transpose=false)

Public Member Functions inherited from Subscriptor
Subscriptor ()

Subscriptor (const Subscriptor &)

Subscriptor (Subscriptor &&) noexcept

virtual ~Subscriptor ()

Subscriptoroperator= (const Subscriptor &)

Subscriptoroperator= (Subscriptor &&) noexcept

template<typename ConstCharStar = const char *>
std::enable_if< std::is_same< ConstCharStar, const char * >::value >::type subscribe (std::atomic< bool > *const validity, ConstCharStar identifier=nullptr) const

void subscribe (std::atomic< bool > *const validity, const char *&&identifier) const =delete

void unsubscribe (std::atomic< bool > *const validity, const char *identifier=nullptr) const

unsigned int n_subscriptions () const

template<typename StreamType >
void list_subscribers (StreamType &stream) const

void list_subscribers () const

template<class Archive >
void serialize (Archive &ar, const unsigned int version)

Static Public Member Functions

static ::ExceptionBaseExcUMFPACKError (std::string arg1, int arg2)

Static Public Member Functions inherited from Subscriptor
static ::ExceptionBaseExcInUse (int arg1, std::string arg2, std::string arg3)

static ::ExceptionBaseExcNoSubscriber (std::string arg1, std::string arg2)

Private Member Functions

void clear ()

template<typename number >
void sort_arrays (const SparseMatrixEZ< number > &)

Private Attributes

size_type _m

size_type _n

void * symbolic_decomposition

std::vector< types::suitesparse_indexAp

std::vector< double > control

Detailed Description

This class provides an interface to the sparse direct solver UMFPACK, which is part of the SuiteSparse library (see this link). UMFPACK is a set of routines for solving non-symmetric sparse linear systems, Ax=b, using the Unsymmetric-pattern MultiFrontal method and direct sparse LU factorization. Matrices may have symmetric or unsymmetric sparsity patterns, and may have unsymmetric entries. The use of this class is explained in the step-22 and step-29 tutorial programs.

This matrix class implements the usual interface of preconditioners, that is a function initialize(const SparseMatrix<double>&matrix,const AdditionalData) for initializing and the whole set of vmult() functions common to all matrices. Implemented here are only vmult() and vmult_add(), which perform multiplication with the inverse matrix. Furthermore, this class provides an older interface, consisting of the functions factorize() and solve(). Both interfaces are interchangeable.

Note
This class exists if the UMFPACK interface was not explicitly disabled during configuration.
UMFPACK has its own license, independent of that of deal.II. If you want to use the UMFPACK you have to accept that license. It is linked to from the deal.II ReadMe file. UMFPACK is included courtesy of its author, Timothy A. Davis.

Instantiations

There are instantiations of this class for SparseMatrix<double>, SparseMatrix<float>, SparseMatrixEZ<float>, SparseMatrixEZ<double>, BlockSparseMatrix<double>, and BlockSparseMatrix<float>.

Definition at line 94 of file sparse_direct.h.

◆ size_type

Declare type for container size.

Definition at line 100 of file sparse_direct.h.

◆ SparseDirectUMFPACK()

 SparseDirectUMFPACK::SparseDirectUMFPACK ( )

Constructor. See the documentation of this class for the meaning of the parameters to this function.

Definition at line 54 of file sparse_direct.cc.

◆ ~SparseDirectUMFPACK()

 SparseDirectUMFPACK::~SparseDirectUMFPACK ( )
override

Destructor.

Definition at line 41 of file sparse_direct.cc.

◆ initialize() [1/2]

 void SparseDirectUMFPACK::initialize ( const SparsityPattern & sparsity_pattern )

This function does nothing. It is only here to provide a interface consistent with other sparse direct solvers.

Definition at line 48 of file sparse_direct.cc.

◆ factorize()

template<class Matrix >
 void SparseDirectUMFPACK::factorize ( const Matrix & matrix )

Factorize the matrix. This function may be called multiple times for different matrices, after the object of this class has been initialized for a certain sparsity pattern. You may therefore save some computing time if you want to invert several matrices with the same sparsity pattern. However, note that the bulk of the computing time is actually spent in the factorization, so this functionality may not always be of large benefit.

In contrast to the other direct solver classes, the initialization method does nothing. Therefore initialize is not automatically called by this method, when the initialization step has not been performed yet.

This function copies the contents of the matrix into its own storage; the matrix can therefore be deleted after this operation, even if subsequent solves are required.

Definition at line 196 of file sparse_direct.cc.

◆ initialize() [2/2]

template<class Matrix >
 void SparseDirectUMFPACK::initialize ( const Matrix & matrix, const AdditionalData additional_data = AdditionalData() )

Initialize memory and call SparseDirectUMFPACK::factorize.

Definition at line 443 of file sparse_direct.cc.

◆ vmult() [1/2]

 void SparseDirectUMFPACK::vmult ( Vector< double > & dst, const Vector< double > & src ) const

Preconditioner interface function. Usually, given the source vector, this method returns an approximate solution of Ax = b. As this class provides a wrapper to a direct solver, here it is actually the exact solution (exact within the range of numerical accuracy of course).

In other words, this function actually multiplies with the exact inverse of the matrix, $$A^{-1}$$.

Definition at line 450 of file sparse_direct.cc.

◆ vmult() [2/2]

 void SparseDirectUMFPACK::vmult ( BlockVector< double > & dst, const BlockVector< double > & src ) const

Same as before, but for block vectors.

Definition at line 459 of file sparse_direct.cc.

◆ Tvmult() [1/2]

 void SparseDirectUMFPACK::Tvmult ( Vector< double > & dst, const Vector< double > & src ) const

Same as before, but uses the transpose of the matrix, i.e. this function multiplies with $$A^{-T}$$.

Definition at line 468 of file sparse_direct.cc.

◆ Tvmult() [2/2]

 void SparseDirectUMFPACK::Tvmult ( BlockVector< double > & dst, const BlockVector< double > & src ) const

Same as before, but for block vectors

Definition at line 478 of file sparse_direct.cc.

◆ m()

 SparseDirectUMFPACK::size_type SparseDirectUMFPACK::m ( ) const

Return the dimension of the codomain (or range) space. Note that the matrix is of dimension $$m \times n$$.

Definition at line 486 of file sparse_direct.cc.

◆ n()

 SparseDirectUMFPACK::size_type SparseDirectUMFPACK::n ( ) const

Return the dimension of the domain space. Note that the matrix is of dimension $$m \times n$$.

Definition at line 493 of file sparse_direct.cc.

◆ solve() [1/4]

 void SparseDirectUMFPACK::solve ( Vector< double > & rhs_and_solution, const bool transpose = false ) const

Solve for a certain right hand side vector. This function may be called multiple times for different right hand side vectors after the matrix has been factorized. This yields a big saving in computing time, since the actual solution is fast, compared to the factorization of the matrix.

The solution will be returned in place of the right hand side vector.

If the factorization has not happened before, strange things will happen. Note that we can't actually call the factorize() function from here if it has not yet been called, since we have no access to the actual matrix.

If transpose is set to true this function solves for the transpose of the matrix, i.e. $$x=A^{-T}b$$.

Definition at line 299 of file sparse_direct.cc.

◆ solve() [2/4]

 void SparseDirectUMFPACK::solve ( BlockVector< double > & rhs_and_solution, const bool transpose = false ) const

Same as before, but for block vectors.

Definition at line 331 of file sparse_direct.cc.

◆ solve() [3/4]

template<class Matrix >
 void SparseDirectUMFPACK::solve ( const Matrix & matrix, Vector< double > & rhs_and_solution, const bool transpose = false )

Call the two functions factorize() and solve() in that order, i.e. perform the whole solution process for the given right hand side vector.

The solution will be returned in place of the right hand side vector.

Definition at line 347 of file sparse_direct.cc.

◆ solve() [4/4]

template<class Matrix >
 void SparseDirectUMFPACK::solve ( const Matrix & matrix, BlockVector< double > & rhs_and_solution, const bool transpose = false )

Same as before, but for block vectors.

Definition at line 358 of file sparse_direct.cc.

◆ clear()

 void SparseDirectUMFPACK::clear ( )
private

Free all memory that hasn't been freed yet.

Definition at line 67 of file sparse_direct.cc.

◆ sort_arrays()

template<typename number >
 void SparseDirectUMFPACK::sort_arrays ( const SparseMatrixEZ< number > & matrix )
private

Make sure that the arrays Ai and Ap are sorted in each row. UMFPACK wants it this way. We need to have three versions of this function, one for the usual SparseMatrix, one for the SparseMatrixEZ, and one for the BlockSparseMatrix classes

Definition at line 140 of file sparse_direct.cc.

◆ _m

 size_type SparseDirectUMFPACK::_m
private

The dimension of the range space.

Definition at line 326 of file sparse_direct.h.

◆ _n

 size_type SparseDirectUMFPACK::_n
private

The dimension of the domain space.

Definition at line 331 of file sparse_direct.h.

◆ symbolic_decomposition

 void* SparseDirectUMFPACK::symbolic_decomposition
private

The UMFPACK routines allocate objects in which they store information about symbolic and numeric values of the decomposition. The actual data type of these objects is opaque, and only passed around as void pointers.

Definition at line 338 of file sparse_direct.h.

◆ Ap

 std::vector SparseDirectUMFPACK::Ap
private

The arrays in which we store the data for the solver.

Definition at line 368 of file sparse_direct.h.

◆ control

 std::vector SparseDirectUMFPACK::control
private

Control and work arrays for the solver routines.

Definition at line 375 of file sparse_direct.h.

The documentation for this class was generated from the following files: