A stability of the steady flow of compressible viscous fluid with respect to initial disturbance (v∞ ≠ 0)

We consider a compressible viscous fluid with the velocity at infinity equal to a strictly non‐zero constant vector in ?³. Under the assumptions on the smallness of the external force and velocity at infinity, Novotny–Padula (Math. Ann. 1997; 308 :439– 489) proved the existence and uniqueness of steady flow in the class of functions possessing some pointwise decay. In this paper, we study stability of the steady flow with respect to the initial disturbance. We proved that if H³‐norm of the initial disturbance is small enough, then the solution to the non‐stationary problem exists uniquely and globally in time, which satisfies a uniform estimate on prescribed velocity at infinity and converges to the steady flow in L_q‐norm for any number q? 2. Copyright © 2006 John Wiley & Sons, Ltd.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

具有某种断面的半群的研究进展

本文综述了几类具有特殊断面的半群的近期研究结果。在介绍逆半群和正则半群的一般结构之后，概述了具有逆断面的正则半群的结构和同余格的研究成果。总结了作为逆断面的推广的可裂断面，纯正断面，正则^*－断面和恰当断面。提出了可以进一步研究的重要的问题。     

Sub(L)中的五边形格特征及其数量不等式

五边形结构在刻画格的特征方面具有十分重要作用，应用格论及组合数学的方法讨论了格L与其子格格Sub(L)中所含五边形格之间的数量关系，给出了有限格L的子格格中三个元生成五边形格的充要条件，同时给出了Sub(L)所含不同五边形格数量的一个下界。     

一维光学格子孤子的传输特性及控制研究

利用解析和数值方法研究了在具有横向折射率周期性调制的克尔型非线性介质中光学格子孤子的传输，得到了孤子参数的演化方程以及格子孤子的形成和稳定传输的条件.结果表明：当光束的入射角小于某临界角度时，光束可被类似波导形式的路径俘获而稳定传输，该临界角随折射率调制周期、调制深度的增加而增大，且光束越窄临界值越大.此外，线性空间啁啾虽然对光束传输的中心位置没有任何影响，但会导致光束发散从而破坏格子孤子的形成和稳定传输，对此提出了采用特定功率取值来补偿啁啾作用从而形成格子孤子的方案. 关键词： 光孤子 光学格子 光传输 矩方法     

Development of a Simulation Model for Solid Objects Suspended in a Fluctuating Fluid

We introduce a new scheme for the future application of Real-coded Lattice Gas (RLG) to the numerical simulation of suspended solid objects in a fluctuating fluid environment. The reproduction of Brownian motion for a single solid object is verified through the Gaussian distribution of its displacements. The effectiveness of the solid–solid interaction model is also confirmed in an N-body simulation.     

The generation of three-dimensional internal waves and attendant boundary layers in a viscous continuously stratified fluid. Construction of an analytical solution

An analytical solution of a linearized problem of the emission of periodic internal waves by part of a plane which oscillates with a small amplitude in an arbitrary direction in a viscous exponentially stratified fluid is constructed. Solutions of the dispersion equation are given for all positions of the emitting surface (arbitrary, vertical, horizontal, and critical when one of the beam propagation directions is collinear with the emitting surface). The possibility of transition to the case of a uniform fluid, which is important for applications, is analyzed.     

Simulation of viscous water column collapse using adapting hierarchical grids

An adaptive hierarchical grid‐based method for predicting complex free surface flows is used to simulate collapse of a water column. Adapting quadtree grids are combined with a high‐resolution interface‐capturing approach and pressure‐based coupling of the Navier–Stokes equations. The Navier–Stokes flow solution scheme is verified for simulation of flow in a lid‐driven cavity at Re=1000. Two approaches to the coupling of the Navier–Stokes equations are investigated as are alternative face velocity and hanging node interpolations. Collapse of a water column as well as collapse of a water column and its subsequent interaction with an obstacle are simulated. The calculations are made on uniform and adapting quadtree grids, and the accuracy of the quadtree calculations is shown to be the same as those made on the equivalent uniform grids. Results are in excellent agreement with experimental and other numerical data. A sharp interface is maintained at the free surface. The new adapting quadtree‐based method achieves a considerable saving in the size of the computational grid and CPU time in comparison with calculations made on equivalent uniform grids. Copyright © 2005 John Wiley & Sons, Ltd.     

Analysis of a 2D “liquid”plasma lattice

Adustyplasmacanbedefinedasacomplicatedplasmacontainingsmallsolidmattercalleddustgrainsordustparticles,whichareusuallychargednegatively,duetoelectronshighermobilitythanion,bycollectingelectronsandionsfromthebackgroundplasma.Theuniverseisfilledwithdustyplasmassuchasplanetaryrings,comettails,andnebulae.Also,inindustrialplasmaprocessing,particulatessuspendedinplasmaarethemajorcontaminationinsemiconductormanufacture.Studiesondustyplasmahavebeenextendedtofar-flungtopicssuchaswaves,instabilities,stro…     

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.