We introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of the nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and nonlinear eigenvalue problems on the coarsest finite element space. The linearized boundary value problems are solved by some multigrid iterations.Besides the multigrid iteration, all other efficient iteration methods for solving boundary value problems can serve as the linear problem solver. We prove that the computational work of this new scheme is truly optimal,the same as solving the linear corresponding boundary value problem. In this case, this type of iteration scheme certainly improves the overfull efficiency of solving nonlinear eigenvalue problems. Some numerical experiments are presented to validate the efficiency of the new method.
Based on the PMHSS preconditioning matrix,we construct a class of rotated block triangular preconditioners for block two-by-two matrices of real square blocks,and analyze the eigen-properties of the corresponding preconditioned matrices.Numerical experiments show that these rotated block triangular preconditioners can be competitive to and even more efcient than the PMHSS preconditioner when they are used to accelerate Krylov subspace iteration methods for solving block two-by-two linear systems with coefcient matrices possibly of nonsymmetric sub-blocks.
