No abstract uploaded!

No abstract uploaded!

Full spectrum of a large sparse $\top$-palindromic quadratic eigenvalue problem ($\top$-PQEP) is considered arguably for the first time in this article. Such a problem is posed by calculation of surface Green's functions (SGFs) of mesoscopic transistors with a tremendous non-periodic cross-section. For this problem, general purpose eigensolvers are not efficient, nor is advisable to resort to the decimation method \etc to obtain the Wiener-Hopf factorization. After reviewing some rigorous understanding of SGF calculation from the perspective of $\top$-PQEP and nonlinear matrix equation, we present our new approach to this problem. In a nutshell, the unit disk where the spectrum of interest lies is broken down adaptively into pieces small enough that they each can be locally tackled by the generalized $\top$-skew-Hamiltonian implicitly restarted shift-and-invert Arnoldi (G$\top$SHIRA) algorithm with suitable shifts and other parameters, and the eigenvalues missed by this divide-and-conquer strategy can be recovered thanks to the accurate estimation provided by our newly developed scheme. Notably the novel non-equivalence deflation is proposed to avoid as much as possible duplication of nearby known eigenvalues when a new shift of G$\top$SHIRA is determined. We demonstrate our new approach by calculating the SGF of a realistic nanowire whose unit cell is described by a matrix of size $4000\times 4000$ at the density functional tight binding level, corresponding to a $8\times 8\; \mbox{nm}^{2}$ cross-section. We believe that quantum transport simulation of realistic nano-devices in the mesoscopic regime will greatly benefit from this work.

Calculation of band structures of three dimensional photonic crystals amounts to solving large-scale Maxwell eigenvalue problems, which are notoriously challenging due to high multiplicity of zero eigenvalues. In this paper, we try to address this problem in such a broad context that band structures of three dimensional isotropic photonic crystals in all $14$ Bravais lattices can be efficiently computed in a unified framework. In this work, we uncover the delicate machinery behind several key results of our framework and on the basis of this new understanding we drastically simplify the derivations, proofs and arguments. Particular effort is made on reformulating the Bloch condition for all $14$ Bravais lattices in the redefined orthogonal coordinate system, and establishing eigen-decomposition of discrete partial derivative operators by identifying the hierarchical structure of the underlying normal (block) companion matrix, and reducing the eigen-decomposition of the double-curl operator to a simple factorization of a $3$-by-$3$ complex skew-symmetric matrix. With the validity of the novel nullspace free method in the broad context, we perform some calculations on one benchmark system to demonstrate the accuracy and efficiency of our algorithm to solve Maxwell eigenvalue problems.

In this paper, we propose new spectral viscosity methods based on the generalized Hermite functions for the solution of nonlinear scalar conservation laws in the whole line. It is shown rigorously that these schemes converge to the unique entropy solution by using compensated compactness arguments, under some conditions. The numerical experiments of the inviscid Burger's equation support our result, and it verifies the reasonableness of the conditions.

It is well-known that sparse grid algorithm has been widely accepted as an efficient tool to overcome the “curse of dimensionality" in some degree. In this note, we give the error estimate of hyperbolic cross (HC) approximations with all sorts of Askey polynomials. These polynomials are useful in generalized polynomial chaos (gPC) in the field of uncertainty quantification. The exponential convergences in both regular and optimized HC approximations have been shown under the condition that the random variable depends on the random inputs smoothly in some degree. Moreover, we apply gPC to numerically solve the ordinary differential equations with slightly higher dimensional random inputs. Both regular and optimized HC have been investigated with Laguerre-chaos, Charlier-chaos and Hermite-chaos in the numerical experiment. The discussion of the connection between the standard ANOVA approximation and Galerkin approximation is in the appendix.

In this follow-up work, we extend the discontinuous Galerkin (DG) methods previously developed on rectangular meshes \cite{previous} to triangular meshes. The DG schemes in \cite{previous} are both optimally convergent and energy conserving. However, as we shall see in the numerical results section, the DG schemes on triangular meshes only have suboptimal convergence rate. We prove the energy conservation and an error estimate for the semi-discrete schemes. The stability of the fully discrete scheme is proved and its error estimate is stated. We present extensive numerical results with convergence consistent of our error estimate, and simulations of wave propagation in Drude metamaterials to demonstrate the flexibility of triangular meshes.

To avoid the order reduction when third order implicit-explicit Runge-Kutta time discretization is used together with the local discontinuous Galerkin (LDG) spatial discretization, for solving convection-diffusion problems with time-dependent Dirichlet boundary conditions, we propose a strategy of boundary treatment at each intermediate stage in this paper. The proposed strategy can achieve optimal order of accuracy by numerical verification. Also by suitably setting numerical flux on the boundary in the LDG methods, and by establishing an important relationship between the gradient and interface jump of the numerical solution with the independent numerical solution of the gradient and the given boundary conditions, we build up the unconditional stability of the corresponding scheme, in the sense that the time step is only required to be upper bounded by a suitable positive constant, which is independent of the mesh size.

We further investigate the high order positivity-preserving discontinuous Galerkin (DG) methods for linear hyperbolic and radiative transfer equations developed in \cite{yuan}. The DG methods in \cite{yuan} can maintain positivity and high order accuracy, but they rely both on the scaling limiter in \cite{zhang1} and a rotational limiter, the latter may alter cell averages of the unmodulated DG scheme, thereby affecting conservation. Even though a Lax-Wendroff type theorem is proved in \cite{yuan}, guaranteeing convergence to weak solutions with correct shock speed when such rotational limiter is applied, it would still be desirable if a conservative DG method without changing the cell averages can be obtained which has both high order accuracy and positivity-preserving capability. In this paper, we develop and analyze such a DG method for both linear hyperbolic equations and radiative transfer equations. In the one-dimensional case, the method uses traditional DG space $P^k$ of piecewise polynomials of degree at most $k$. A key result is proved that the unmodulated DG solver in this case can maintain positivity of the cell average if the inflow boundary value and the source term are both positive, therefore the positivity-preserving framework in \cite{zhang1} can be used to obtain a high order conservative positivity-preserving DG scheme. Unfortunately, in two-dimensions this is no longer the case. We show that the unmodulated DG solver based either on $P^k$ or $Q^k$ spaces (piecewise $k$-th degree polynomials or piecewise tensor-product $k$-th degree polynomials) could generate negative cell averages. We augment the DG space with additional functions so that the positivity of cell averages from the unmodulated DG solver can be restored, thereby leading to high order conservative positivity-preserving DG scheme based on these augmented DG spaces following the framework in \cite{zhang1}. Computational results are provided to demonstrate the good performance of our DG schemes.

In this paper, we develop bound-preserving modified exponential Runge-Kutta (RK) discontinuous Galerkin (DG) schemes to solve scalar hyperbolic equations with stiff source terms by extending the idea in Zhang and Shu \cite{ZhSh:10max}. Exponential strong stability preserving (SSP) high order time discretizations are constructed and then modified to overcome the stiffness and preserve the bound of the numerical solutions. It is also straightforward to extend the method to two dimensions on rectangular and triangular meshes. Even though we only discuss the bound-preserving limiter for DG schemes, it can also be applied to high order finite volume schemes, such as weighted essentially non-oscillatory (WENO) finite volume schemes as well.