Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

Spatio-temporal symmetries and bifurcations via bi-orthogonal decompositions

Summary A tool for analyzing spatio-temporal complex physical phenomena was recently proposed by the authors, Aubry et al. [5]. This tool consists in decomposing a spatially and temporally evolving signal into orthogonal temporal modes (temporal “structures”) and orthogonal spatial modes (spatial “structures”) which are coupled. This allows the introduction of a temporal configuration space and a spatial one which are related to each other by an isomorphism. In this paper, we show how such a tool can be used to analyze space-time bifurcations, that is, qualitative changes in both space and time as a parameter varies. The Hopf bifurcation and various spatio-temporal symmetry related bifurcations, such as bifurcations to traveling waves, are studied in detail. In particular, it is shown that symmetry-breaking bifurcations can be detected by analyzing the temporal and spatial eigenspaces of the decomposition which then lose their degeneracy, namely their invariance under the symmetry. Furthermore, we show how an extension of the theory to “quasi-symmetries” permits the treatment of nondegenerate signals and leads to an exponentially decreasing law of the energy spectrum. Examples extracted from numerically obtained solutions of the Kuramoto-Sivashinsky equation, a coupled map lattice, and fully developed turbulence are given to illustrate the theory.     

Unconstrained and constrained global optimization of polynomial functions in one variable

In Floudas and Visweswaran (1990), a new global optimization algorithm (GOP) was proposed for solving constrained nonconvex problems involving quadratic and polynomial functions in the objective function and/or constraints. In this paper, the application of this algorithm to the special case of polynomial functions of one variable is discussed. The special nature of polynomial functions enables considerable simplification of the GOP algorithm. The primal problem is shown to reduce to a simple function evaluation, while the relaxed dual problem is equivalent to the simultaneous solution of two linear equations in two variables. In addition, the one-to-one correspondence between the x and y variables in the problem enables the iterative improvement of the bounds used in the relaxed dual problem. The simplified approach is illustrated through a simple example that shows the significant improvement in the underestimating function obtained from the application of the modified algorithm. The application of the algorithm to several unconstrained and constrained polynomial function problems is demonstrated.     

Cluster growth in particle-conserving cellular automata

A class of simple two-dimensional cellular automata with particle conservation is proposed for easy simulations of interacting particle systems. The automata are defined by the exchange of states of neighboring cells, depending on the configurations around the cells. By attributing an energy to a configuration of cells, we can select significant rules from the huge number of possible rules and classify them into several groups, based on the analogy with a binary alloy. By numerical calculations, cluster growth is found in two kinds of phases which reveal gas-solid coexistence and liquid droplets. Normalized scaling functions are obtained, and dynamical scaling is examined.     

非线性介质F－P干涉仪光束输出特性的理论研究

本文对准直光束射入含有非线性介质的Ｆ－Ｐ干涉仪内的光场分布进行了研究．由于非线性介质与光的作用，从Ｆ－Ｐ干涉仪出射的光束截面上的相移随位置的改变呈一定的分布，进而引起了干涉仪的透射率和输出光束重新分布。当干涉仪两个面的反射系数较大时，输出光束截面出现光强和相移的跃变．这种现象与以前在平面波假设下所得的光强分布所得结论有较大的不同．     

三维内肋管内插入螺旋扭带的强化传热实验

本文分别以水和乙二醇为工质，在Ｒｅ数范围为：６００～４００００，Ｐｒ数范围为：５．５～１１０之间，对四根分别插入三种不同扭率螺旋扭带的三维内助管内的换热和流阻特性进行了实验研究。结果表明：三维内肋管内加装扭带的强化传热技术适用于低Ｒｅ数下高Ｐｒ数工质的管内对流换热强化。根据实验值得到了流阻和换热关联式。     

一些高Tc超导体的弹性性质

 本文用超声相比较方法测定了高T_c超导体La_1.85Sr_0.15CuO₄，La₂CuO₄和YBa₂Cu₃O₇的纵波和横波声速，进而导出了它们的纵向模量、切变模量、杨氏模量、泊松比、德拜温度及定体比热。在La_1.85Sr_0.15CuO₄样品上，还进行了压力实验，发现所有弹性模量都是随压强增加而增加。定体比热c_V和泊松比σ在高压下则略有下降。德拜温度是随压强增加而增加的。     

二维变系数扩散方程交替分组显格式的稳定性分析

1.引言 由于高性能并行计算机的出现和并行计算的推动,十多年来,抛物型方程有限差分并行算法设计与分析一直受到关注. D.J.Evalns和A.R.B.Abdullah(1983,[1,2]利用Saul’yev非对称格式对常系数抛物方程设计了AGE(交替分组显格式)算法,并用矩阵分析的方法证明了该算法的无条件稳定性.该算法有明显的并行性,倍受推崇,且计算的实践([8],[9])表明它对变系数的抛物方程也是可行的,但稳定性的分析成为一个难点.张宝琳([3])在一维情     

ROBUSTNESS OF AN UPWIND FINITE DIFFERENCE SCHEME FOR SEMILINEAR CONVECTION-DIFFUSION PROBLEMS WITH BOUNDARY TURNING POINTS

We consider a singularly perturbed semilinear convection-diffusion problem with a boundary layer of attractive turning-point type. It is shown that its solution can be decomposed into a regular solution component and a layer component. This decomposi-tion is used to analyse the convergence of an upwinded finite difference scheme on Shishkin meshes.     

四元数矩阵方程AXAH=B的最小二乘解

引入了四元数矩阵范数的概念，通过使用四无数矩阵的奇异值分解，给出了四元数矩阵方程AXA^H＝B在最小二乘意义下的Hermitian解以及Skew-Hermitian解．