No abstract uploaded!

In this paper, we present an efficient \GQR\ algorithm for solving the linear response eigenvalue problem $\scrH\bx ={\lambda}\bx $, where $\scrH$ is $\bPi^-$-symmetric with respect to $\Gamma_0 = \diag(I_n,-I_n)$. Based on newly introduced $\Gamma$-orthogonal transformations, the \GQR\ algorithm preserves the $\bPi^-$-symmetric structure of $\scrH$ throughout the whole process, which guarantees the computed eigenvalues to appear pairwise $(\lambda,-\lambda)$ as they should. With the help of a newly established implicit $\Gamma$-orthogonality theorem, we incorporate the implicit multi-shift technique to accelerate the convergence of the \GQR\ algorithm. Numerical experiments are given to show the effectiveness of the algorithm.

In this paper we study representation theory of the category FI^m introduced by Gadish which is a product of copies of the category FI, and show that quite a few interesting representational and homological properties of FI can be generalized to FI^m in a natural way. In particular, we prove the representation stability property of finitely generated FI^m -modules over fields of characteristic 0.

We study the coinduction functor on the category of FI-modules and its variants. Using the coinduction functor, we give new and simpler proofs of (generalizations of) various results on homological properties of FI-modules. We also prove that any finitely generated projective VI-module over a field of characteristic 0 is injective.

No abstract uploaded!