Linear operators with compact supports, probability measures and Milyutin maps

The notion of a regular operator with compact supports between function spaces is introduced. On that base we obtain a characterization of absolute extensors for 0-dimensional spaces in terms of regular extension operators having compact supports. Milyutin maps are also considered and it is established that some topological properties, like paracompactness, metrizability and κ-metrizability, are preserved under Milyutin maps.     

Generalized Navier-Stokes equations with initial data in local Q-type spaces

In this paper, we establish a link between Leray mollified solutions of the three-dimensional generalized Navier-Stokes equations and mild solutions for initial data in the adherence of the test functions for the norm of . This result applies to the usual incompressible Navier-Stokes equations.     

Infinite-dimensional modular special odd contact superalgebras

The infinite-dimensional special odd contact Lie superalgebras SKO(n,n+1;c) over a field of positive characteristic are studied. In particular, we prove that Lie superalgebras SKO(n,n+1;c) are simple. Besides, the Weisfeiler filtration of SKO(n,n+1;c) is proved to be invariant under automorphisms by characterizing -nilpotent elements. Thereby, we obtain some properties of these Lie superalgebras.     

Some constructions of linearly optimal group codes

We continue here the research on (quasi)group codes over (quasi)group rings. We give some constructions of [n,n-3,3]_q-codes over F_q for n=2q and n=3q. These codes are linearly optimal, i.e. have maximal dimension among linear codes having a given length and distance. Although codes with such parameters are known, our main results state that we can construct such codes as (left) group codes. In the paper we use a construction of Reed-Solomon codes as ideals of the group ring F_qG where G is an elementary abelian group of order q.     

Exponential dichotomy on the real line: SVD and QR methods

In this work we show when and how techniques based on the singular value decomposition (SVD) and the QR decomposition of a fundamental matrix solution can be used to infer if a system enjoys—or not—exponential dichotomy on the whole real line.     

A conservative pressure-correction scheme for transient simulations of reacting flows

An algorithm is presented for numerical simulations of time-dependent low Mach number variable density flows with an arbitrary amount of scalar transport equations and a complex equation of state. The pressure-correction type algorithm is based on a segregated solution formalism. It is conservative and guarantees stable results, regardless of the difference in density between neighboring cells. Furthermore, states are predicted which exactly match the equation of state. In the one-dimensional example, considering non-premixed flames, a simplified flamesheet model is used to describe the combustion of fuel and oxidizer. We demonstrate that the predicted states exactly correspond to the equation of state. We illustrate the accuracy improvement due to higher order formulation and demonstrate grid convergence.     

Meshless local Petrov-Galerkin (MLPG) approximation to the two dimensional sine-Gordon equation

During the past few years, the idea of using meshless methods for numerical solution of partial differential equations (PDEs) has received much attention throughout the scientific community, and remarkable progress has been achieved on meshless methods. The meshless local Petrov-Galerkin (MLPG) method is one of the “truly meshless” methods since it does not require any background integration cells. The integrations are carried out locally over small sub-domains of regular shapes, such as circles or squares in two dimensions and spheres or cubes in three dimensions. In this paper the MLPG method for numerically solving the non-linear two-dimensional sine-Gordon (SG) equation is developed. A time-stepping method is employed to deal with the time derivative and a simple predictor-corrector scheme is performed to eliminate the non-linearity. A brief discussion is outlined for numerical integrations in the proposed algorithm. Some examples involving line and ring solitons are demonstrated and the conservation of energy in undamped SG equation is investigated. The final numerical results confirm the ability of proposed method to deal with the unsteady non-linear problems in large domains.     

Constructing three-dimensional mappings onto the unit sphere with the hypercomplex Szegö kernel

In classical complex analysis the Szegö kernel method provides an explicit way to construct conformal maps from a given simply-connected domain G⊂C onto the unit disc. In this paper we revisit this method in the three-dimensional case. We investigate whether it is possible to construct three-dimensional mappings from some elementary domains into the three-dimensional unit ball by using the hypercomplex Szegö kernel. In the cases of rectangular domains, L-shaped domains, cylinders and the symmetric double-cone the proposed method leads surprisingly to qualitatively very good results. In the case of the cylinder we get even better results than those obtained by the hypercomplex Bergman method that was very recently proposed by several authors.We round off with also giving an explicit example of a domain, namely the T-piece, where the method does not lead to the desired result. This shows that one has to adapt the methods in accordance with different classes of domains.     

A locking-free nonconforming triangular element for planar elasticity with pure traction boundary condition

A new nonconforming triangular element for the equations of planar linear elasticity with pure traction boundary conditions is considered. By virtue of construction of the element, the discrete version of Korn’s second inequality is directly proved to be valid. Convergence rate of the finite element methods is uniformly optimal with respect to λ. Error estimates in the energy norm and L²-norm are O(h²) and O(h³), respectively.     

A variable step implicit block multistep method for solving first-order ODEs

A new four-point implicit block multistep method is developed for solving systems of first-order ordinary differential equations with variable step size. The method computes the numerical solution at four equally spaced points simultaneously. The stability of the proposed method is investigated. The Gauss-Seidel approach is used for the implementation of the proposed method in the PE(CE)^m mode. The method is presented in a simple form of Adams type and all coefficients are stored in the code in order to avoid the calculation of divided difference and integration coefficients. Numerical examples are given to illustrate the efficiency of the proposed method.