We propose an inverse iterative method for computing the Perron pair of an irreducible nonnegative third order tensor. The method involves the selection of a parameter $\theta_k$ in the $k$th iteration. For every positive starting vector, the method converges quadratically and is positivity preserving in the sense that the vectors approximating the Perron vector are strictly positive in each iteration. It is also shown that $\theta_k=1$ near convergence. The computational work for each iteration of the proposed method is less than four times (three times if the tensor is symmetric in modes two and three, and twice if we also take the parameter to be $1$ directly) that for each iteration of the Ng--Qi--Zhou algorithm, which is linearly convergent for essentially positive tensors.

No abstract uploaded!

This article focuses on the discrete double-curl operator arising in the Maxwell equation that models three dimensional photonic crystals with face centered cubic lattice. The discrete double-curl operator is the degenerate coefficient matrix of the generalized eigenvalue problems (GEVP) due to the Maxwell equation. We derive an eigendecomposition of the degenerate coefficient matrix and explore an explicit form of orthogonal basis for the range and null spaces of this matrix. To solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues of the GEVP and therefore the zero eigenvalues are excluded and will not degrade the computational efficiency. This projected SEVP can be solved efficiently by the inverse Lanczos method. The linear systems within the inverse Lanczos method are well-conditioned and can be solved efficiently by the conjugate gradient method without using a preconditioner. We also demonstrate how two forms of matrix-vector multiplications, which are the most costly part of the inverse Lanczos method, can be computed by fast Fourier transformation due to the eigendecomposition to significantly reduce the computation cost. Integrating all of these findings and techniques, we obtain a fast eigenvalue solver. The solver has been implemented by MATLAB and successfully solves each of a set of $5.184$ million dimension eigenvalue problems within $50$ to $104$ minutes on a workstation with two Intel Quad-C ore Xeon X5687 3.6 GHz CPUs.

No abstract uploaded!

We provide a refinement of the Poincaré inequality on the torus $\mathbb{T}^{d}$ : there exists a set $\mathcal{B} \subset \mathbb{T} ^{d}$ of directions such that for every $\alpha \in \mathcal{B}$ there is a $c_{\alpha } > 0$ with $$\begin{aligned} \|\nabla f\|_{L^{2}(\mathbb{T}^{d})}^{d-1} \| \langle \nabla f, \alpha \rangle \|_{L^{2}(\mathbb{T}^{d})} \geq c_{\alpha }\|f\| _{L^{2}(\mathbb{T}^{d})}^{d} \quad \mbox{for all}~f\in H^{1}\bigl( \mathbb{T}^{d}\bigr)~ \mbox{with mean 0.} \end{aligned}$$ The derivative $\langle \nabla f, \alpha \rangle $ does not detect any oscillation in directions orthogonal to $\alpha $ , however, for certain $\alpha $ the geodesic flow in direction $\alpha $ is sufficiently mixing to compensate for that defect. On the two-dimensional torus $\mathbb{T}^{2}$ the inequality holds for $\alpha = (1, \sqrt{2})$ but is not true for $\alpha = (1,e)$ . Similar results should hold at a great level of generality on very general domains.