-snes_fas_levels | - The number of levels | |
-snes_fas_cycles<1> | - The number of cycles -- 1 for V, 2 for W | |
-snes_fas_type<additive,multiplicative,full,kaskade> | - Additive or multiplicative cycle | |
-snes_fas_galerkin<PETSC_FALSE> | - Form coarse problems by projection back upon the fine problem | |
-snes_fas_smoothup<1> | - The number of iterations of the post-smoother | |
-snes_fas_smoothdown<1> | - The number of iterations of the pre-smoother | |
-snes_fas_monitor | - Monitor progress of all of the levels | |
-snes_fas_full_downsweep<PETSC_FALSE> | - call the downsmooth on the initial downsweep of full FAS | |
-fas_levels_snes_ | - SNES options for all smoothers | |
-fas_levels_cycle_snes_ | - SNES options for all cycles | |
-fas_levels_i_snes_ | - SNES options for the smoothers on level i | |
-fas_levels_i_cycle_snes_ | - SNES options for the cycle on level i | |
-fas_coarse_snes_ | - SNES options for the coarsest smoother |
1. | - Peter R. Brune, Matthew G. Knepley, Barry F. Smith, and Xuemin Tu, "Composing Scalable Nonlinear Algebraic Solvers", SIAM Review, 57(4), 2015 |