Performance analysis of an integrated scheme in optical burst switching high-speed networks

A new integrated scheme based on resource-reservation and adaptive network flow routing to alleviate contention in optical burst switching networks is proposed. The objective of the proposed scheme is to reduce the overall burst loss in the network and at the same time to avoid the packet out-of-sequence arrival problem. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution schemes based on conventional routing. Through extensive simulations, it is shown that the proposed scheme not only provides significantly better burst loss performance than the basic equal proportion and hop-length based traffic routing algorithms, but also is void of any packet re-orderings.     

High-order accurate dissipative weighted compact nonlinear schemes

Based on the method deriving dissipative compact linear schemes (DCS), novel high-order dissipative weighted compact nonlinear schemes (DWCNS) are developed. By Fourier analysis,the dissipative and dispersive features of DWCNS are discussed. In view of the modified wave number, the DWCNS are equivalent to the fifth-order upwind biased explicit schemes in smooth regions and the interpolations at cell-edges dominate the accuracy of DWCNS. Boundary and near boundary schemes are developed and the asymptotic stabilities of DWCNS on both uniform and stretching grids are analyzed. The multi-dimensional implementations for Euler and Navier-Stokes equations are discussed. Several numerical inviscid and viscous results are given which show the good performances of the DWCNS for discontinuities capturing, high accuracy for boundary layer resolutions, good convergent rates (the root-mean-square of residuals approaching machine zero for solutions with strong shocks) and especially the damping effect on the spudous oscillations which were found in the solutions obtained by TVD and ENO schemes.     

Indexes and Special Discretization Methods for Linear partial Differential Algebraic Equations

Linear partial differential algebraic equations (PDAEs) of the form Au _t(t, x) + Bu _xx(t, x) + Cu(t, x) = f(t, x) are studied where at least one of the matrices A, B R ^n×n is singular. For these systems we introduce a uniform differential time index and a differential space index. We show that in contrast to problems with regular matrices A and B the initial conditions and/or boundary conditions for problems with singular matrices A and B have to fulfill certain consistency conditions. Furthermore, two numerical methods for solving PDAEs are considered. In two theorems it is shown that there is a strong dependence of the order of convergence on these indexes. We present examples for the calculation of the order of convergence and give results of numerical calculations for several aspects encountered in the numerical solution of PDAEs.     

A monotone finite element scheme for convection-diffusion equations

A simple technique is given in this paper for the construction and analysis of a class of finite element discretizations for convection-diffusion problems in any spatial dimension by properly averaging the PDE coefficients on element edges. The resulting finite element stiffness matrix is an -matrix under some mild assumption for the underlying (generally unstructured) finite element grids. As a consequence the proposed edge-averaged finite element scheme is particularly interesting for the discretization of convection dominated problems. This scheme admits a simple variational formulation, it is easy to analyze, and it is also suitable for problems with a relatively smooth flux variable. Some simple numerical examples are given to demonstrate its effectiveness for convection dominated problems.

     

不同层显式格式及在微尺度热传导中的应用

基于指数拟合和牛顿插值多项式构造了用于数值计算偏微分方程的不同层显式格式,应用不同层显式格式可获得不同精度的数值计算结果,并将该算法应用于微结构热传导方程和薄膜强瞬态热传导方程中．     

Non-expansive Mappings and Iterative Methods in Uniformly Convex Banach Spaces

In this article, we will investigate the properties of iterative sequence for non-expansive mappings and present several strong and weak convergence results of successive approximations to fixed points of non-expansive mappings in uniformly convex Banach spaces. The results presented in this article generalize and improve various ones concerned with constructive techniques for the fixed points of non-expansive mappings.     

High order accurate,one-sided finite-difference approximations to concentration gradients at the boundaries,for the simulation of electrochemical reaction-diffusion problems in one-dimensional space geometry

