|
rheolef
6.3
|
solver_abtb – direct or iterative solver iterface for mixed linear systems
More...
#include <solver_abtb.h>

Public Types | |
| typedef csr< T, M >::size_type | size_type |
Public Member Functions | |
| solver_abtb_basic () | |
| solver_abtb_basic (const csr< T, M > &a, const csr< T, M > &b, const csr< T, M > &mp, const solver_option_type &opt=solver_option_type()) | |
| solver_abtb_basic (const csr< T, M > &a, const csr< T, M > &b, const csr< T, M > &c, const csr< T, M > &mp, const solver_option_type &opt=solver_option_type()) | |
| void | solve (const vec< T, M > &f, const vec< T, M > &g, vec< T, M > &u, vec< T, M > &p) const |
Protected Member Functions | |
| void | init () |
Protected Attributes | |
| solver_option_type | _opt |
| csr< T, M > | _a |
| csr< T, M > | _b |
| csr< T, M > | _c |
| csr< T, M > | _mp |
| solver_basic< T, M > | _sA |
| solver_basic< T, M > | _sa |
| solver_basic< T, M > | _smp |
| bool | _need_constraint |
solver_abtb – direct or iterative solver iterface for mixed linear systems
SYNOPSIS
The solver_abtb class provides direct or iterative algorithms for some mixed problem:
where A is symmetric positive definite and C is symmetric positive. By default, iterative algorithms are considered for tridimensional problems and direct methods otherwise. Such mixed linear problems appears for instance with the discretization of Stokes problems. The C matrix can be zero and then the corresponding argument can be omitted when invoking the constructor. Non-zero C matrix appears for of Stokes problems with stabilized P1-P1 element, or for nearly incompressible elasticity problems.
DIRECT ALGORITHM
When the kernel of B^T is not reduced to zero, then the pressure p is defined up to a constant and the system is singular. In the case of iterative methods, this is not a problem. But when using direct method, the system is then completed to impose a constraint on the pressure term and the whole matrix is factored one time for all.
ITERATIVE ALGORITHM
The preconditionned conjugate gradient algorithm is used, where the mp matrix is used as preconditionner. See see mixed_solver algorithm.
EXAMPLES
See the user's manual for practical examples for the nearly incompressible elasticity, the Stokes and the Navier-Stokes problems.
Definition at line 55 of file solver_abtb.h.
| typedef csr<T,M>::size_type rheolef::solver_abtb_basic< T, M >::size_type |
Definition at line 59 of file solver_abtb.h.
| rheolef::solver_abtb_basic< T, M >::solver_abtb_basic | ( | ) |
Definition at line 7 of file solver_abtb.cc.
| rheolef::solver_abtb_basic< T, M >::solver_abtb_basic | ( | const csr< T, M > & | a, |
| const csr< T, M > & | b, | ||
| const csr< T, M > & | mp, | ||
| const solver_option_type & | opt = solver_option_type() |
||
| ) |
Definition at line 18 of file solver_abtb.cc.
| rheolef::solver_abtb_basic< T, M >::solver_abtb_basic | ( | const csr< T, M > & | a, |
| const csr< T, M > & | b, | ||
| const csr< T, M > & | c, | ||
| const csr< T, M > & | mp, | ||
| const solver_option_type & | opt = solver_option_type() |
||
| ) |
Definition at line 37 of file solver_abtb.cc.
| void rheolef::solver_abtb_basic< T, M >::solve | ( | const vec< T, M > & | f, |
| const vec< T, M > & | g, | ||
| vec< T, M > & | u, | ||
| vec< T, M > & | p | ||
| ) | const |
Definition at line 92 of file solver_abtb.cc.
|
protected |
Definition at line 57 of file solver_abtb.cc.
|
mutableprotected |
Definition at line 73 of file solver_abtb.h.
|
protected |
Definition at line 74 of file solver_abtb.h.
|
protected |
Definition at line 75 of file solver_abtb.h.
|
protected |
Definition at line 76 of file solver_abtb.h.
|
protected |
Definition at line 77 of file solver_abtb.h.
|
protected |
Definition at line 78 of file solver_abtb.h.
|
protected |
Definition at line 79 of file solver_abtb.h.
|
protected |
Definition at line 80 of file solver_abtb.h.
|
protected |
Definition at line 81 of file solver_abtb.h.