On pointwise decay rates of time‐periodic solutions to the Navier–Stokes equation

We study the existence of a time‐periodic solution with pointwise decay properties to the Navier–Stokes equation in the whole space. We show that if the time‐periodic external force is sufficiently small in an appropriate sense, then there exists a time‐periodic solution $\{u,p\}$ of the Navier–Stokes equation such that $|{?}^j{u(t,x)|=O(|x|}^{1?n?j})$ and $|{?}^j{p(t,x)|=O(|x|}^{?n?j})(j=0,1,\dots )$ uniformly in $t\in \mathbb{R}$ as $|x|\to \infty$. Our solution decays faster than the time‐periodic Stokes fundamental solution and the faster decay of its spatial derivatives of higher order is also described.     

Mass distribution and skewness for passive scalar transport in pipes with polygonal and smooth cross sections

We extend our previous results characterizing the loading properties of a diffusing passive scalar advected by a laminar shear flow in ducts and channels to more general cross‐sectional shapes, including regular polygons and smoothed corner ducts originating from deformations of ellipses. For the case of the triangle and localized, cross‐wise uniform initial distributions, short‐time skewness is calculated exactly to be positive, while long‐time asymptotics shows it to be negative. Monte Carlo simulations confirm these predictions, and document the timescale for sign change. The equilateral triangle appears to be the only regular polygon with this property—all others possess positive skewness at all times. Alternatively, closed‐form flow solutions can be constructed for smooth deformations of ellipses, and illustrate how both nonzero short‐time skewness and the possibility of multiple sign switching in time is unrelated to domain corners. Exact conditions relating the median and the skewness to the mean are developed which guarantee when the sign for the skewness implies front (more mass to the right of the mean) or back (more mass to the left of the mean) “loading” properties of the evolving tracer distribution along the pipe. Short‐ and long‐time asymptotics confirm this condition, and Monte Carlo simulations verify this at all times. The simulations are also used to examine the role of corners and boundaries on the distribution for short‐time evolution of point source , as opposed to cross‐wise uniform, initial data.     

Finite‐size corrections at the hard edge for the Laguerre β ensemble

A fundamental question in random matrix theory is to quantify the optimal rate of convergence to universal laws. We take up this problem for the Laguerre β ensemble, characterized by the Dyson parameter β, and the Laguerre weight , in the hard edge limit. The latter relates to the eigenvalues in the vicinity of the origin in the scaled variable . Previous work has established the corresponding functional form of various statistical quantities—for example, the distribution of the smallest eigenvalue, provided that . We show, using the theory of multidimensional hypergeometric functions based on Jack polynomials, that with the modified hard edge scaling , the rate of convergence to the limiting distribution is , which is optimal. In the case , general the explicit functional form of the distribution of the smallest eigenvalue at this order can be computed, as it can for and general . An iterative scheme is presented to numerically approximate the functional form for general .     

Optimal Planar Interception with Fixed End Conditions: Approximate Solutions

In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper.     

Computation of limit periodic continued fractions. A survey

Over the last 20 years a large number of algorithms has been published to improve the speed and domain of convergence of continued fractions. In this survey we show that these algorithms are strongly related. Actually, they essentially boil down to two main principles.We also prove some results on asymptotic expansions of tail values of limit periodic continued fractions.Dedicated to Luigi Gatteschi on his seventieth birthdayThis research was partially supported by The Norwegian Research Council and by the HMC project ROLLS, under contract CHRX-CT93-0416.     

Structural and thermodynamic properties of AlB2 compound

We employ a first-principles plane wave method with the relativistic analytic pseudopotential of Hartwigsen, Goedecker and Hutter (HGH) scheme in the frame of DFT to calculate the equilibrium lattice parameters and the thermodynamic properties of AlB₂ compound with hcp structure. The obtained lattice parameters are in good agreement with the available experimental data and those calculated by others. Through the quasi-harmonic Debye model, obtained successfully are the dependences of the normalized lattice parameters a/a₀ and c/c₀ on pressure P, the normalized primitive cell volume V/V₀ on pressure P, the variation of the thermal expansion α with pressure P and temperature T, as well as the Debye temperature \Theta_D and the heat capacity C_V on pressure P and temperature T.     

A rational approximation and its applications to nonlinear partial differential equations on the whole line

An orthogonal system of rational functions is discussed. Some inverse inequalities, imbedding inequalities and approximation results are obtained. Two model problems are considered. The stabilities and convergences of proposed rational spectral schemes and rational pseudospectral schemes are proved. The techniques used in this paper are also applicable to other problems on the whole line. Numerical results show the efficiency of this approach.     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002