### Article

## К ВОПРОСУ О ВЫБОРЕ РАСЧЕТНЫХ СХЕМ ПРИ МОДЕЛИРОВАНИИ И АНАЛИЗЕ ЛОКАЛЬНЫХ ОСОБЕННОСТЕЙ ПОВЕДЕНИЯ СЛОЖНЫХ БИОМЕХАНИЧЕСКИХ СИСТЕМ

We consider the Cauchy problem for the 1D generalized Schrὅdinger equation on the whole axis. To solve it, any order finite element in space and the Crank-Nicolson in time method with the discrete transpa\-rent boundary conditions (TBCs) has recently been constructed. Now we engage the global Richardson extrapolation in time to derive the high order method both with respect to space and time steps. To study its properties, we comment on its stability and give results of numerical experiments and enlarged practical error analysis for three typical examples. Unlike most common 2nd order (in either space or time step) methods, the proposed method is able to provide high precision results in the uniform norm by using adequate computational costs. It works even in the case of discontinuous potentials and non-smooth solutions far beyond the scope of its standard theory. Comparing our results to the previous ones, we obtain \textit{much more} accurate results using much less amount of both elements and time steps.

We consider the time-dependent 1D Schrödinger equation on the half-axis with variable coefficients becoming constant for large x. We study a two-level symmetric in time (i.e. the Crank-Nicolson) and any order finite element in space numerical method to solve it. The method is coupled to an approximate transparent boundary condition (TBC). We prove uniform in time stability with respect to initial data and a free term in two norms, under suitable conditions on an operator in the approximate TBC. We also consider the corresponding method on an infinite mesh on the half-axis. We derive explicitly the discrete TBC allowing us to restrict the latter method to a finite mesh. The operator in the discrete TBC is a discrete convolution in time; in turn its kernel is a multiple discrete convolution. The stability conditions are justified for it. The accomplished computations confirm that high order finite elements coupled to the discrete TBC are effective even in the case of highly oscillating solutions and discontinuous potentials.

The study is carried out by the first author within The National Research University Higher School of Economics' Academic Fund Program in 2012-2013, research grant No. 11-01-0051.

We deal with an initial-boundary value problem for the generalized time-dependent Schrödinger equation with variable coefficients in an unbounded $n$-dimensional parallelepiped ($n\geq 1$). To solve it, the Crank-Nicolson in time and the polylinear finite element in space method with the discrete transparent boundary conditions is considered. We present its stability properties and derive new error estimates $O(\tau^2+|h|^2)$ uniformly in time in $L^2$ space norm, for $n\geq 1$, and mesh $H^1$ space norm, for $1\leq n\leq 3$ (a superconvergence result), under the Sobolev-type assumptions on the initial function. Such estimates are proved for methods with the discrete TBCs for the first time.

We consider the time-dependent 1D Schrödinger equation on the half-axis with variable coefficients becoming constant for large x. We study a two-level symmetric in time (i.e. the Crank-Nicolson) and any order finite element in space numerical method to solve it. The method is coupled to an approximate transparent boundary condition (TBC). We prove uniform in time stability with respect to initial data and a free term in two norms, under suitable conditions on an operator in the approximate TBC. We also consider the corresponding method on an infinite mesh on the half-axis. We derive explicitly the discrete TBC allowing us to restrict the latter method to a finite mesh. The operator in the discrete TBC is a discrete convolution in time; in turn its kernel is a multiple discrete convolution. The stability conditions are justified for it. The accomplished computations confirm that high order finite elements coupled to the discrete TBC are effective even in the case of highly oscillating solutions and discontinuous potentials. The study is carried out by the first author within The National Research University Higher School of Economics' Academic Fund Program in 2012-2013, research grant No. 11-01-0051.

The volume contains articles of scientific staff and faculty of the Department of Computer Science and Applied Mathematics and Scientific-Educational Center of computer modeling of unique buildings and complexes of Moscow State University of Civil Engineering (National Research University), devoted to actual problems of applied mathematics and computational mechanics.

Finite element numerical schemes for solving the continuum mechanics problems are discussed. One of the authors developed a method of acceleration of calculations which uses the simplicial mesh inscribed in the original cubic cell partitioning of a three-dimensional body. In this work it is shown that the obstacle to the construction of this design may be described in terms of modulo 2 homology groups. The method of removing the obstacle is proposed.

A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.

This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.

Many electronic devices operate in a cyclic mode. This should be considered when forecastingreliability indicators at the design stage.The accuracy of the prediction and the planning for the event to ensure reliability depends on correctness of valuation and accounting greatest possiblenumber of factors. That in turn will affect the overall progress of the design and, in the end,result in the quality and competitiveness of products

Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov [7], we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.

I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables