|-ksp_fetidp_fullyredundant <false> : use a fully redundant set of Lagrange multipliers|
|-ksp_fetidp_saddlepoint <false> : activates support for saddle point problems, see |
|-ksp_fetidp_saddlepoint_flip <false> : usually, an incompressible Stokes problem is written as||- | A B^T | | v | = | f | | B 0 | | p | = | g | with B representing -\int_\Omega \nabla \cdot u q. If -ksp_fetidp_saddlepoint_flip is true, the code assumes that the user provides it as | A B^T | | v | = | f | |-B 0 | | p | = |-g ||
|-ksp_fetidp_pressure_field <||- 1> : activates support for saddle point problems, and identifies the pressure field id. If this information is not provided, the pressure field is detected by using MatFindZeroDiagonals().|
|-ksp_fetidp_pressure_all <false> : if false, uses the interface pressures, as described in . If true, uses the entire pressure field.|
-fetidp_ksp_type gmres -fetidp_bddc_pc_bddc_symmetric falsewill use GMRES for the solution of the linear system on the Lagrange multipliers, generated using a non-symmetric PCBDDC.
For saddle point problems with continuous pressures, the preconditioned operator for the pressure solver can be specified with KSPFETIDPSetPressureOperator(). Alternatively, the pressure operator is extracted from the precondioned matrix (if it is different from the linear solver matrix). If none of the above, an identity matrix will be created; the user then needs to scale it through a Richardson solver. Options for the pressure solver can be prefixed with -fetidp_fielsplit_p_, E.g.
-fetidp_fielsplit_p_ksp_type preonly -fetidp_fielsplit_p_pc_type lu -fetidp_fielsplit_p_pc_factor_mat_solver_type mumpsIn order to use the deluxe version of FETI-DP, you must customize the inner BDDC operator with -fetidp_bddc_pc_bddc_use_deluxe_scaling -fetidp_bddc_pc_bddc_deluxe_singlemat and use non-redundant multipliers, i.e. -ksp_fetidp_fullyredundant false. Options for the scaling solver are prefixed by -fetidp_bddelta_, E.g.
-fetidp_bddelta_pc_factor_mat_solver_type mumps -fetidp_bddelta_pc_type lu
Some of the basic options such as the maximum number of iterations and tolerances are automatically passed from this KSP to the inner KSP that actually performs the iterations.
The converged reason and number of iterations computed are passed from the inner KSP to this KSP at the end of the solution.
.  - C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, and D. Rixen, FETI-DP: a dual-primal unified FETI method. I. A faster alternative to the two-level FETI method, Internat. J. Numer. Methods Engrg., 50 (2001), pp. 1523--1544 .  - X. Tu, J. Li, A FETI-DP type domain decomposition algorithm for three-dimensional incompressible Stokes equations, SIAM J. Numer. Anal., 53 (2015), pp. 720-742