Type for Chebyshev iteration using TreeAMG matvec.
More...
|
| procedure, pass(this) | init (this, n, lvl, max_iter) |
| | Initialization of Jacobi (this is expensive...)
|
| |
| procedure, pass(this) | solve (this, x, f, n, amg, niter) |
| | Jacobi smoother.
|
| |
| procedure, pass(this) | comp_diag (this, amg, n) |
| | SAMPLE MATRIX DIAGONAL VALUES (DO NOT USE, EXPENSIVE)
|
| |
| procedure, pass(this) | free (this) |
| | free jacobi data
|
| |
Definition at line 57 of file tree_amg_smoother.f90.
◆ comp_diag()
◆ free()
◆ init()
- Parameters
-
| n | Number of dofs |
| lvl | The tamg hierarchy level on which the iterations are to be applied |
| max_iter | The number of iterations |
Definition at line 67 of file tree_amg_smoother.f90.
◆ solve()
| procedure, pass(this) tree_amg_smoother::amg_jacobi_t::solve |
( |
class(amg_jacobi_t), intent(inout) |
this, |
|
|
real(kind=rp), dimension(n), intent(inout) |
x, |
|
|
real(kind=rp), dimension(n), intent(inout) |
f, |
|
|
integer, intent(in) |
n, |
|
|
class(tamg_hierarchy_t), intent(inout) |
amg, |
|
|
integer, intent(in), optional |
niter |
|
) |
| |
- Parameters
-
| x | The solution to be returned |
| f | The right-hand side |
| n | Number of dofs |
| amg | The TreeAMG object |
Definition at line 68 of file tree_amg_smoother.f90.
◆ lvl
| integer tree_amg_smoother::amg_jacobi_t::lvl |
◆ max_iter
| integer tree_amg_smoother::amg_jacobi_t::max_iter = 10 |
| integer tree_amg_smoother::amg_jacobi_t::n |
◆ omega
| real(kind=rp) tree_amg_smoother::amg_jacobi_t::omega |
◆ recompute_diag
| logical tree_amg_smoother::amg_jacobi_t::recompute_diag = .true. |
The documentation for this type was generated from the following file: