Group theory and p‐adic valued models of swarm behaviour

The swarm behaviour can be controlled by different localizations of attractants (food pieces) and repellents (dangerous places), which, respectively, attract and repel the swarm propagation. If we assume that at each time step, the swarm can find out not more than p ?1 attractants ( ), then the swarm behaviour can be coded by p ‐adic integers, ie, by the numbers of the ring Z _p . Each swarm propagation has the following 2 stages: (1) the discover of localizations of neighbour attractants and repellents and (2) the logistical optimization of the road system connecting all the reachable attractants and avoiding all the neighbour repellents. In the meanwhile, at the discovering stage, the swarm builds some direct roads and, at the logistical stage, the transporting network of the swarm gets loops (circles) and it permanently changes. So, at the first stage, the behaviour can be expressed by some linear p ‐adic valued strings. At the second stage, it is expressed by non‐linear modifications of p ‐adic valued strings. The second stage cannot be described by conventional algebraic tools; therefore, I have introduced the so‐called non‐linear group theory for describing both stages in the swarm propagation.     

Free and nonsteady-state oscillations of elastic fluid-filled systems situated on an elastic base

We develop a method of computing the nonsteady-state and free oscillations of a framed elastic structure situated on an elastic base and containing an ideal compressible fluid. The solution uses the method of integral transforms in conjunction with the method of orthogonal polynomials. In the transform space the problem reduces to systems of linear algebraic equations. The Fourier transform is applied to return to the original space. Examples of the computation are given.Translated fromDinamicheskie Sistemy, No. 6, 1987, pp. 69–72.     

Length computation of matrix subalgebras of special type

Let {ie910-01} be a field and let {ie910-02} be a finite-dimensional {ie910-03}-algebra. We define the length of a finite generating set of this algebra as the smallest number k such that words of length not greater than k generate {ie910-04} as a vector space, and the length of the algebra is the maximum of the lengths of its generating sets. In this article, we give a series of examples of length computation for matrix subalgebras. In particular, we evaluate the lengths of certain upper triangular matrix subalgebras and their direct sums, and the lengths of classical commutative matrix subalgebras. The connection between the length of an algebra and the lengths of its subalgebras is also studied. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 4, pp. 165–197, 2007.     

Blowup criterion for viscous, compressible micropolar fluids with vacuum

We prove that the maximum norm of velocity gradients controls the possible breakdown of smooth (strong) solutions for the 3-dimensional viscous, compressible micropolar fluids. More precisely, if a solution of the system is initially regular and loses its regularity at some later time, then the loss of regularity implies the growth without the bound of the velocity gradients as the critical time approaches. Our result is a generalization of Huang et al. (2011) [13] from viscous barotropic flows to the viscous, compressible micropolar fluids. In addition, initial vacuum states are also allowed in our result.     

Computation of Material Forces in Thermoplasticity Based on Alternative Smoothing Algorithms

Different approaches to the computation of material forces in inelastic structures are investigated. Dissipative effects in inelastic materials are described by internal variables. The formulation of balance equations in the material space requires the computation of gradients of these internal variables. The computational evaluation of these gradients in the context of finite element simulations needs a global representation of the internal variable fields. On the one side, this request can be carried out by a global formulation that discretizes the internal variable fields in terms of nodal degrees additional to the displacements. A numerically more effective approach applies smoothing algorithms which project the internal variables of a typical local formulation from the integration points onto the nodal points. In detail, the implementation of two smoothing algorithms for the computation of material forces is dicussed. The L2–projection necessiates the solution of a system of equations on the global level. A patch recovery yields a smoothed solution from an element patch surrounding the nodal point of interest. The performance of both algorithms is compared for the material force computation in finite thermoplasticity. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Global solutions of the compressible navier-stokes equations with larger discontinuous initial data

We prove the global existence of weak solutions to the Navier-Stokes equations for compressible, heat-conducting flow in one space dimension with large, discontinuous initial data, and we obtain apriori estimates for these solutions which are independent of time, sufficient to determine their asymptotic behavior. In particular, we show that, as time goes to infinity, the solution tends to a constant state determined by the initial mass and the initial energy. and that the magnitudes of singularities in the solution decay to zero.     