Accurate calculation of concentration gradients at the boundaries is crucial in electrochemical kinetic simulations, owing to the frequent occurrence of gradient-dependent boundary conditions, and the importance of the gradient-dependent electric current. By using the information about higher spatial derivatives of the concentrations, contained in the time-dependent, kinetic reaction-diffusion partial differential equation(s) in one-dimensional space geometry, under appropriate assumptions it is possible to increase the accuracy orders of the conventional, one-sided n-point finite-difference formulae for the concentration gradients at the boundaries, without increasing n. In this way a new class of high order accurate gradient approximations is derived, and tested in simulations of potential-step chronoamperometric and current-step chronopotentiometric transients for the Reinert-Berg system. The new formulae possess advantages over the conventional gradient approximations. For example, they allow one to obtain a third order accuracy by using two space points only, or fourth order accuracy by using three points, and yet they yield smaller errors than the conventional four-point, or five-point formulae, respectively. Needing fewer points, for approximating the gradients with a given accuracy, simplifies also the solution of the linear algebraic equations arising from the application of implicit time integration schemes.     

Convergence rates of cascade algorithms

We consider solutions of a refinement equation of the form

where is a finitely supported sequence called the refinement mask. Associated with the mask is a linear operator defined on by . This paper is concerned with the convergence of the cascade algorithm associated with , i.e., the convergence of the sequence in the -norm.

Our main result gives estimates for the convergence rate of the cascade algorithm. Let be the normalized solution of the above refinement equation with the dilation matrix being isotropic. Suppose lies in the Lipschitz space , where 0$"> and . Under appropriate conditions on , the following estimate will be established:

where and is a constant. In particular, we confirm a conjecture of A. Ron on convergence of cascade algorithms.

     

Equilibrium schemes for scalar conservation laws with stiff sources

We consider a simple model case of stiff source terms in hyperbolic conservation laws, namely, the case of scalar conservation laws with a zeroth order source with low regularity. It is well known that a direct treatment of the source term by finite volume schemes gives unsatisfactory results for both the reduced CFL condition and refined meshes required because of the lack of accuracy on equilibrium states. The source term should be taken into account in the upwinding and discretized at the nodes of the grid. In order to solve numerically the problem, we introduce a so-called equilibrium schemes with the properties that (i) the maximum principle holds true; (ii) discrete entropy inequalities are satisfied; (iii) steady state solutions of the problem are maintained. One of the difficulties in studying the convergence is that there are no estimates for this problem. We therefore introduce a kinetic interpretation of upwinding taking into account the source terms. Based on the kinetic formulation we give a new convergence proof that only uses property (ii) in order to ensure desired compactness framework for a family of approximate solutions and that relies on minimal assumptions. The computational efficiency of our equilibrium schemes is demonstrated by numerical tests that show that, in comparison with an usual upwind scheme, the corresponding equilibrium version is far more accurate. Furthermore, numerical computations show that equilibrium schemes enable us to treat efficiently the sources with singularities and oscillating coefficients.

     

Hilbert schemes, polygraphs and the Macdonald positivity conjecture

We study the isospectral Hilbert scheme , defined as the reduced fiber product of with the Hilbert scheme of points in the plane , over the symmetric power . By a theorem of Fogarty, is smooth. We prove that is normal, Cohen-Macaulay and Gorenstein, and hence flat over . We derive two important consequences.

(1) We prove the strong form of the conjecture of Garsia and the author, giving a representation-theoretic interpretation of the Kostka-Macdonald coefficients . This establishes the Macdonald positivity conjecture, namely that .

(2) We show that the Hilbert scheme is isomorphic to the -Hilbert scheme of Nakamura, in such a way that is identified with the universal family over . From this point of view, describes the fiber of a character sheaf at a torus-fixed point of corresponding to .

The proofs rely on a study of certain subspace arrangements , called polygraphs, whose coordinate rings carry geometric information about . The key result is that is a free module over the polynomial ring in one set of coordinates on . This is proven by an intricate inductive argument based on elementary commutative algebra.