Energy inconsistency of Galerkin approximationsfor plane Couette flow

For classical solutions of the incompressible Navier-Stokes equations (NSE) the energybalance between kinetic energy, work done by external forces, and viscous dissipation holds rigorously true. It is shown in this paper that standard Galerkin approximations violate energy balance in the case of plane Couette flow, whereas Poiseuille flow turns out to be energy consistent at any cutoff. The main reason for this discrepancy is seen in the different boundary conditions between the stationary linear shear flow and its disturbances. In our analysis, essentially, we introduce an auxiliary external force field which enforces the finite dimensional Galerkin approximation to fulfil the NSE. It is exemplarily demonstrated how the energy discrepancy decreases when the number of disturbed modes is increased which couple to the stationary shear flow.     

谱约束下对称正交对称矩阵束的最佳逼近

讨论了对称正交对称矩阵的广义逆特征值问题，得到了通解表达式和最佳解的表达式。     

发展型方程的快速Legendre谱τ逼近

摘要：以发展型模型方程为背景，建立了半离散和全离散的Legendre谱τ格式，并用反向递推法和奇偶分解法建立了Legendre谱τ方法的快速算法，在每一时间层上，其运算量仅为O(N)．运用离散能量法严格证明了全离散格式在时空方向的收敛阶分别为τ^2和N^1-m．数值结果显示了算法的有效性．     

应用不定量凸模型的遗传算法解决结构设计的优化问题

针对不定静载荷和由不定搜索而产生的最不利情况 ,应用遗传算法来解决桁架的优化问题。说明了在考虑不定量的结构设计优化问题中 ,应用遗传算法实现的高效性。     

基于遗传算法的二层线性规划问题的求解算法

本研究了下层以最优解返回上层的二层线性规划问题的遗传算法。在提出可行度概念的基础上，构造了二层线性规划上层规划问题的适应度函数，由此设计了求解二层线性规划问题遗传算法。为了提高遗传算法处理约束的能力，在产生初始种群时将随机产生的初始种群变为满足约束的初始种群，从而避免了使用罚函数处理约束带来的困难，最后用实例验证了本提出的二层线性规划的遗传算法的有效性。     

Asymptotic analysis of the effect of arrival model uncertainties in some optimal routing problems

We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.This work was supported by the National Science Foundation under Grants ECS-88-01912 and EID-92-12122 and by NASA under Contract NAG 2-595.The authors wish to thank an anonymous referee for pointing out Ref. 20, thus avoiding the need for an explicit proof of convexity of the cost function considered in the paper.     

关于Fejer点上的一种复有理型插值的一致逼近阶

设D是一个Jordan,Г为其边界，并设Г满足Aльпер条件。本文得到了一种基于Fejer点的有理型插值算子对于f(z)∈C（Г）的一致逼近阶。     

课表的多指标数学模型及解决方法

课程表问题又称时间表问题(timetable problem)，是一个多指标的优化决策问题，也是组合规划中的典型问题．对已有的时间表问题进行探讨，并研究其数学模型及解决方法．     

矩阵方程（A^TXA，B^TXB=（C，D）的反对称解及其最佳逼近

本利用矩阵对的标准相关分解，得到了矩阵方程(A^TXB，B^TXB)=(C，D)反对称解存在的充分必要条件及通解表达式，同时给出了解关于已知矩阵的最佳逼近．     

有分离调整和移走时间的两机器流水作业最大延误问题

在工件的调整时间和移走时间独立于加工时间的两机器流水作业问题中，同一工件的“调整”步及“移走”步在两台机器上可重叠进行，但“加工”步不能重叠，本以最大延误为目标函数讨论问题的解中工件排列应满足的条件，根据这些条件我们构作了两个近似算法。