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.     

Linear EV model with replicate observations on independent variables

This paper studies the linear EV model when replicate observations are made only on independent variables. We construct the estimates of regression coefficients and prove the consistency and asymptotic normality under some proper conditions. Results obtained reveal the difference between the case where the independent and dependent variables are observed repeatedly and simultaneously and the case studied in this article.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Commuting and stable feedback design for switched linear systems

In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching.