Evaluation of quadrature schemes for the discrete ordinates method

After reviewing the presently available quadrature schemes for the discrete ordinates method, the accuracy of different schemes is analyzed and evaluated. It is shown from a comprehensive error analysis that the moment conditions have to satisfied not only for the principal coordinates directions, as it is mostly carried out, but for any arbitrary test direction. Among the schemes with approximately 50 discrete ordinates the DCT-020-2468 quadrature was found to give the best accuracy. The highest accuracy among all schemes is achieved by the LC-11 quadrature which requires 96 discrete ordinates. This scheme is rarely used up to date and deserves more attention for high accuracy predictions.     

高阶非线性波动方程的有限差分方法

本文研究一类广泛的高阶非线性波动方程组初边值问题的有限差分格式，用离散泛函分析方法和先验估计的技巧得到了有限差分格式的收敛性。     

On the long‐time stability of the Crank–Nicolson scheme for the 2D Navier–Stokes equations

In this article we study the stability for all positive time of the Crank–Nicolson scheme for the two‐dimensional Navier–Stokes equations. More precisely, we consider the Crank–Nicolson time discretization together with a general spatial discretization, and with the aid of the discrete Gronwall lemma and of the discrete uniform Gronwall lemma we prove that the numerical scheme is stable, provided a CFL‐type condition is satisfied. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A Miura of the Painlevé I Equation and Its Discrete Analogs

We present Miura transformations for the continuous and several discrete Painlev\'e I equations. In the case of the continuous P_I, we use the Hamiltonian formulation of the Painlev\'e equations and show that there exists a Miura transformation between P_I and the binomial, second degree, equation of Cosgrove SD_V. In the case of the discrete P_I's we obtain two different kinds of Miuras. One kind relates a d-P_I to some other d-P_I while the other leads to discrete four-point equations which are the discrete analogs of the derivative of Cosgrove's equation SD_V.     

Theoretical and computational studies of vectorial processes in biomolecular systems

Efficient vectorial processes such as the transduction of bioenergy and signals are characteristics that strikingly distinguish living systems from inanimate materials. Recent developments in biophysical and biochemical techniques have provided new information about the structure, dynamics and interaction of biomolecules involved in vectorial life processes at multiple length and temporal scales. This wealth of data makes it possible to carry out theoretical and computational studied of key mechanistic questions associated with complex life processes at an unprecedented level. Using two “vectorial biomolecular machines”, myosin and cytochrome c oxidase, as examples, we discuss the identification of interesting and biologically relevant questions that require thorough theoretical analysis. Technical challenges and recent progress related to these theoretical investigations are briefly summarized     

Discrete storage processes and their Poisson flow and fluid flow approximations

Consider discrete storage processes that are modulated by environmental processes. Environmental processes cause interruptions in the input and/or output processes of the discrete storage processes. Due to the difficulties encountered in the exact analysis of such discrete storage systems, often Poisson flow and/or fluid flow models with the same modulating environmental processes are proposed as approximations for these systems. The analysis of Poisson flow and fluid flow models is much easier than that of the discrete storage processes. In this paper we give sufficient conditions under which the content of the discrete storage processes can be bounded by the Poisson flow and the fluid flow models. For example, we show that Poisson flow models and the fluid flow models developed by Kosten (and by Anick, Mitra and Sondhi) can be used to bound the performance of infinite (finite) source packetized voice/data communication systems. We also show that a Poisson flow model and the fluid flow model developed by Mitra can be used to bound the buffer content of a two stage automatic transfer line. The potential use of the bounding techniques presented in this paper, of course, transcends well beyond these examples.Supported in part by NSF grant DMS-9308149.     

Solution of a class of stochastic linear-convex control problems using deterministic equivalents

In this paper, we identify a new class of stochastic linearconvex optimal control problems, whose solution can be obtained by solving appropriate equivalent deterministic optimal control problems. The term linear-convex is meant to imply that the dynamics is linear and the cost function is convex in the state variables, linear in the control variables, and separable. Moreover, some of the coefficients in the dynamics are allowed to be random and the expectations of the control variables are allowed to be constrained. For any stochastic linear-convex problem, the equivalent deterministic problem is obtained. Furthermore, it is shown that the optimal feedback policy of the stochastic problem is affine in its current state, where the affine transformation depends explicitly on the optimal solution of the equivalent deterministic problem in a simple way. The result is illustrated by its application to a simple stochastic inventory control problem.This research was supported in part by NSERC Grant A4617, by SSHRC Grant 410-83-0888, and by an INRIA Post-Doctoral Fellowship.     

A subjective Bayesian approach to the theory of queues II — Inference and information in M/M/1 queues

This is a sequel to Part I of A Subjective Bayesian Approach to the Theory of Queues. The focus here is on inference and a use of Shannon's measure of information for assessing the amount of information conveyed by the various types of data from queues. The notation and terminology used here is established in Part I.     

离散小波变换-遗传算法-交互检验法用于近红外光谱数据的高倍压缩与变量筛选

用遗传算法(GA)与交互检验(CV)相结合建立了一种用于对近红外光谱(NIR)数据及其离散小波变换(DWT)系数进行变量筛选的方法，并应用于烟草样品中总挥发碱和总氮的同时测定。结果表明：NIR数据经DWT压缩为原始大小的3．3％时基本没有光谱信息的丢失；有效的变量筛选可以极大地减少模型中的变量个数，降低模型的复杂程度，改善预测的准确度。     

Distributed Gaussian discrete variable representation

A discrete variable representation (DVR) made from distributed Gaussians g_n(x) = e, (n = ?∞, …, ∞) and its infinite grid limit is described. The infinite grid limit of the distributed Gaussian DVR (DGDVR) reduces to the sinc function DVR of Colbert and Miller in the limit c → 0. The numerical performance of both finite and infinite grid DGDVRs and the sinc function DVR is compared. If a small number of quadrature points are taken, the finite grid DGDVR performs much better than both infinite grid DGDVR and sinc function DVR. The infinite grid DVRs lose accuracy due to the truncation error. In contrast, the sinc function DVR is found to be superior to both finite and infinite grid DGDVRs if enough grid points are taken to eliminate the truncation error. In particular, the accuracy of DGDVRs does not get better than some limit when the distance between Gaussians d goes to zero with fixed c, whereas the accuracy of the sinc function DVR improves very quickly as d becomes smaller, and the results are exact in the limit d → 0. An analysis of the performance of distributed basis functions to represent a given function is presented in a recent publication. With this analysis, we explain why the sinc function DVR performs better than the infinite grid DGDVR. The analysis also traces the inability of Gaussians to yield exact results in the limit d → 0 to the incompleteness of this basis in this limit. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005