Second order Runge–Kutta methods for Stratonovich stochastic differential equations

The weak approximation of the solution of a system of Stratonovich stochastic differential equations with a m–dimensional Wiener process is studied. Therefore, a new class of stochastic Runge–Kutta methods is introduced. As the main novelty, the number of stages does not depend on the dimension m of the driving Wiener process which reduces the computational effort significantly. The colored rooted tree analysis due to the author is applied to determine order conditions for the new stochastic Runge–Kutta methods assuring convergence with order two in the weak sense. Further, some coefficients for second order stochastic Runge–Kutta schemes are calculated explicitly. AMS subject classification (2000)  65C30, 65L06, 60H35, 60H10     

Numerical solution of differential equations using Sinc method based on the interpolation of the highest derivatives

In general, we will use the numerical differentiation when dealing with the differential equations. Thus the differential equations can be transformed into algebraic equations and then we can get the numerical solutions. But as we all have known, the numerical differentiation process is very sensitive to even a small level of errors. In contrast it is expected that on average the numerical integration process is much less sensitive to errors. In this paper, based on the Sinc method we provide a new method using Sinc method incorporated with the double exponential transformation based on the interpolation of the highest derivatives (SIHD) for the differential equations. The error in the approximation of the solution is shown to converge at an exponential rate. The numerical results show that compared with the exiting results, our method is of high accuracy, of good convergence with little computational efforts. It is easy to treat nonhomogeneous mixed boundary condition for our method, which is unlike the traditional Sinc method.     

An Extension Landau-Lifshitz Model in Studying Soft Ferromagnetic Films

In this paper, we propose a model in studying soft ferromagnetic films, which is readily accessible experimentally. By using penalty approximation and compensated compactness, we prove that the dynamical equation in thin film has a local weak solution. Moreover, the corresponding linear equation is also dealt with in great detail.     

Robustness and exponentiality in redundant repairable systems

A redundant system of independent repairable components with general failure time and repair time distributions is considered. It is shown that the system failure time has an expectation dependent only on the mean failure times and mean repair times of the components and not on their distributions. An intuitive argument is provided, based on the time of onset of the quasi-stationary distribution on the set of working states, to show that for highly reliable systems, the system failure time is exponentially distributed to good approximation. The argument also justifies a simple figure of merit for the quality of the exponential approximation. A key ingredient in the analysis is the system relaxation time, an informal review of which is provided.     

各向同性湍流中颗粒引起湍流变动的直接模拟

本文通过直接数值模拟对均匀各向同性湍流中颗粒对湍流的变动作用进行了研究.颗粒相的体积分数很小而质量载荷足够大,以至于颗粒之间的相互作用可以忽略不计,而重点考虑颗粒与湍流间能量的交换。颗粒对湍流的反向作用使得湍动能的耗散率增强,以至于湍动能的衰减速率增大.湍动能的衰减速率随颗粒惯性的增大而增大。三维湍动能谱显示,颗粒对湍动能的影响在不同的尺度上是不均匀的。在低波数段,流体带动颗粒,而高波数段则相反.     

On the Weak Invariance Principle for Stationary Sequences under Projective Criteria

In this paper, we study the central limit theorem and its weak invariance principle for sums of a stationary sequence of random variables, via a martingale decomposition. Our conditions involve the conditional expectation of sums of random variables with respect to the distant past. The results contribute to the clarification of the central limit question for stationary sequences. Magda Peligrad is supported in part by a Charles Phelps Taft research support grant at the Univeristy of Cincinnati and the NSA grant H98230-05-1-0066.     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.     

Comparative Study on Large and Small Signal Theory for Intensity Modulation Response of Semiconductor Lasers Including Higher-Order Dispersion Terms

In this article, the comparison of large signal theory and small signal theory has been done with dispersive propagation of optical signal with IMDD (Intensity Modulation Direct Detection) systems for semiconductor lasers with higher-order dispersion terms. The expressions for an exact large signal theory and small signal theory including higher-order dispersion terms for propagation of an optical wave with sinusoidal amplitude and frequency modulation in a dispersive fiber have been derived. It is observed that small signal theory is more sensitive compared to large signal theory in terms of intensity modulation/direct detection systems. Also, it is reported that for large signal analysis the higher-order effects of dispersion can be ignored, whereas for small signal theory, the higher-order effects can be ignored for lower modulation frequencies only. The variation in the transfer function for various values of modulation indices are greater for small signal analysis than for large signal analysis. Also, as the intensity modulation index is increased, there is a decrease in the value of transfer function. The large signal model approximates the small signal model for lower values of the intensity modulation index.     

He-HCl体系各向异性势及分波散射截面的理论研究

首先用BFW势函数形式拟合了在CCSD(T)/aug-cc-pVQZ理论水平下计算的He-HCl相互作用能数据，获得了He原子与HCl分子相互作用的各向异性势；然后采用CC近似方法计算了He-HCl碰撞体系的微分散射截面和分波散射截面，并总结了分波散射截面的变化规律.结果表明，拟合势不但表达形式简洁，而且较好地描述了He-HCl系统相互作用的各向异性特征；利用碰撞体系分子间势的量子化学从头计算结果，可解决势能参数难以确定的问题.对进一步研究原子与分子碰撞机理有一定参考价值. 关键词： 各向异性势 势能参数 密耦近似 分波散射截面     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001