平面光波导器件时域有限差分束传输法分析中边界和初始条件的处理

从慢变包络（SVEA）时域光传输方程出发,对比了综合道格拉斯（GD）和传统的中心差分（CN）两种离散化格式,指出GD法比CN法精度有了很大提高.重点讨论了GD法的TD-BPM边界处理问题,给出了吸收边界和透明边界离散的显式和隐式表达式,分析并确定了交替方向隐式法（ADIM）的边界处理方式;同时,对激励源加入的连接边界进行了仔细讨论.结果表明对于隐式GD-TD-BPM法边界处理应采用隐式,中间激励更能反映光波导反射场的情况.     

Integrating link-based discrete credit charging scheme into discrete network design problem

In this paper, we present an optimization model for integrating link-based discrete credit charging scheme into the discrete network design problem, to improve the transport performance from the perspectives of both transport network planning and travel demand management. The proposed model is a mixed-integer nonlinear bilevel programming problem, which includes an upper level problem for the transport authority and a lower level problem for the network users. The lower level sub-model is the traffic network user equilibrium (UE) formulation for a given network design strategy determined by the upper level problem. The network user at the lower level tries to minimize his/her own generalized travel cost (including both the travel time and the value of the credit charged for using the link) by choosing his/her route. While the transport authority at the upper level tries to find the optimal number of lanes and credit charging level with their locations to minimize the total system travel time (or maximize the transportation system performance). A genetic algorithm is used to solve the proposed mixed-integer nonlinear bilevel programming problem. Numerical experiments show the efficiency of the proposed model for traffic congestion mitigation, reveal that interaction effects across the tradable credit scheme and the discrete network design problem which amplify their individual effects. Moreover, the integrated model can achieve better performance than the sequential decision problems.     

On the Existence of Auslander–Reiten Sequences of Group Representations II

This is the second part of our study of the existence ofAuslander–Reiten sequences of group representations. In Part I weconsidered representations of group schemes in characteristic 0; in thispart we consider representations of group schemes in characteristicp; and in Part III we give applications to representations ofabstract groups and Lie algebras.     

A FAMILY OF DIFFERENCE SCHEMES WITH FOURNEAR-CONSERVED QUANTITIES FOR THE KdV EQUATION

1.IntroductionInthispaper,weareconcernedwiththesemi--discretizeddifferencemethodswhicharecapableofapproximatingtotheKdVequationtoaconsiderableextent.Considertheperiodicillitial-boundaryproblem:at aam uxxx~0,~co0(1.l)u(x 1,t)~u(x,t),~co0(…     

一类非线性Schr(o)dinger方程的非协调有限元分析

在半离散格式下研究一类带幂次非线性项的Schr(o)dinger方程的非协调矩形EQrot1元方法.直接利用插值技巧和该单元的两个特殊性质(相容误差比插值误差高一阶及其插值算子与传统的Ritz投影是一致的),给出相应的收敛性分析及误差估计.     

A semi-implicit monotone difference scheme for an initial-boundary value problem of a strongly degenerate parabolic equation modeling sedimentation-consolidation processes

We prove the convergence of a semi-implicit monotone finite difference scheme approximating an initial-boundary value problem for a spatially one-dimensional quasilinear strongly degenerate parabolic equation, which is supplied with two different inhomogeneous flux-type boundary conditions. This problem arises in the modeling of the sedimentation-consolidation process. We formulate the definition of entropy solution of the model in the sense of Kru kov and prove convergence of the scheme to the unique entropy solution of the problem, up to satisfaction of one of the boundary conditions.

     

一类非线性Schr(o)dinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrodinger方程的周期边值问题，提出了一种守恒的差分格式，在空间方向上采用Fourier谱方法，证明了格式的稳定性和收敛性．数值试验得到了与理论分析一致的结果．     

Stationary binary subdivision schemes using radial basis function interpolation

A new family of interpolatory stationary subdivision schemes is introduced by using radial basis function interpolation. This work extends earlier studies on interpolatory stationary subdivision schemes in two aspects. First, it provides a wider class of interpolatory schemes; each 2L-point interpolatory scheme has the freedom of choosing a degree (say, m) of polynomial reproducing. Depending on the combination (2L,m), the proposed scheme suggests different subdivision rules. Second, the scheme turns out to be a 2L-point interpolatory scheme with a tension parameter. The conditions for convergence and smoothness are also studied. Dedicated to Prof. Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A05, 41A25, 41A30, 65D10, 65D17. Byung-Gook Lee: This work was done as a part of Information & Communication fundamental Technology Research Program supported by Ministry of the Information & Communication in Republic of Korea. Jungho Yoon: Corresponding author. Supported by the Korea Science and Engineering Foundation grant (KOSEF R06-2002-012-01001).     

Algebraic structure of association schemes of prime order

Finite groups of prime order must be cyclic. It is natural to ask what about association schemes of prime order. In this paper, we will give an answer to this question. An association scheme of prime order is commutative, and its valencies of nontrivial relations and multiplicities of nontrivial irreducible characters are constant. Moreover, if we suppose that the minimal splitting field is an abelian extension of the field of rational numbers, then the character table is the same as that of a Schurian scheme.     

Distance regularity of Kerdock codes

A code is called distance regular, if for every two codewords x, y and integers i, j the number of codewords z such that d(x, z) = i and d(y, z) = j, with d the Hamming distance, does not depend on the choice of x, y and depends only on d(x, y) and i, j. Using some properties of the discrete Fourier transform we give a new combinatorial proof of the distance regularity of an arbitrary Kerdock code. We also calculate the parameters of the distance regularity of a Kerdock code.