作者：
Chen, YanpingXiangtan Univ
Dept Math Hunan Key Lab Computat & Simulat Sci & Engn Xiangtan 411105 Hunan Peoples R China
In this paper, we investigate the superconvergence property of the numerical solution of a quadratic convex optimal control problem by using rectangular mixed finite element methods. The state and co-state variables a...
详细信息
In this paper, we investigate the superconvergence property of the numerical solution of a quadratic convex optimal control problem by using rectangular mixed finite element methods. The state and co-state variables are approximated by the lowest order Raviart-Thomas mixed finite element spaces and the control variable is approximated by piecewise constant functions. Some realistic regularity assumptions are presented and applied to error estimation by using an operator interpolation technique. We derive L-2 superconvergence properties for the flux functions along the Gauss lines and for the scalar functions at the Gauss points via mixed projections. Moreover, global L-2 superconvergence results are obtained by virtue of an interpolation post-processing technique. Thus, based on these superconvergence estimates, some asymptotic exactness a posteriori error estimators are presented for the mixed finite element methods. Finally, some numerical examples are given to demonstrate the practical side of the theoretical results about superconvergence.
An expression is given for the plethysm p(2) omicron S rectangle], where p(2) is the power sum of degree two and S rectangle is the Schur function indexed by a rectangular partition. The formula can be well understood...
详细信息
An expression is given for the plethysm p(2) omicron S rectangle], where p(2) is the power sum of degree two and S rectangle is the Schur function indexed by a rectangular partition. The formula can be well understood from (2) the viewpoint of the basic representation of the affine Lie algebra of type A(2)((2)) (c) 2005 Elsevier B.V. All rights reserved.
We consider the problem of distributed computation of the nearest lattice point for a two-dimensional lattice. An interactive model of communication is considered. We address the problem of reconfiguring a specific re...
详细信息
ISBN:
(纸本)9781509040964
We consider the problem of distributed computation of the nearest lattice point for a two-dimensional lattice. An interactive model of communication is considered. We address the problem of reconfiguring a specific rectangular partition, a nearest plane, or Babai, partition, into the Voronoi partition. Expressions are derived for the error probability as a function of the total number of communicated bits. With an infinite number of allowed communication rounds, the average cost of achieving zero error probability is shown to be finite. For the interactive model, with a single round of communication, expressions are obtained for the error probability as a function of the bits exchanged. We observe that the error exponent depends on the lattice.
An expression is given for the plethysm p(2) omicron S rectangle], where p(2) is the power sum of degree two and S rectangle is the Schur function indexed by a rectangular partition. The formula can be well understood...
详细信息
An expression is given for the plethysm p(2) omicron S rectangle], where p(2) is the power sum of degree two and S rectangle is the Schur function indexed by a rectangular partition. The formula can be well understood from (2) the viewpoint of the basic representation of the affine Lie algebra of type A(2)((2)) (c) 2005 Elsevier B.V. All rights reserved.
We study integer programming models for the problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number. Polyhedral investigations and computational tests are reported for the firs...
详细信息
We present an algorithm framework for formation control of multi robots with obstacle avoidance in the space station ***,the 2-dimensional complex environment is discretized using hierarchical rectangular partitions i...
详细信息
ISBN:
(数字)9789887581536
ISBN:
(纸本)9781665482561
We present an algorithm framework for formation control of multi robots with obstacle avoidance in the space station ***,the 2-dimensional complex environment is discretized using hierarchical rectangular partitions in the form o f quad-trees;second,the formation in the space station is regarded as a virtual structure,and an optimal path is generated among the obstacle-free rectangles for the virtual structure by the A*algorithm;lastly,vector fields are derived not only for the virtual structure to track the optimal path,but also for each robot to maintain its required pose in the *** the space station environment,the formation requirements and control constraints of the robot,the feedback control law of each robot can be generated *** in MATLAB are developed to show the effectiveness and applicability of our method.
暂无评论