Mean Field Behaviour of Spin Systems with Orthogonal Interaction Matrix

For the long-range deterministic spin models with glassy behaviour of Marinari, Parisi and Ritort we prove weighted factorization properties of the correlation functions which represent the natural generalization of the factorization rules valid for the Curie–Weiss case.     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

V型三能级原子与非经典光场作用中光场特性的变化

研究了V型三能级原子BEC与双模压缩光场相互作用系统中,忽略原子间相互作用和考虑原子间相互作用时光场的正交压缩和光子数压缩。结果表明,光场的正交压缩依赖于压缩参数,而光子数压缩与压缩参数、光场信号强度有关,在一定条件下,两种压缩可同时存在。原子间相互作用影响两种压缩的涨落随时间变化的周期,以及正交分量涨落随时间变化的幅度,而对光子数压缩涨落随时间变化的幅度几乎无影响。     

Multilevel preconditioners for a quadrature Galerkin solution of a biharmonic problem

Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Efficient computation of natural convection in a concentric annulus between an outer square cylinder and an inner circular cylinder

In this work, the natural convection in a concentric annulus between a cold outer square cylinder and a heated inner circular cylinder is simulated using the differential quadrature (DQ) method. The vorticity‐stream function formulation is used as the governing equation, and the coordinate transformation technique is introduced in the DQ computation. It is shown in this paper that the outer square boundary can be approximated by a super elliptic function. As a result, the coordinate transformation from the physical domain to the computational domain is set up by an analytical expression, and all the geometrical parameters can be computed exactly. Numerical results for Rayleigh numbers range from 104 to 106 and aspect ratios between 1.67 and 5.0 are presented, which are in a good agreement with available data in the literature. It is found that both the aspect ratio and the Rayleigh number are critical to the patterns of flow and thermal fields. The present study suggests that a critical aspect ratio may exist at high Rayleigh number to distinguish the flow and thermal patterns. Copyright © 2002 John Wiley & Sons, Ltd.     

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature

We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables.     

关于凸曲面的几个定义的关系

本文讨论了凸曲面的几种定义及其关系，发现有的定义是局部凸的定义，有的是整体凸的定义，有的则对于局部凸和整体凸都适合，最后给出了各种定义之间互推的证明，对于局部凸和整体凸定义之间不能推证的，则说明了原因．     

Thermodynamic derivative properties and densities for hyperbaric gas condensates: SRK equation of state predictions versus Monte Carlo data

The ability of Soave–Redlich–Kwong cubic equation of state (SRK EoS) to predict densities and thermodynamic derivative properties such as thermal expansivity, isothermal compressibility, calorific capacity, and Joule–Thompson coefficients, for two gas condensates over a wide range of pressures (up to 110 MPa) was studied. The predictions of the EoS were compared to Monte Carlo simulation data obtained by Lagache et al. [M.H. Lagache, P. Ungerer, A. Boutin, Fluid Phase Equilibr. 220 (2004) 221]. Two completely different alpha functions for the SRK EoS attractive term were used and their respective effects on the predictions of such properties were analyzed. Also, two different forms of the crossed terms of the attractive parameter, a_ij, and three expressions of the crossed terms of the repulsive parameter, b_ij, were combined in different ways, and predictions were carried out. Little sensitivity of the properties on the chosen alpha function, except for the calorific capacities, was found in the systems studied. The most commonly used combination rules to model phase behavior of reservoir fluids, i.e. geometric and arithmetic forms of a_ij and b_ij, respectively, predicted very deficient results for these fluids at extreme conditions, specially for density calculations.