Heat transfer in lattice BGK modeled fluid

The thermal lattice BGK model is a recently suggested numerical tool aiming at solving problems of thermohydrodynamics. The quality of the lattice BGK simulation is checked in this paper by calculating temperature profiles in the Couette flow under different Eckert and Mach numbers. A revised lower order model is proposed to improve the accuracy and the higher order model is proved to be advantageous in this respect, especially in the flow regime with a higher Mach number.     

A simple formula for mean multiplexing delay for independent regenerative sources

Simple expressions are given for the mean delay, mean waiting time, and mean busy period length in a multiplexer. Data streams with active periods having a general distribution are permitted, and the data rate during the active periods can be random. Data can also arrive in batches. The key restrictions of the model are that the sources are independent, idle periods are exponentially distributed, and a source generates at least enough data during an active period to keep the server busy throughout the period. The exact formulas allow evaluation of the error in approximations such as a heavy traffic diffusion approximation.Both continuous and discrete time models are considered. The discrete-time model includes that studied by Viterbi and subsequently generalized by Neuts. The Pollaczek-Khinchine formula for the mean amount of work in anM/GI/1 queue is retrieved as a limiting case.Preliminary version presented at IEEE INFOCOM, San Francisco, April 1993.     

PADE’型逼近的收敛性

文章给出了Ｐａｄｅ型逼近积分形式的误差公式，并用该公式证明了Ｐａｄｅ型逼近的两个收敛定理．     

Bivariate Free Knot Splines

We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature.     

2+1维SU(2)格点规范场胶球质量的七阶RPA近似

采用无规相近似(RPA)方法,用空心图作为试探波函数,利用Feymann?Hellman定理计算七阶2?+?1维SU(2?)格点规范场的胶球质量,在弱耦合区1/g2?=1.0?–?1.8胶球质量表现出良好的标度行为,基本趋于常数(m/e2?≈1.2?0±0?.0?1)?.     

Magnetic bubble refraction and quasibreathers in inhomogeneous antiferromagnets

We study the dynamics of magnetic bubble solitons in a two-dimensional isotropic antiferromagnetic spin lattice in the case where the exchange integral J(x, y) is position dependent. In the near-continuum regime, this system is described by the relativistic O(3) sigma model on a space-time with a spatially inhomogeneous metric determined by J. We use the geodesic approximation to describe the low-energy soliton dynamics in this system: the n-soliton motion is approximated by geodesic motion in the moduli space M _n of static n-solitons equipped with the L ² metric γ. We obtain explicit formulas for γ for various natural choices of J(x, y). Based on these, we show that single soliton trajectories are refracted with J⁻¹ being analogous to the refractive index and that this refraction effect allows constructing simple bubble lenses and bubble guides. We consider the case where J has a disk inhomogeneity (with the value J ₊ outside a disk and J ₋ < J ₊ inside) in detail. We argue that for sufficiently large J ₊/J ₋, this type of antiferromagnet supports approximate quasibreathers: two or more coincident bubbles confined within the disk spin internally while their shape oscillates with a generically incommensurate period. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 152, No. 1, pp. 191–208, July, 2007.     

洛希极限和引力作用范围的近似改正

运用广义相对论的后牛顿效应，得到洛希(Roche)极限和引力作用范围的近似改正表示式，表明洛希极限不仅与牛顿引潮力及惯性离心力有关，而且受重力后牛顿近似改正的影响。并且估计、讨论了太阳系天体的某些具体情况。     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.     

The combination technique and some generalisations

The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.

The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique.