Solvability of Control Problems for Stationary Equations of Magnetohydrodynamics of a Viscous Fluid

We consider the boundary-value problem for the stationary equations of magnetohydrodynamics of a viscous incompressible fluid with nonhomogeneous boundary conditions for the velocity and electromagnetic field. We study global solvability of this problem and establish some sufficient conditions for uniqueness of its solution. We state control problems for the model of magnetohydrodynamics under consideration, study their solvability, give and examine optimality systems for both arbitrary and particular quality functionals.     

Generalizations of a theorem of Rolewicz

The aim of this article is to give a unified treatment for the theorems of Rolewicz and Neerven type for uniform exponential stability of evolution families. We obtain necessary and sufficient conditions for uniform exponential stability of evolution families, generalizing a stability theorem due to Rolewicz and we present a new proof for the Rolewicz theorem, based on the theory of Banach function spaces. Finally, we apply our results and we deduce a generalization for a classical stability theorem due to Przyluski and Rolewicz.     

Approximation of classes of smooth functions of several variables

The paper deals with imbedding theorems and harmonic approximation for classes of periodic functions of several variables. Necessary and sufficient conditions for imbedding are found for various classes of smooth functions. The paper contains asymptotic estimates for fractional order derivatives of multidimensional Dirichlet and Favard kernels, for Fourier best approximation and for the Kolmogorov diameter of smooth function classes.Translated from Trudy Seminara imeni I. G. Petrovskogo, No. 10, pp. 207–226, 1984.     

Some Remarks on Equivalence of Moduli of Smoothness

The present paper investigates polynomials for which the inverse inequality for moduli of smoothness holds. The technique for approach is different from the previous works for splines and is elegantly organized.     

Superconvergence of mixed finite element semi-discretizations of two time-dependent problems

We will show that some of the superconvergence properties for the mixed finite element method for elliptic problems are preserved in the mixed semi-discretizations for a diffusion equation and for a Maxwell equation in two space dimensions. With the help of mixed elliptic projection we will present estimates global and pointwise in time. The results for the Maxwell equations form an extension of existing results. For both problems, our results imply that post-processing and a posteriori error estimation for the error in the space discretization can be performed in the same way as for the underlying elliptic problem.     

On equivalence of moduli of smoothness of polynomials in ,

It is well known that for functions , 1p∞. For general functions fL_p, it does not hold for 0<p<1, and its inverse is not true for any p in general. It has been shown in the literature, however, that for certain classes of functions the inverse is true, and the terms in the inequalities are all equivalent. Recently, Zhou and Zhou proved the equivalence for polynomials with p=∞. Using a technique by Ditzian, Hristov and Ivanov, we give a simpler proof to their result and extend it to the L_p space for 0<p∞. We then show its analogues for the Ditzian–Totik modulus of smoothness and the weighted Ditzian–Totik modulus of smoothness for polynomials with .     

Acceleration of Convergence of Static and Dynamic Iterations

A new technique for acceleration of convergence of static and dynamic iterations for systems of linear equations and systems of linear differential equations is proposed. This technique is based on splitting the matrix of the system in such a way that the resulting iteration matrix has a minimal spectral radius for linear systems and a minimal spectral radius for some value of a parameter in Laplace transform domain for linear differential systems.This revised version was published online in October 2005 with corrections to the Cover Date.     

Convergence of densities of some functionals of Gaussian processes

The aim of this paper is to establish the uniform convergence of the densities of a sequence of random variables, which are functionals of an underlying Gaussian process, to a normal density. Precise estimates for the uniform distance are derived by using the techniques of Malliavin calculus, combined with Stein?s method for normal approximation. We need to assume some non-degeneracy conditions. First, the study is focused on random variables in a fixed Wiener chaos, and later, the results are extended to the uniform convergence of the derivatives of the densities and to the case of random vectors in some fixed chaos, which are uniformly non-degenerate in the sense of Malliavin calculus. Explicit upper bounds for the uniform norm are obtained for random variables in the second Wiener chaos, and an application to the convergence of densities of the least square estimator for the drift parameter in Ornstein–Uhlenbeck processes is discussed.     

流动稳定性弱非线性理论的重新考虑*

弱非性理论已被广泛用于流动稳定性理论及其它领域.然而其应用对某些问题虽是成功的,但对另一些问题,其结果却常不令人满意,特别是对转捩或自由剪切流中涡的演化这类问题,这时理论研究的目的不是寻找稳态解,而是预测演化过程.在本文中,我们将研究不成功的原因并建议一些改进的办法.     

Asymptotic behaviour of bounded solutions of a class of higher-order neutral dynamic equations

In this paper, necessary and sufficient conditions for the asymptotic behaviour of all bounded solutions of a class of nonlinear higher-order neutral dynamic equations are stated related to various ranges of the coefficient associated with the neutral part, in one of which the coefficient is allowed to oscillate and not tend to zero asymptotically. The new results improve and generalize the known results stated for difference equations and differential equations, and answer some problems left open for the case for arbitrary time scales. Some certain examples, which the results in the literature fail to deliver an answer to, are given to illustrate the applicability and significance of the new results.     

模糊层次分析法在矩阵论教材评价方面的应用

基础学科的教材直接影响学生的基本功,尤其是几乎每个学科都会涉及的数学类教材,如矩阵论.矩阵论是研究生的基础课程,在对学生以后的学术道路有举足轻重的作用.所以选择一本合适的教材,对学生和教师来说都有不小的帮助.然而,对教材的评价而言,不能单单从一个方面入手,因此将模糊综合分析法与层次分析法结合,在矩阵论教材的评价方面建立评价体系,为高校选择合适的教材提供依据.     

Inverses of -distance matrices of a tree

The determinant and the inverse of the distance matrix of a tree have been investigated in the literature, following the classical formulas due to Graham and Pollak for the determinant, and due to Graham and Lovász for the inverse. We consider two q-analogs of the distance matrix of a tree and obtain formulas for the inverses of the two distance matrices. Yan and Yeh have previously obtained expressions for the determinants of the two distance matrices. Some related results are proved.     

Boundary-value problem for density-velocity model of collective motion of organisms

The collective motion of organisms is observed at almost all levels of biological systems. In this paper the density-velocity model of the collective motion of organisms is analyzed. This model consists of a system of nonlinear parabolic equations, a forced Burgers equation for velocity and a mass conservation equation for density. These equations are supplemented with the Neumann boundary conditions for the density and the Dirichlet boundary conditions for the velocity. The existence, uniqueness and regularity of solution for the density-velocity problem is proved in a bounded 1D domain. Moreover, a priori estimates for the solutions are established, and existence of an attractor is proved. Finally, some numerical approximations for asymptotical behavior of the density-velocity model are presented.     

李Rinehart代数的子代数若干性质

本文主要把李代数的c-可补、E-代数的性质以及Frattini理论推广到更为广泛的李Rinehart代数,得到它们的若干性质,给出了可解李Rinehart代数的一个必要条件.同时,分别获得判断c-可补李Rinehart代数和E-李Rinehart代数的一个充分必要条件.     

Undecidability of the elementary theory of groups of measure-preserving transformations

The undecidability of the elementary theory of the automorphism group for a Lebesgue space is proved. It is shown that arithmetic can be interpreted in this theory. The technique of proof can be carried over to certain other groups. Translated fromMatematicheskie Zametki, Vol. 63, No. 3, pp. 414–420, March, 1998. The author wishes to thank the participants of the seminar on dynamical systems headed by D. V. Anosov, R. I. Grigorchuk, and A. M. Stepin as well as the participants of the Kolmogorov seminar of the Mechanics and Mathematics Department of Moscow State University for discussion of this work. The author is also indebted to N. K. Vereshchagin and A. M. Stepin for support and valuable remarks as well as to V. V. Ryzhikov for setting the problem and for his assistance.     

Categories of models of R-mingle

We give a new Esakia-style duality for the category of Sugihara monoids based on the Davey-Werner natural duality for lattices with involution, and use this duality to greatly simplify a construction due to Galatos-Raftery of Sugihara monoids from certain enrichments of their negative cones. Our method of obtaining this simplification is to transport the functors of the Galatos-Raftery construction across our duality, obtaining a vastly more transparent presentation on duals. Because our duality extends Dunn's relational semantics for the logic R-mingle to a categorical equivalence, this also explains the Dunn semantics and its relationship with the more usual Routley-Meyer semantics for relevant logics.     

A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups

We propose a characterization of the adjacency of vertices in the class of permutation polytopes generated by arbitrary subsets of symmetric groups. In particular, this class contains polytopes for the well-known classical problems, such as the assignment problem, 2-and 3-combinations, the traveling salesman problem and their various modifications. Up to now, the problem of vertex adjacency has been studied for a single polytope only. In the present paper, we obtain, for general permutation polytopes, necessary and sufficient conditions that guarantee that two given vertices are adjacent (or not) to each other. The conditions are formulated in terms of permutations and of the solvability of certain special systems of linear equations. The presently known adjacency criteria for vertices of polytopes for the assignment problem are simple corollaries of our conditions. The latter allow us to develop a general algorithmic scheme for recognizing vertex adjacency of a general permutation polytope and estimate its complexity.     

On the number of primitive representations of integers as sums of squares

Formulas for the number of primitive representations of any integer n as a sum of k squares are given, for 2 ≤ k ≤ 8, and for certain values of n, for 9 ≤ k ≤ 12. The formulas have a similar structure and are striking for their simplicity. Dedicated to Richard Askey on the occasion of his 70th birthday. 2000 Mathematics Subject Classification Primary—11E25; Secondary—05A15, 33E05.     

Cubature Formulas of a Nonalgebraic Degree of Precision

We deal with cubature formulas that are exact for polynomials and also for polynomials multiplied by r, where r is the Euclidean distance to the origin. A general lower bound for the number of nodes for a specified degree of precision is given. This bound is improved for centrally symmetric integrals. A set of constraints (consistency conditions) is introduced for the construction of fully symmetric formulas. For one dimension and arbitrary degree, it is shown that the lower bound is sharp for centrally symmetric integrals. For higher dimensions, as an illustration, cubature formulas are only constructed for low degrees. March 6, 2000. Date revised: April 30, 2001. Date accepted: May 31, 2001.     

On the eigenvalues of a class of saddle point matrices

We study spectral properties of a class of block 2 × 2 matrices that arise in the solution of saddle point problems. These matrices are obtained by a sign change in the second block equation of the symmetric saddle point linear system. We give conditions for having a (positive) real spectrum and for ensuring diagonalizability of the matrix. In particular, we show that these properties hold for the discrete Stokes operator, and we discuss the implications of our characterization for augmented Lagrangian formulations, for Krylov subspace solvers and for certain types of preconditioners. The work of this author was supported in part by the National Science Foundation grant DMS-0207599 Revision dated 5 December 2005.