dune-istl
2.4
|
The sequential Pardiso preconditioner. More...
#include <dune/istl/pardiso.hh>
Public Types | |
enum | { category =SolverCategory::sequential } |
typedef M | matrix_type |
The matrix type the preconditioner is for. More... | |
typedef X | domain_type |
The domain type of the preconditioner. More... | |
typedef Y | range_type |
The range type of the preconditioner. More... | |
typedef X::field_type | field_type |
The field type of the preconditioner. More... | |
typedef M::RowIterator | RowIterator |
typedef M::ColIterator | ColIterator |
Public Member Functions | |
SeqPardiso (const M &A) | |
Constructor. More... | |
virtual void | pre (X &x, Y &b) |
Prepare the preconditioner. More... | |
virtual void | apply (X &v, const Y &d) |
Apply the preconditioner. More... | |
virtual void | post (X &x) |
Clean up. More... | |
~SeqPardiso () | |
The sequential Pardiso preconditioner.
Put the Pardiso direct solver into the preconditioner framework.
typedef M::ColIterator Dune::SeqPardiso< M, X, Y >::ColIterator |
typedef X Dune::SeqPardiso< M, X, Y >::domain_type |
The domain type of the preconditioner.
typedef X::field_type Dune::SeqPardiso< M, X, Y >::field_type |
The field type of the preconditioner.
typedef M Dune::SeqPardiso< M, X, Y >::matrix_type |
The matrix type the preconditioner is for.
typedef Y Dune::SeqPardiso< M, X, Y >::range_type |
The range type of the preconditioner.
typedef M::RowIterator Dune::SeqPardiso< M, X, Y >::RowIterator |
anonymous enum |
|
inline |
|
inline |
References F77_FUNC.
|
inlinevirtual |
Apply the preconditioner.
Apply one step of the preconditioner to the system A(v)=d. On entry v=0 and d=b-A(x) (although this might not be computed in that way. On exit v contains the update, i.e one step computes where
is the approximate inverse of the operator
characterizing the preconditioner.
[out] | v | The update to be computed |
d | The current defect. |
Implements Dune::Preconditioner< X, Y >.
References F77_FUNC.
|
inlinevirtual |
Clean up.
Clean up. This method is called after the last apply call for the linear system to be solved. Memory may be deallocated safely here. x is the solution of the linear equation.
x | The right hand side of the equation. |
Implements Dune::Preconditioner< X, Y >.
|
inlinevirtual |
Prepare the preconditioner.
Prepare the preconditioner. A solver solves a linear operator equation A(x)=b by applying one or several steps of the preconditioner. The method pre() is called before the first apply operation. b and x are right hand side and solution vector of the linear system respectively. It may. e.g., scale the system, allocate memory or compute a (I)LU decomposition. Note: The ILU decomposition could also be computed in the constructor or with a separate method of the derived method if several linear systems with the same matrix are to be solved.
x | The left hand side of the equation. |
b | The right hand side of the equation. |
Implements Dune::Preconditioner< X, Y >.