Global strong solutions for a class of compressible non‐Newtonian fluids with vacuum

We study a class of compressible non‐Newtonian fluids in one space dimension. We prove, by using iterative method, the global time existence and uniqueness of strong solutions provided that the initial data satisfy a compatibility condition and the initial density is small in its H¹‐norm. The main difficulty is due to the strong nonlinearity of the system and the initial vacuum. Copyright © 2010 John Wiley & Sons, Ltd.     

Slightly compressible and immiscible two-phase flow in porous media

We describe the flow of two compressible phases in a porous medium. We consider the case of slightly compressible phases for which the density of each phase follows an exponential law with a small compressibility factor. A nonlinear parabolic system including quadratic velocity terms is derived to describe compressible and immiscible two-phase flow in porous media. In one-dimensional space, we establish the existence and uniqueness of a local strong solution for the regularized system. We show also that the saturation is physically admissible. We describe the asymptotic behavior of the solutions when the compressibility factor goes to zero.     

Parallel Implementation of Stability Analysis of Difference Schemes with MATHEMATICA

We consider a parallel algorithm for investigating the stability of the schemes of the finite-difference and finite-volume methods that approximate the two-dimensional Euler equations of compressible fluid on a curvilinear grid. The algorithm is implemented with the aid of the computer algebra system Mathematica 3.0. We apply a two-level parallelization process. At the first level, the symbolic computation of the amplification matrix is parallelized by a parallel computation of the matrix rows on different processors. At the second level, the values of the coordinates of points of the stability-region boundary are computed numerically. For the communication between the workstations, we apply a special program, LaunchSlave, which uses the MathLink communication protocol. Examples of application of the proposed parallel symbolic/numerical algorithm are presented. Bibliography: 15 titles.     

James' Theorem Fails for Starlike Bodies

Starlike bodies are interesting in nonlinear functional analysis because they are strongly related to bump functions and to n-homogeneous polynomials on Banach spaces, and their geometrical properties are thus worth studying. In this paper we deal with the question whether James' theorem on the characterization of reflexivity holds for (smooth) starlike bodies, and we establish that a feeble form of this result is trivially true for starlike bodies in nonreflexive Banach spaces, but a reasonable strong version of James' theorem for starlike bodies is never true, even in the smooth case. We also study the related question as to how large the set of gradients of a bump function can be, and among other results we obtain the following new characterization of smoothness in Banach spaces: a Banach space X has a C¹ Lipschitz bump function if and only if there exists another C¹ smooth Lipschitz bump function whose set of gradients contains the unit ball of the dual space X*. This result might also be relevant to the problem of finding an Asplund space with no smooth bump functions.     

Kinetic energy preserving DG schemes based on summation-by-parts operators on interior node distributions

In this work, a kinetic energy preserving DG scheme in one space dimension using Gauss-Legendre nodes is presented. Stability problems will be demonstrated when using interface terms that are derived from the Lobatto nodes within the Gauss-Legendre skew-symmetric DG formulation. However, combined with correct interface terms, the skew-symmetric DG scheme constructed on Gauss-Legendre nodes is expected to yield higher accuracy compared to its Gauss-Lobatto counterpart. This advantage is demonstrated in the case of viscous compressible flow computation. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An architecture independent study of parallel segment trees

We study the computation, communication and synchronization requirements related to the construction and search of parallel segment trees in an architecture independent way. Our proposed parallel algorithms are optimal in space and time compared to the corresponding sequential algorithms utilized to solve the introduced problems and are described in the context of the bulk-synchronous parallel (BSP) model of computation. Our methods are more scalable and can thus be made to work for larger values of processor size p relative to problem size n than other segment tree related algorithms that have been described on other realistic distributed-memory parallel models and also provide a natural way to approach searching problems on latency-tolerant models of computation that maintains a balanced query load among the processors.     

Blow-up of smooth solutions to the compressible fluid models of Korteweg type

We show the blow-up of smooth solutions to a non-isothermal model of capillary compressible fluids in arbitrary space dimensions with initial density of compact support. This is an extension of Xin’s result [Xin, Z.: Blow-up of smooth solutions to the compressible Navier-Stokes equations with compact density. Comm. Pure Appl. Math., 51, 229–240 (1998)] to the capillary case but we do not need the condition that the entropy is bounded below. Moreover, from the proof of Theorem 1.2, we also obtain the exact relationship between the size of support of the initial density and the life span of the solutions. We also present a sufficient condition on the blow-up of smooth solutions to the compressible fluid models of Korteweg type when the initial density is positive but has a decay at infinity.     

