Normalization and averaging on compact lie groups in nonlinear mechanics

We consider the method of normal forms, the Bogolyubov averaging method, and the method of asymptotic decomposition proposed by Yu. A. Mitropol’skii and the author of this paper. Under certain assumptions about group-theoretic properties of a system of zero approximation, the results obtained by the method of asymptotic decomposition coincide with the results obtained by the method of normal forms or the Bogolyubov averaging method. We develop a new algorithm of asymptotic decomposition by a part of the variables and its partial case — the algorithm of averaging on a compact Lie group. For the first time, it became possible to consider asymptotic expansions of solutions of differential equations on noncommutative compact groups.     

Krylov-Bogolyubov averaging of asymptotically autonomous differential equations

We apply the Krylov and Bogolyubov asymptotic integration procedure to asymptotically autonomous systems. First, we consider linear systems with quasi-periodic coefficient matrix multiplied by a scalar factor vanishing at infinity. Next, we study the asymptotically autonomous Van-der-Pol oscillator.

     

Structure of a poly(2,5‐benzimidazole)/phosphoric acid complex

As‐cast films of poly(2,5‐benzimidazole) exhibit uniplanar orientation in which the planes of the aromatic rings lie parallel to the film surface. Upon doping with phosphoric acid, the original crystalline order is lost, but the doped film can be stretched to produce films with uniaxial orientation. After thermal annealing at 540 °C, nine Bragg reflections are resolved in the fiber diagram, and these are indexed by an orthorhombic unit cell with the dimensions a = 18.1 Å, b = 3.5 Å, and c = 11.4 Å, containing four monomer units of two chains. The absence of odd‐order 00l reflections points to a 2₁ chain conformation, which is probably planar so that the aromatic units can be stacked along the b axis. The water and phosphoric acid contents of the crystalline structure cannot be determined exactly because of the presence of extensive amorphous regions that probably have different solvation. The best agreement between the observed and calculated intensities is for an idealized structure containing two phosphoric acids and two water molecules per unit cell. However, the phosphoric acid is probably present mainly in the form of pyrophosphoric acid and its higher oligomers. In addition, the X‐ray data are consistent with a more disordered structure containing chains with random (up and down) polarity and a lack of c‐axis registry. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2576–2585, 2004     

A Study of Evaporation of Complex Oxide Systems Based on Chromium(III) Oxide

Evaporation of chromium ore and concentrates was studied using high-temperature differential mass-spectrometry. The data obtained, concerning the component vapor pressures in evaporation of complex oxide systems in the range 1700-2100 K, can be used to calculate the evaporation loss in melting and to assess the possibility of utilization of the sublimates formed.     

H MAS NMR monitoring of the C-labeled carbon scrambling for propane in zeolite H-ZSM-5

It has been demonstrated that ¹H MAS NMR spectroscopy can be used as a tool for in situ monitoring the reaction kinetics of ¹³C-labeled carbon scrambling in alkane molecules adsorbed on zeolite catalysts at the reaction temperature of 540–570 K. The accuracy of the results and the time resolution are improved compared to ¹³C MAS NMR spectroscopy.     

Computing homotopic shortest paths in the plane

We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log²n) time per output vertex which is an improvement by a factor of O(n/log²n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n²⁺) for any positive constant . In the case k<n²⁺, where k is the total size of the input and output, we improve the running to O((n+k+(nk)^2/3)log^O(1)n).     

The Ring of Invariants of Three (3 × 3)-Matrices over a Field of Prime Characteristic

We find a minimal system of generators and a homogeneous system of parameters for the algebra of invariants of three matrices of third order over a field of an arbitrary characteristic.