On f-injective modules

In this paper, the notions of f-injective and f^*-injective modules are introduced. Elementary properties of these modules are given. For instance, a ring R is coherent iff any ultraproduct of f-injective modules is absolutely pure. We prove that the class S^* \Sigma^* of f^*-injective modules is closed under ultraproducts. On the other hand, S^* \Sigma^* is not axiomatisable. For coherent rings R, S^* \Sigma^* is axiomatisable iff every c₀ \chi_0 -injective module is f^*-injective. Further, it is shown that the class S \Sigma of f-injective modules is axiomatisable iff R is coherent and every c₀ \chi_0 -injective module is f-injective. Finally, an f-injective module H, such that every module embeds in an ultraprower of H, is given.     

Unconditional Bases, the Matrix Muckenhoupt Condition, and Carleson Series in a Spectrum

Two families of functions constructed by a system of n scalar Muckenhoupt weights are studied. Criteria are given under which these families are unconditional bases. From the point of view of the spectral operator theory, the problem is reduced to the study of the structure of n-dimensional perturbations of the integration operator. Weighted estimates for the Hilbert transform in the spaces of vector-functions are applied to construct an operator mapping functions of the studied families to vector-valued rational functions. The concept of the Carleson series is used in the study of the following problem: when do vector-valued rational functions form an unconditional basis? Bibliography: 8 titles.     

Numerical solutions of the shallow water equations with discontinuous bed topography

A simple scheme is developed for treatment of vertical bed topography in shallow water flows. The effect of the vertical step on flows is modelled with the shallow water equations including local energy loss terms. The bed elevation is denoted with z_b^‐ for the left and z_b⁺ for the right values at each grid point, hence exactly representing a discontinuity in the bed topography. The surface gradient method (SGM) is generalized to reconstruct water depths at cell interfaces involving a vertical step so that the fluxes at the cell interfaces can accurately be calculated with a Riemann solver. The scheme is verified by predicting a surge crossing a step, a tidal flow over a step and dam‐break flows on wet/dry beds. The results have shown good agreements compared with analytical solutions and available experimental data. The scheme is efficient, robust, and may be used for practical flow calculations. Copyright © 2002 John Wiley & Sons, Ltd.     

Higher-dimensional homogeneous cosmological models as autonomous dynamical systems

The field equations for homogeneous models in an arbitrary number of dimensions form a Hamiltonian system with constraint forces. Due to the monotonic behavior of the determinant of the induced metric, the evolution of the system can be interpreted as the motion of a particle in an explicitly time-dependent potential. Considering vacuum models, we show that this explicit time-dependence can be eliminated. Using the scaling properties of the Ricci tensor we obtain an autonomous system, for which we can also find a Liapunov function in terms of the n-dimensional Ricci curvature.     

Solving the problem of contact equilibrium of a punch and an elastic body

The variational problem of contact equilibrium of a punch and an elastic body is considered. An equivalent formulation of the problem is given in variational inequality form. Existence and uniqueness of the solution is investigated in a particular case. A penalty method is proposed for approximate solution of the problem.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 56, pp. 97–103, 1985.     

Numerical analysis of near electromagnetic fields of a parabolic cylinder and a paraboloid of revolution

Translated from Chislennye Metody Resheniya Obratnykh Zadach Matematicheskoi Fiziki, pp. 119–127.     

Fluorescence spectra of different configurations of the diphenyl molecule in solid paraffin solutions

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 51, No. 2, pp. 212–217, August, 1989.     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.