An Optimized Schwarz Method for the Optical Response Model Discretized by HDG Method.

An optimized Schwarz domain decomposition method (DDM) for solving the local optical response model (LORM) is proposed in this paper. We introduce a hybridizable discontinuous Galerkin (HDG) scheme for the discretization of such a model problem based on a triangular mesh of the computational domain. The discretized linear system of the HDG method on each subdomain is solved by a sparse direct solver. The solution of the interface linear system in the domain decomposition framework is accelerated by a Krylov subspace method. We study the spectral radius of the iteration matrix of the Schwarz method for the LORM problems, and thus propose an optimized parameter for the transmission condition, which is different from that for the classical electromagnetic problems. The numerical results show that the proposed method is effective.

Some refinements and generalizations of I. Schur type inequalities.

Recently, extensive researches on estimating the value of e have been studied. In this paper, the structural characteristics of I. Schur type inequalities are exploited to generalize the corresponding inequalities by variable parameter techniques. Some novel upper and lower bounds for the I. Schur inequality have also been obtained and the upper bounds may be obtained with the help of Maple and automated proving package (Bottema). Numerical examples are employed to demonstrate the reliability of the approximation of these new upper and lower bounds, which improve some known results in the recent literature.

Fast permutation preconditioning for fractional diffusion equations.

In this paper, an implicit finite difference scheme with the shifted Grünwald formula, which is unconditionally stable, is used to discretize the fractional diffusion equations with constant diffusion coefficients. The coefficient matrix possesses the Toeplitz structure and the fast Toeplitz matrix-vector product can be utilized to reduce the computational complexity from [Formula: see text] to [Formula: see text], where N is the number of grid points. Two preconditioned iterative methods, named bi-conjugate gradient method for Toeplitz matrix and bi-conjugate residual method for Toeplitz matrix, are proposed to solve the relevant discretized systems. Finally, numerical experiments are reported to show the effectiveness of our preconditioners.