Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

Hankel convolution operators on entire functions and distributions

In this paper we study the Hankel convolution operators on the space of even and entire functions and on Schwartz distribution spaces. We characterize the Hankel convolution operators as those ones that commute with Hankel translations and with a Bessel operator. Also we prove that the Hankel convolution operators are hypercyclic and chaotic on the spaces under consideration.     

Finding the response matrix to the external action from a subspace for a discrete linear stochastic dynamical system

For a discrete linear stochastic dynamical system, computation of the response matrix to the external action from a subspace using given observational data is examined. An algorithm is proposed and substantiated that makes it possible to improve the numerical accuracy and to reduce the amount of observational data compared to the general case where an arbitrary external action is allowed. As an illustration, a discrete system arising in the analysis of a linear stochastic dynamical continuous-time system is considered more thoroughly. Some numerical results are presented.     

Regularization of Discrete Ill-Posed Problems

The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is proved under the assumption of the suitable relation between the discretization level and the data error. As an example the method of truncated singular value decomposition with regularization is considered. This revised version was published online in July 2006 with corrections to the Cover Date.     

Probability Interpretation of the Integral of Fractional Order

We establish a relation between stable distributions in probability theory and the fractional integral. Moreover, it turns out that the parameter of the stable distribution coincides with the exponent of the fractional integral. It follows from an analysis of the obtained results that equations with the fractional time derivative describe the evolution of some physical system whose time degree of freedom becomes stochastic, i.e., presents a sum of random time intervals subject to a stable probability distribution. We discuss relations between the fractal Cantor set (Cantor strips) and the fractional integral. We show that the possibility to use this relation as an approximation of the fractional integral is rather limited.     

Two‐stage copolycondensation of preformed oligomers with bisphenols by tosyl chloride/dimethylformamide/pyridine from distributions of resulting oligomers determined by a combination of gel permeation chromatography and NMR

A two‐stage co‐oligomerization of the oligomers initially formed from an equimolar mixture of isophthalic acid (IPA) and terephthalic acid (TPA) and 2,2‐bis(4‐hydroxyphenyl)propane (BPA, 50 mol %) with bisphenols (BPs, 20 mol %) was carried out using a tosyl chloride/dimethylformamide/pyridine condensing agent. The distributions of the resulting oligomers (n_x‐mers), which were quenched with methanol, were determined by a combination of gel permeation chromatography (GPC) and NMR. These distributions (presented by molar percentage) were conveniently calculated with the equation n_x (mol %) = n_x (% mol by GPC) × n₀ (mol % by NMR)/n₀ (% mol by GPC), where n_x (% mol) = n_x (wt % by GPC)/its molecular weight. The results showed the distributions of the preformed IPA/TPA‐BPA oligomers to be in fairly good accord with those obtained directly from GPC and to be supported by the NMR results. The calculation was applied to the co‐oligomers prepared up to a reaction of 0.7, at which there was an increase in the number of higher oligomers indivisible by GPC and the distributions could no longer be determined by molar percentage. The calculated distributions are discussed in relation to the results of copolycondensation. The sequence distributions in the resulting co‐oligomers, which were also examined by NMR, are compared with those in the copolymers. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 44–51, 2004     

A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.     

Shell effects in the symmetric-modal fission of pre-actinide nuclei

Mass distributions of fragments in the low-energy fission of nuclei from ¹⁸⁷Ir to ²¹³At have been analysed. This analysis has shown that shell effects in symmetric-mode fragment mass yields from the fission of pre-actinide nuclei could be described if one assumes the existence of two strongly deformed neutron shells in the arising fragments with neutron numbers N₁ ≈ 52 and N₂ ≈ 68. A new method has been proposed for quantitatively describing the mass distributions of the symmetric fission mode for pre-actinides with A ≈ 180–220.     

Large deviations and the generalized processor sharing scheduling for a two-queue system

We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed communication networks. This revised version was published online in June 2006 with corrections to the Cover Date.