Blow‐up of the smooth solutions to the compressible Navier–Stokes equations

In this paper, we will firstly extend the results about Jiu, Wang, and Xin (JDE, 2015, 259, 2981–3003). We prove that any smooth solution of compressible fluid will blow up without any restriction about the specific heat ratio γ. Then we prove the blow‐up of smooth solution of compressible Navier–Stokes equations in half space with Navier‐slip boundary. The main ideal is constructing the differential inequality. Copyright © 2017 John Wiley & Sons, Ltd.     

Bending normal waves in a crystal layer surrounded by a liquid

We obtain the dispersion relations that describe the spectrum of the “effluent” harmonic antisymmetric normal waves for an arbitrary direction in the plane of an orthotropic layer surrounded by a viscous or ideally compressible fluid. We present the results of computation of the lower branches of the dispersion spectrum for elastically equivalent directions of propagation in a layer of monocrystal Seignette salt in water. Four figures. Bibliography: 5 titles. Translated fromTeoreticheskaya i Prikladnaya Mekhanika, No. 28, 1998, pp. 123–131.     

Factorization of moving-average spectral densities by state-space representations and stacking

To factorize a spectral density matrix of a vector moving average process, we propose a state space representation. Although this state space is not necessarily of minimal dimension, its associated system matrices are simple and most matrix multiplications involved are nothing but index shifting. This greatly reduces the complexity of computation. Moreover, in this article we stack every q consecutive observations of the original process MA(q) and generate a vector MA(1) process. We consider a similar state space representation for the stacked process. Consequently, the solution hinges on a surprisingly compact discrete algebraic Riccati equation (DARE), which involves only one Toeplitz and one Hankel block matrix composed of autocovariance functions. One solution to this equation is given by the so-called iterative projection algorithm. Each iteration of the stacked version is equivalent to q iterations of the unstacked one. We show that the convergence behavior of the iterative projection algorithm is characterized by the decreasing rate of the partial correlation coefficients for the stacked process. In fact, the calculation of the partial correlation coefficients via the Whittle algorithm, which takes a very simple form in this case, offers another solution to the problem. To achieve computational efficiency, we apply the general Newton procedure given by Lancaster and Rodman to the DARE and obtain an algorithm of quadratic convergence rate. One immediate application of the new algorithms is polynomial stabilization. We also discuss various issues such as check of positivity and numerical implementation.     

On the sharp singular limit for slightly compressible fluids

We consider the equations of motion to slightly compressible fluids and we prove that solutions converge, in the strong norm, to the solution of the equations of motion of incompressible fluids, as the Mach number goes to zero. From a physical point of view this means the following. Assume that we are dealing with a well-specified fluid, so slightly compressible that we assume it to be incompressible. Our result means that the distance between the (continuous) trajectories of the real and of the idealized solution is ‘small’ with respect to the natural metric, i.e. the metric that endows the data space.     

Well‐posedness for compressible Euler equations with physical vacuum singularity

An important problem in the theory of compressible gas flows is to understand the singular behavior of vacuum states. The main difficulty lies in the fact that the system becomes degenerate at the vacuum boundary, where the characteristic speeds u ± c coincide and have unbounded spatial derivative since c behaves like x^1/2 close to the boundary. In this paper, we overcome this difficulty by presenting a new formulation and new energy spaces. We establish the local‐in‐time well‐posedness of one‐dimensional compressible Euler equations for isentropic flows with the physical vacuum singularity in some spaces adapted to the singularity. © 2009 Wiley Periodicals, Inc.     

On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix

We reexamine the Wiedemann—Coppersmith—Kaltofen—Villard algorithm for randomized computation of the determinant of an integer matrix and substantially simplify and accelerate its bottleneck stage of computing the minimum generating matrix polynomial, to make the algorithm practically promising while keeping it asymptotically fast. Bibliography: 58 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 316, 2004, pp. 163–187.