|
| subroutine | tree_amg_smoother::amg_cheby_init (this, n, lvl, max_iter) |
| | Initialization of chebyshev.
|
| |
| subroutine | tree_amg_smoother::amg_cheby_free (this) |
| | free cheby data
|
| |
| subroutine | tree_amg_smoother::amg_cheby_power (this, amg, n) |
| | Power method to approximate largest eigenvalue.
|
| |
| subroutine | tree_amg_smoother::amg_cheby_solve (this, x, f, n, amg, zero_init) |
| | Chebyshev smoother From Saad's iterative methods textbook.
|
| |
| subroutine | tree_amg_smoother::amg_device_cheby_power (this, amg, n) |
| | Power method to approximate largest eigenvalue.
|
| |
| subroutine | tree_amg_smoother::amg_device_cheby_solve (this, x, f, x_d, f_d, n, amg, zero_init) |
| | Chebyshev smoother From Saad's iterative methods textbook.
|
| |
| subroutine | tree_amg_smoother::amg_jacobi_init (this, n, lvl, max_iter) |
| | Initialization of Jacobi (this is expensive...)
|
| |
| subroutine | tree_amg_smoother::amg_jacobi_free (this) |
| | free jacobi data
|
| |
| subroutine | tree_amg_smoother::amg_jacobi_diag (this, amg, n) |
| | SAMPLE MATRIX DIAGONAL VALUES (DO NOT USE, EXPENSIVE)
|
| |
| subroutine | tree_amg_smoother::amg_jacobi_solve (this, x, f, n, amg, niter) |
| | Jacobi smoother.
|
| |
| subroutine | tree_amg_smoother::amg_smoo_monitor (lvl, smoo) |
| |
| subroutine | tree_amg_smoother::amg_cheby_monitor (lvl, lam) |
| |