Subleading long-range interactions and violations of finite size scaling

We study the behavior of systems in which the interaction contains a long-range component that does not dominate the critical behavior. Such a component is exemplified by the van der Waals force between molecules in a simple liquid-vapor system. In the context of the mean spherical model with periodic boundary conditions we are able to identify, for temperatures close above T _c, finite-size contributions due to the subleading term in the interaction that are dominant in this region decaying algebraically as a function of L. This mechanism goes beyond the standard formulation of the finite-size scaling but is to be expected in real physical systems. We also discuss other ways in which critical point behavior is modified that are of relevance for analysis of Monte Carlo simulations of such systems. Received 21 November 2000 and Received in final form 28 February 2001     

Correlation between the Soret coefficient and the static structure factor in a polymer blend

Mutual mass diffusion and thermal diffusion has been investigated in poly(dimethylsiloxane)/ poly(ethylmethylsiloxane) (PDMS/PEMS) polymer blends of equal weight fractions. Molar masses ranged from below 1 to over 20 kg/mol. Both the mutual mass (D) and the thermal diffusion (D_T) coefficient contain a thermally activated factor with an activation temperature of 1415 K. The molar mass dependence of D_T is due to an end-group effect of the local friction coefficient. The thermal diffusion coefficient in the limit of long chains and infinite temperature is D_T^0, = - 1.69×10^-7cm²(sK)^-1. The Soret coefficient S_T of blends far enough away from a critical point is proportional to the static structure factor S(q = 0).     

A matrix-free high-order discontinuous Galerkin compressible Navier-Stokes solver: A performance comparison of compressible and incompressible formulations for turbulent incompressible flows

Both compressible and incompressible Navier-Stokes solvers can be used and are used to solve incompressible turbulent flow problems. In the compressible case, the Mach number is then considered as a solver parameter that is set to a small value, M ≈0.1, in order to mimic incompressible flows. This strategy is widely used for high-order discontinuous Galerkin (DG) discretizations of the compressible Navier-Stokes equations. The present work raises the question regarding the computational efficiency of compressible DG solvers as compared to an incompressible formulation. Our contributions to the state of the art are twofold: Firstly, we present a high-performance DG solver for the compressible Navier-Stokes equations based on a highly efficient matrix-free implementation that targets modern cache-based multicore architectures with Flop/Byte ratios significantly larger than 1. The performance results presented in this work focus on the node-level performance, and our results suggest that there is great potential for further performance improvements for current state-of-the-art DG implementations of the compressible Navier-Stokes equations. Secondly, this compressible Navier-Stokes solver is put into perspective by comparing it to an incompressible DG solver that uses the same matrix-free implementation. We discuss algorithmic differences between both solution strategies and present an in-depth numerical investigation of the performance. The considered benchmark test cases are the three-dimensional Taylor-Green vortex problem as a representative of transitional flows and the turbulent channel flow problem as a representative of wall-bounded turbulent flows. The results indicate a clear performance advantage of the incompressible formulation over the compressible one.     

On optics of human meridians

A new concept and its methodology for studying human meridians are presented based on rigorous and scientific observation on the objective existence of human meridians in view of biomedical optics. According to this methodology, the infrared radiant characteristics of acupuncture meridians over human body and the optical transport properties of light propagating along the meridian are reported. This study, thus, confirms the existence of acupuncture meridians, sheds new light on an approach to investigation of human meridians and offers a new perspective in understanding the potential meridian functions such as energy and information transfer and physiological regulation. Supported by the National Key Basic Research Program of China (Grant No. 2006CB504505), the National Natural Science Foundation of China (Grant Nos. 60578056 and 30572309), the Science Research Foundation of Ministry of Health & United Fujian Provincial Health and Education Project for Tackling the Key Research of China (Grant No. WKJ2005-2-004), the Young Scientists and Technicians Innovation Project of Fujian Province (Grant No. 2007F3026), and the Fund from Fujian Normal University (Grant No. 2008100218)     

Linking-Preserving Perturbations of Symmetric Functionals

We consider paths of functionals starting with one which is invariant under the action of an arbitrary group of symmetries. We give conditions for the existence of an unbounded sequence of critical values of the non-symmetric functional at the end of the path in terms of the growth of the critical values of the symmetric one. We apply this to obtain a multiplicity result for a system of elliptic equations whose symmetries are perturbed by a linear term and a non-homogeneous boundary condition.     

Rotating an interval and a circle

We compare periodic orbits of circle rotations with their counterparts for interval maps. We prove that they are conjugate via a map of modality larger by at most 2 than the modality of the interval map. The proof is based on observation of trips of inhabitants of the Green Islands in the Black Sea.

     

Asymptotic Uniqueness of Best Rational Approximants of Given Degree to Markov Functions in L 2 of the Circle

We improve over a sufficient condition given in [8] for uniqueness of a nondegenerate critical point in best rational approximation of prescribed degree over the conjugate-symmetric Hardy space of the complement of the disk. The improved condition connects to error estimates in AAK approximation, and is necessary and sufficient when the function to be approximated is of Markov type. For Markov functions whose defining measure satisfies the Szego condition, we combine what precedes with sharp asymptotics in multipoint Padé approximation from [43], [40] in order to prove uniqueness of a critical point when the degree of the approximant goes large. This lends perspective to the uniqueness issue for more general classes of functions defined through Cauchy integrals.     

ON THE CONVERGENCE OF KING-WERNER ITERATION METHOD IN BANACH SPACE ON THE CONVERGENCE OF KING-WERNER ITERATION METHOD IN BANACH SPACE

1. IntroductionLetf(x) = 0 (1.1)where j: X - Y is a norilineax operator which maps Banach space X into Baaedspace Y. The well-known iteration methods for solving (1.1) are the Nixon methodaam very ldnds of its improvement methods. One of them is the so called King-Wernerm6thod denned bykw(p, x03 yo):which is established by King in [7], Werner in [12] in d~nt formulas, respectively.It is interesting that the method (1.2) is of order 1 fi with the same functioncompotatinn coSt and twO ti…     

Weakly <Emphasis Type="Italic">φ</Emphasis>-pairs and common fixed points in cone metric spaces

In this paper we introduce a weak contractive condition, called weakly φ-pair, for two mappings in the framework of cone metric spaces and we prove a theorem which ensures existence and uniqueness of common fixed points for such mappings. Also we obtain a result on points of coincidence. These results extend and generalize well-known comparable results in the literature. The authors are supported by Università degli Studi di Palermo, R. S. ex 60%.     

Symmetrized-lexicographic order and the method of points

A variant of lexicographic order called symmetrized-lexicographic order is defined. The symmetrized-lexicographic order finds its application in the goal programming procedure called the method of points. The symmetrized-lexicographic order is shown to be representable using linear algebra and, thus, the method of points can be implemented as a linear programming problem.