No abstract uploaded!

We present an efficient null space free Jacobi–Davidson method to compute the positive eigenvalues of time harmonic Maxwell’s equations. We focus on a class of spatial discretizations that guarantee the existence of discrete vector potentials, such as Yee’s scheme and the edge elements. During the Jacobi–Davidson iteration, the correction process is applied to the vector potential instead. The correction equation is solved approximately as in the standard Jacobi–Davidson approach. The computational cost of the transformation from the vector potential to the corrector is negligible. As a consequence, the expanding subspace automatically stays out of the null space and no extra projection step is needed. Numerical evidence confirms that the proposed scheme indeed outperforms the standard and projection-based Jacobi–Davidson methods by a significant margin.

We study a robust and efficient eigensolver for computing a few smallest positive eigenvalues of the three-dimensional Maxwell’s transmission eigenvalue problem. The discretized governing equations by the Nedelec edge element result in a large-scale quadratic eigenvalue problem (QEP) for which the spectrum contains many zero eigenvalues and the coefficient matrices consist of patterns in the matrix form XY^{−1}Z, both of which prevent existing eigenvalue solvers from being efficient. To remedy these difficulties, we rewrite the QEP as a particular nonlinear eigenvalue problem and develop a secant-type iteration, together with an indefinite locally optimal block preconditioned conjugate gradient method (LOBPCG), to sequentially compute the desired positive eigenvalues. Furthermore, we propose a novel method to solve the linear systems in each iteration of LOBPCG. Intensive numerical experiments show that our proposed method is robust, although the desired real eigenvalues are surrounded by complex eigenvalues.

We describe an inductive machinery to prove various properties of representations of a category equipped with a generic shift functor. Specifically, we show that if a property (P) of representations of the category behaves well under the generic shift functor, then all finitely generated representations of the category have the property (P). In this way, we obtain simple criteria for properties such as Noetherianity, finiteness of Castelnuovo-Mumford regularity, and polynomial growth of dimension to hold. This gives a systemetic and uniform proof of such properties for representations of the categories $\FI_G$ and $\OI_G$ which appear in representation stability theory.

We give two homological proofs of the Noetherianity of the category FI, a fundamental result discovered by Church, Ellenberg, Farb, and Nagpal.