A problem with free boundary for the Navier-Stokes equations. II

Institute of Mathematics and Cybernetics, Lithuanian Academy of Sciences. Vilnius University. Translated from Litovskii Matematicheskii Sbornik (Lietuvos Matematikos Rinkinys), Vol. 31, No. 2, pp. 337–350, April–June, 1991.     

Formation of Diol Divinyl Diethers in the Synthesis of 1,2-Epoxy-3-(vinyloxyalkoxy)propanes

Russian Journal of Organic Chemistry -     

A Parabolic Spline on a Nonuniform Grid

We obtain estimates for errors of interpolation on a nonuniform grid for a parabolic nonperiodic spline of defect 1.     

Elasticity in nanocrystalline Nd2Fe14B+αFe magnetic composites

The dynamic Young modulus (E) of magnetic Nd₂Fe₁₄B+αFe nanocomposites is investigated with mechanical spectroscopy techniques (vibrating reed configuration, f≈1.5 kHz <10⁻⁶). Reduced values of E are obtained (88–152 GPa) as compared with that predicted by the rule of mixtures for the composite (164 GPa). Three contributions to this reduction are briefly discussed: a large volume fraction of the specimen with grain boundary like structure; internal pores, resulting from the high cooling rate during processing (10⁶ K/min) and magneto-mechanical effects. Even when porosity is identified as the principal cause of modulus reduction, magnetic effects are also detected.     

A note to the paper “An efficient algorithm for linear programming” of V Ch Venkaiah

In Venkaiah [1] an algorithm for solving linear optimization problems based on the idea of the projective algorithm of Karmarkar, is proposed. The essential simplification in the new algorithm is the use of a fixed projection operator. In this way the algorithm requires onlyO(n ² ) operations to obtain a sufficient exact solution. In this note it is shown that in some special cases the algorithm of Venkaiah yields a feasible solution that is far from the optimal one.     

On alternativep-center problems

LetG=(V, E) be an undirected connected graph with positive edge lengths. The vertexp-center problem is to find the optimal location ofp centers so that the maximum distance to a vertex from its nearest center is minimized, where the centers may be placed at the vertices. Kariv and Hakimi have shown that this problem is NP-hard. We will consider two modifications of this problem in which each center may be located in one of two predetermined vertices. We will show the NP-completeness of their recognition versions.