A second order accuracy for a full discretized time-dependent Navier–Stokes equations by a two-grid scheme

We study a second-order two-grid scheme fully discrete in time and space for solving the Navier–Stokes equations. The two-grid strategy consists in discretizing, in the first step, the fully non-linear problem, in space on a coarse grid with mesh-size H and time step Δt and, in the second step, in discretizing the linearized problem around the velocity u _H computed in the first step, in space on a fine grid with mesh-size h and the same time step. The two-grid method has been applied for an analysis of a first order fully-discrete in time and space algorithm and we extend the method to the second order algorithm. This strategy is motivated by the fact that under suitable assumptions, the contribution of u _H to the error in the non-linear term, is measured in the L ² norm in space and time, and thus has a higher-order than if it were measured in the H ¹ norm in space. We present the following results: if h ² = H ³ = (Δt)², then the global error of the two-grid algorithm is of the order of h ², the same as would have been obtained if the non-linear problem had been solved directly on the fine grid.     

The lifetimes of positrons in oxides of arsenic and antimony

The lifetimes of positrons in crystalline powders of dimeric oxides of arsenic and antimony, and in trioxymethylene and polyoxymethylene are reported. In As₄O₆ and polyoxymethylene a longer componentτ ₄ is observed in addition to the usually observedτ ₂ component. The variation ofτ ₄ with temperature and pressure is studied in As₄O₆. On the basis of these results and the X-ray diffraction pictures, it is suggested that ortho-positronium atoms quenched in intercrystallite regions in As₄O₆ gives rise toτ ₄.     

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

In a rectangular grid, given two sets of nodes, (sources) and (sinks), of size each, the disjoint paths (DP) problem is to connect as many nodes in to the nodes in using a set of “disjoint” paths. (Both edge-disjoint and vertex-disjoint cases are considered in this paper.) Note that in this DP problem, a node in can be connected to any node in . Although in general the sizes of and do not have to be the same, algorithms presented in this paper can also find the maximum number of disjoint paths pairing nodes in and . We use the network flow approach to solve this DP problem. By exploiting all the properties of the network, such as planarity and regularity of a grid, integral flow, and unit capacity source/sink/flow, we can optimally compress the size of the working grid (to be defined) from O(N²) to O(N^1.5) and solve the problem in O(N^2.5) time for both the edge-disjoint and vertex-disjoint cases, an improvement over the straightforward approach which takes O(N³) time.     

Features of electron density and temperature in the 500–3500 km region of the plasmasphere—(1) Dawn and dusk sectors

Dawn-dusk features of the plasmasphere are examined for intervals in February and September 1969, using electrostatic probe data ofN _e andT _e from the ISIS-I satellite. Clear plasmatrough formation is seen in the vicinity of 70° geomagnetic latitude in both dawn and dusk sectors in the 1500–3500 km region, but the plasmatrough is absent in the altitude range 500–1500 km. The plasmatrough minimum near 70°φ exhibits no asymmetry between dawn and dusk sectors in its latitudinal position. TheT _e peak associated with the plasmatrough is more pronounced in the dawn sector. DawnN _e is less than duskN _e, but dawnT _e exceeds duskT _e. The influence of processes in the magnetosphere in causing these features is examined.     

Approximating the Pathway Axis and the Persistence Diagrams for a Collection of Balls in 3-Space

Given a collection ℬ of balls in a three-dimensional space, we wish to explore the cavities, voids, and tunnels in the complement space of ∪ℬ. We introduce the pathway axis of ℬ as a useful subset of the medial axis of the complement of ∪ℬ and prove that it satisfies several desirable geometric properties. We present an algorithm that constructs the pathway graph of ∪ℬ, a piecewise-linear approximation of the pathway axis. At the heart of our approach is an approximation scheme that constructs a collection K{\mathcal{K}} of same-size balls that approximate ℬ so that the Hausdorff distance between ∪ℬ and èK\bigcup{\mathcal{K}} is bounded by a prescribed parameter. We prove a bound on the ratio between the number of balls in K{\mathcal{K}} and the number of balls in ℬ. We employ this bound and the approximation scheme to show how to approximate the persistence diagrams for ∪ℬ, which can be used to extract major topological features such as the large voids and tunnels in the complement of ∪ℬ. We show that our approach is superior in terms of complexity to the standard point-sample approaches for the two problems that we address in this paper: approximating the pathway axis of ℬ and approximating the persistence diagrams for ∪ℬ. In a companion paper we introduce MolAxis, a tool for the identification of channels in macromolecules that demonstrates how the pathway graph and the persistence diagrams are used to identify plausible pathways in the complement of molecules.     

Influence of SiO2 in SiCp on the microstructure and impact strength of Al/SiCp composites fabricated by pressureless infiltration

The effect of SiO₂ in SiC_p and the following processing parameters on the microstructure and impact strength of Al/SiC_p composites fabricated by pressureless infiltration was investigated: Mg content in the aluminum alloy, SiC particle size, and holding time. Preforms of SiC_p in the form of rectangular bars (10 × 1 × 1 cm) were infiltrated at 1150°C in an argon→nitrogen atmosphere for 45 and 60 min by utilizing two aluminum alloys (Al-6 Mg-11 Si and Al-9 Mg-11 Si, wt.%). The results obtained show that the presence of SiO₂ in SiC affects the microstructure and impact strength of the composites significantly. When Al₄C₃ is formed, the impact strength decreases. However, a high proportion of SiC to SiO₂ limits the formation of the unwanted Al₄C₃ phase in the composites. Also, a higher content of Mg in the Al alloy lowers the residual porosity and, consequently, increases the composite strength. The impact strength grows with decrease in SiC particle size and increases considerably when the residual porosity is less than 1%. Russian translation published in Mekhanika Kompozitnykh Materialov, Vol. 42, No. 3, pp. 401–418, May–June, 2006.     

A note on the C2/G/1 queue and the C2/G/1 loss system

In this note, we consider the steady-state probability of delay (PW) in the C₂/G/1 queue and the steady-state probability of loss (p_loss) in the C₂/G/1 loss system, in both of which the interarrival time has a two-phase Coxian distribution. We show that, for c_X ²<1, where c_X is the coefficient of variation of the interarrival time, both p_loss and PW are increasing in β(s), the Laplace–Stieltjes transform of the general service-time distribution. This generalises earlier results for the GE₂/G/1 queue and the GE₂/G/1 loss system. The practical significance of this is that, for c_X ²<1, p_loss in the C₂/G/1 loss system and PW in the C₂/G/1 queue are both increasing in the variability of the service time. This revised version was published online in June 2006 with corrections to the Cover Date.     

On Domains and Ranges of Powers of Linear Relations in Linear Spaces

Let A and B be linear relations in a linear space such that B is a restriction of A. The main result of this note is an estimate for the codimension of the range of B ⁿ in the range of A ⁿ in terms of the codimension of the range of B in the range of A and the codimension of the kernel of B in the kernel of A.     

On the desking completions,theta completions and theta pairs for maximal subgroups *

Given a maximal subgroup M of a finite group G,a θ completion of M in G is any subgroup C such that C is not contained in M while M_G , the core of M in G, is contained in C and C/M_G has no propor normal subgroup of G/M_G . By using this concept we can reveal the relationship between the concepts of completions and θ-pairs introduced respectively by Deskins, Mukherjee and Bhattacharya. The concept of maximal θ-completions offers a convenience for us to study the Deskins completions in inductions. We obtain in this paper several results which imply a group to be solvable, supersolvable and nilpotent.     

How fast are the particles of super-Brownian motion?

In this paper we investigate fast particles in the range and support ofsuper-Brownian motion in the historical setting. In this setting eachparticle of super-Brownian motion alive at time t is represented by apath w:[0,t]→ℝ ^d and the state of historical super-Brownian motionis a measure on the set of paths. Typical particles have Brownian paths,however in the uncountable collection of particles in the range of asuper-Brownian motion there are some which at exceptional times movefaster than Brownian motion. We determine the maximal speed of allparticles during a given time period E, which turns out to be afunction of the packing dimension of E. A path w in the support ofhistorical super-Brownian motion at time t is called a-fast if . Wecalculate the Hausdorff dimension of the set of a-fast paths in thesupport and the range of historical super-Brownian motion. A valuabletool in the proofs is a uniform dimension formula for the Browniansnake, which reduces dimension problems in the space of stopped paths to dimension problems on the line. Received: 27 January 2000 / Revised version: 28 August 2000 / Published online: 24 July 2001     

LM-g splines

As an extension of the notion of an L-g spline, three mathematical structures called LM-g splines of types I, II, and III are introduced. Each is defined in terms of two differential operators the coefficients a_j, J = 0,…, n − 1, and b_i, I = 0,…, m, are sufficiently smooth; and b_m is bounded away from zero on [0, T]. Each of the above types of splines is the solution of an optimization problem more general than the one used in the definition of the L-g spline and hence it is recognized as an entity which is distinct from and more general mathematically than the L-g spline. The LM-g splines introduced here reduce to an L-g spline in the special case in which m = 0 and b₀ = constant ≠ 0. After the existence and uniqueness conditions, characterization, and best approximation properties for the proposed splines are obtained in an appropriate reproducing kernel Hilbert space framework, their usefulness in extending the range of applicability of spline theory to problems in estimation, optimal control, and digital signal processing are indicated. Also, as an extension of recent results in the generalized spline literature, state variable models for the LM-g splines introduced here are exhibited, based on which existing least squares algorithms can be used for the recursive calculation of these splines from the data.     

Random Flights in Higher Spaces

We consider in this paper random flights in ℝ ^d performed by a particle changing direction of motion at Poisson times. Directions are uniformly distributed on hyperspheres S ₁ ^d . We obtain the conditional characteristic function of the position of the particle after n changes of direction. From this characteristic function we extract the conditional distributions in terms of (n+1)−fold integrals of products of Bessel functions. These integrals can be worked out in simple terms for spaces of dimension d=2 and d=4. In these two cases also the unconditional distribution is determined in explicit form. Some distributions connected with random flights in ℝ³ are discussed and in some special cases are analyzed in full detail. We point out that a strict connection between these types of motions with infinite directions and the equation of damped waves holds only for d=2. Related motions with random velocity in spaces of lower dimension are analyzed and their distributions derived.     

Strong Compactness and a Global Version of a Theorem of Ben‐David and Magidor

Starting with a model in which κ is the least inaccessible limit of cardinals δ which are δ⁺ strongly compact, we force and construct a model in which κ remains inaccessible and in which, for every cardinal γ < κ, □_γ+ω fails but □_{γ+ω, ω} holds. This generalizes a result of Ben‐David and Magidor and provides an analogue in the context of strong compactness to a result of the author and Cummings in the context of supercompactness.     

Shifting the balance of health care into the 21st century

Some of the present or likely future key shifts in the balance of health care in Europe are set out; shifts in when and where and how care is delivered, what is delivered and who is cared for. An illustrative assessment is given of ways in which ORMS can help in coping with the uncertainty, complexity and change that underlies many of the observed shifts in the balance of health care.     

A Problem in Linear Matrix Approximation

Let A be a normal operator in ??(H), H a complex Hilbert space, and let ? _A = ? {AX - XA:X ∈ ??(H)} be the commutator subspace of ??(H) associated with A. If B in ??(H) commutes with A, then B is orthogonal to ?_A with respect to the spectral norm; i.e., the null operator is an element of best approximation of B in ? _A. This was proved by J. Anderson in 1973 and extended by P. J. Maher with respect to the Schatten p-norm recently. We take a look at their result from a more approximation theoretical point of view in the finite dimensional setting; in particular, we characterize all elements of best approximation of B in R_A and prove that the metric projection of H onto ?_A is continuous.     

The Cauchy Problem for the Kadomtsev-Petviashvili (KPII) Equation in Three Space Dimensions

We prove the existence and uniqueness of local solutions in time for the Kadomtsev-Petviashvili equation (KPII) in ?³ for initial data in a suitable anisotropic Sobolev space of functions which have essentially 1⁺ derivative in the variable x and 0⁺ derivatives in the variables y and z.     

Pfaffian graphs, <Emphasis Type="Italic">T</Emphasis>-joins and crossing numbers

We characterize Pfaffian graphs in terms of their drawings in the plane. We generalize the techniques used in the proof of this characterization, and prove a theorem about the numbers of crossings in T-joins in different drawings of a fixed graph. As a corollary we give a new proof of a theorem of Kleitman on the parity of crossings in drawings of K _2j+1 and K _2j+1,2k+1. Partially supported by NSF grants DMS-0200595 and DMS-0701033.     

An interpretation of the Dittert conjecture in terms of semi-matchings

Let G be K_n,n with non-negative edge weights and let U and V be the two colour classes of vertices in G. We define a k-semimatching in G to be a set of k edges such that the edges either have distinct ends in U or distinct ends in V. Semimatchings are to be counted according to the product of the weights on the edges in the semimatching. The Dittert conjecture is a longstanding open problem involving matrix permanents. Here we show that it is equivalent to the following assertion: For a fixed total weight, the number of n-semimatchings in G is maximised by weighting all edges of G equally. We also introduce sub-Dittert functions which count k-semimatchings and are analogous to the subpermanent functions which count k-matchings. We prove some results about the extremal values of our sub-Dittert functions, and also that the Dittert conjecture cannot be disproved by means of unweighted graphs.     

三维动边值问题的迎风差分方法

可压缩可混溶油、水三维渗流动边值问题的研究,对重建盆地发育中油气资源运移、聚集的历史和评估油气资源的勘探与开发有重要的价值, 其数学模型是一组非线性耦合偏微分方程组的动边值问题. 该文对有界域的动边值问题提出一类新的二阶修正迎风差分格式, 应用区域变换、 变分形式、能量方法、差分算子乘积交换性理论、高阶差分算子的分解、微分方程先验估计的理论和技巧, 得到了最佳 $l^2$ 误差估计结果. 该方法已成功应用到油资评估的数值模拟中. 它对这一领域的模型分析, 数值方法和软件研制均有重要的价值.