Sequential overlapping Schwarz preconditioner.
More...
#include <dune/istl/ldl.hh>
|
| | SeqOverlappingSchwarz (const matrix_type &mat, const subdomain_vector &subDomains, field_type relaxationFactor=1, bool onTheFly_=true) |
| | Construct the overlapping Schwarz method. More...
|
| |
| | SeqOverlappingSchwarz (const matrix_type &mat, const rowtodomain_vector &rowToDomain, field_type relaxationFactor=1, bool onTheFly_=true) |
| |
| void | pre ([[maybe_unused]] X &x, [[maybe_unused]] X &b) override |
| | Prepare the preconditioner. More...
|
| |
| void | apply (X &v, const X &d) override |
| | Apply the preconditioner. More...
|
| |
| void | post ([[maybe_unused]] X &x) override |
| | Postprocess the preconditioner. More...
|
| |
| template<bool forward> |
| void | apply (X &v, const X &d) |
| | Apply one step of the preconditioner to the system A(v)=d. More...
|
| |
| SolverCategory::Category | category () const override |
| | Category of the preconditioner (see SolverCategory::Category) More...
|
| |
| virtual void | pre (X &x, X &b)=0 |
| | Prepare the preconditioner. More...
|
| |
| virtual void | post (X &x)=0 |
| | Clean up. More...
|
| |
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
class Dune::SeqOverlappingSchwarz< M, X, TM, TD, TA >
Sequential overlapping Schwarz preconditioner.
- Template Parameters
-
◆ allocator
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
◆ domain_type
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The domain type of the preconditioner.
◆ field_type
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The field type of the preconditioner.
◆ matrix_type
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The type of the matrix to precondition.
◆ Mode
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
◆ range_type
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The range type of the preconditioner.
◆ rowtodomain_vector
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The vector type containing the row index to subdomain mapping.
◆ size_type
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The return type of the size method.
◆ slu
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The type for the subdomain solver in use.
◆ slu_vector
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The vector type containing subdomain solvers.
◆ subdomain_list
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The type for the row to subdomain mapping.
◆ subdomain_type
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The type for the subdomain to row index mapping.
◆ subdomain_vector
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
The vector type containing the subdomain to row index mapping.
◆ apply()
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
template<bool forward>
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.
- Parameters
-
| [out] | v | The update to be computed |
| d | The current defect. |
Implements Dune::Preconditioner< X, X >.
◆ category()
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
◆ post() [1/2]
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.
- Parameters
-
| x | The right hand side of the equation. |
Implemented in Dune::Amg::KAMG< M, X, S, PI, K, A >, Dune::Amg::AMG< M, X, S, PI, A >, Dune::Amg::AMG< Operator, X, Smoother >, and Dune::Amg::FastAMG< M, X, PI, A >.
◆ post() [2/2]
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
Postprocess the preconditioner.
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.
- Parameters
-
| x | The right hand side of the equation. |
◆ pre() [1/2]
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.
- Note
- if a preconditioner is copied (e.g. for a second thread) again the pre() method has to be called to ensure proper memory management.
X x(0.0);
Y b = ...;
Preconditioner<X,Y> prec(...);
prec.pre(x,b);
prec.apply(x,b);
prec.post(x);
- Parameters
-
| x | The left hand side of the equation. |
| b | The right hand side of the equation. |
Implemented in Dune::Amg::KAMG< M, X, S, PI, K, A >, Dune::Amg::AMG< M, X, S, PI, A >, Dune::Amg::AMG< Operator, X, Smoother >, and Dune::Amg::FastAMG< M, X, PI, A >.
◆ pre() [2/2]
template<class M, class X, class TM = AdditiveSchwarzMode, class TD = ILU0SubdomainSolver<M,X,X>, class TA = std::allocator<X>>
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.
- Note
- if a preconditioner is copied (e.g. for a second thread) again the pre() method has to be called to ensure proper memory management.
X x(0.0);
Y b = ...;
Preconditioner<X,Y> prec(...);
prec.pre(x,b);
prec.apply(x,b);
prec.post(x);
- Parameters
-
| x | The left hand side of the equation. |
| b | The right hand side of the equation. |
The documentation for this class was generated from the following files: