带极大单调图的半线性抛物型方程的零能控性(英文)

本文讨论非线性项带一个极大单调图的半线性抛物型方程系统的零能控性.文中利用Kakutani不动点定理和线性抛物型方程的能控性得到该系统是零能控的,如果控制作用在内部区域上.由此,还得到该系统是零能控的,如果控制施加在一部分边界上.     

非线性开关控制系统的能控性

本文研究了一类具有不同控制器的非线性开关控制系统的能控性问题.利用了几何控制的方法和Kalman秩条件,获得了这类控制系统的能控性结果,推广了E.Zuazua在参考文献[7]中的结论.     

滞后控制系统的完全能控性、毕竟能控性、最终能控性和拟能控性

讨论时滞控制系统的能控性 .指出与无时滞系统不同的是 ,该类系统的能控性与终点时刻有一定的关系 .由此给出一系列与终点时刻有关的能控性 ,即完全能控性、毕竟能控性、最终能控性等 ,并得到一些判定定理 .     

Banach空间中无限维线性系统的能控性

研究在非自反状态空间和自反控制空间中无限维线性系统x(t)=Ax(t) Bu(t)的精确能控性和精确零能控性.当A生成C-半群时,得到这个系统关于Lp([O,T],U),1＜p≤∞精确能控和精确零能控的等价判据.当A生成CO-半群时,也得到系统关于Lp([O,T],U),1＜p≤∞的精确零能控的充要条件.这些结论是对经典控制理论的有益发展和补充,还给出所得抽象结论的两个应用.     

Banach空间中无限维线性系统的能控性

研究在非自反状态空间和自反控制空间中无限维线性系统x(t)=Ax(t) Bu(t)的精确能控性和精确零能控性.当A生成C-半群时,得到这个系统关于L~p([O,T],U),1相似文献   

含有一个控制的拟线性抛物系统的能控性

该文讨论了一类拟线性抛物系统的全局零能控性和逼近能控性. 文中首先给出并证明了相应的线性系统的Carleman不等式,再由Carleman不等式去证明观测不等式, 最后利用Kakutani不动点定理证明非线性系统的全局零能控性和逼近能控性.     

分布参数系统能控能观性问题的统一处理及应用

本文的主要目的是介绍一个统一的处理分布参数系统能控能观性问题的方法,并给出该方法在分布参数控制理论中的应用。为此,本文将从一类“类抛物” 偏微分算子（即没有椭圆性条件）的带权恒等式出发,给出所有已知的关于抛物型方程、双曲型方程、Schrödinger 方程和板方程的基于整体Carleman 估计的能控能观性结果。同时,基于该带权的恒等式,本文还给出它在双曲型系统的稳定性问题和在拟线性复Ginzburg-Landau 方程能控能观性等问题中的应用。     

边值系统的能控性与能观测性问题

把抽象系统的能控性和能观测性推广到由强连续双半群描述的抽象边值系统,给出了相应的边值系统能控性的充要条件,并研究了能观测性与能控性之间的对偶关系.最后作为例子,研究了双曲系统能控性.文中所得的结果可用于讨论现代物理系统中出现一类边值系统的能控性与能观测性问题.     

非线性中立型控制系统函数能控性

本文讨论形如的非线性中立型控制系统函数能控性．给出该类系统的函数能控性和零函数能控性的判定定理．所得结果在实际系统的设计、分析等方面是非常实用的．     

一类非线性chemotaxis系统的局部零能控性

本文研究了一类非线性chemotaxis系统的能控性问题.利用这类线性化结合不动点的方法,获得了非线性系统的局部零能控性结果,推广了非线性抛物-椭圆型方程能控性的结果.     

一类非线性抛物型变分不等方程的全局吸引子及弱近似惯性流形

对由一类非线性抛物型变分不等方程所描述的无穷维动力系统，给出了存在全局吸引子及弱近似惯性流形的充分条件．     

Time Optimal Controls of the Lengyel–Epstein Model with Internal Control

This paper is concerned with the time optimal control problem governed by the internal controlled Lengyel–Epstein model. We prove the existence of optimal controls. Moreover, we give necessary optimality conditions for an optimal control of our original problem by using one of the approximate problems.     

Error Estimates for the Numerical Approximation of Boundary Semilinear Elliptic Control Problems

We study the numerical approximation of boundary optimal control problems governed by semilinear elliptic partial differential equations with pointwise constraints on the control. The analysis of the approximate control problems is carried out. The uniform convergence of discretized controls to optimal controls is proven under natural assumptions by taking piecewise constant controls. Finally, error estimates are established and some numerical experiments, which confirm the theoretical results, are performed.The first two authors were supported by Ministerio de Ciencia y Tecnología (Spain). The second author was also supported by the DFG research center “Mathematics for key technologies” (FZT86) in Berlin.     

Error Estimates for the Approximation of a Class of Optimal Control Systems Governed by Linear PDEs

This paper deals with a class of optimal control problems in which the system is governed by a linear partial differential equation and the control is distributed and with constraints. The problem is posed in the framework of the theory of optimal control of systems. A numerical method is proposed to approximate the optimal control. In this method, the state space as well as the convex set of admissible controls are discretized. An abstract error estimate for the optimal control problem is obtained that depends on both the approximation of the state equation and the space of controls. This theoretical result is illustrated by some numerical examples from the literature.     

Approximate Gradient Projection Method with Runge-Kutta Schemes for Optimal Control Problems

We consider an optimal control problem for systems governed by ordinary differential equations with control constraints. The state equation is discretized by the explicit fourth order Runge-Kutta scheme and the controls are approximated by discontinuous piecewise affine ones. We then propose an approximate gradient projection method that generates sequences of discrete controls and progressively refines the discretization during the iterations. Instead of using the exact discrete directional derivative, which is difficult to calculate, we use an approximate derivative of the cost functional defined by discretizing the continuous adjoint equation by the same Runge-Kutta scheme and the integral involved by Simpson's integration rule, both involving intermediate approximations. The main result is that accumulation points, if they exist, of sequences constructed by this method satisfy the weak necessary conditions for optimality for the continuous problem. Finally, numerical examples are given.     

Approximate Controllability for Integrodifferential Equations with Multiple Delays

This paper considers the approximate controllability for a class of control systems governed by semilinear delay integrodifferential equations with multiple delays. Sufficient conditions for approximate controllability are established by using the Schauder fixed-point theorem. The results obtained improve some analogous existing results. Several examples are provided to illustrate the application of the approximate controllability result.     

A filled function method for constrained global optimization

In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems.     

Augmented Lagrangian algorithms for linear programming

We introduce new augmented Lagrangian algorithms for linear programming which provide faster global convergence rates than the augmented algorithm of Polyak and Treti'akov. Our algorithm shares the same properties as the Polyak-Treti'akov algorithm in that it terminates in finitely many iterations and obtains both primal and dual optimal solutions. We present an implementable version of the algorithm which requires only approximate minimization at each iteration. We provide a global convergence rate for this version of the algorithm and show that the primal and dual points generated by the algorithm converge to the primal and dual optimal set, respectively.     

Upper Semicontinuity and Kolmogorov ε-Entropy of Global Attractor for κ-Dimensional Lattice Dynamical System Corresponding to Klein-Gordon-SchrSdinger Equation

In this paper, we establish the existence of a global attractor for a coupled κ-dimensional lattice dynamical system governed by a discrete version of the Klein-Gordon-SchrSdinger Equation. An estimate of the upper bound of the Kohnogorov ε-entropy of the global attractor is made by a method of element decomposition and the covering property of a polyhedron by balls of radii ε in a finite dimensional space. Finally, a scheme to approximate the global attractor by the global attractors of finite-dimensional ordinary differential systems is presented .     

线性常微分方程的全局误差估计和优化求解方法

线性常微分方程初值问题求解在许多应用中起着重要作用.目前,已存在很多的数值方法和求解器用于计算离散网格点上的近似解,但很少有对全局误差(global error)进行估计和优化的方法.本文首先通过将离散数值解插值成为可微函数用来定义方程的残差;再给出残差与近似解的关系定理并推导出全局误差的上界;然后以最小化残差的二范数为目标将方程求解问题转化为优化求解问题;最后通过分析导出矩阵的结构,提出利用共轭梯度法对其进行求解.之后将该方法应用于滤波电路和汽车悬架系统等实际问题.实验分析表明,本文估计方法对线性常微分方程的初值问题的全局误差具有比较好的估计效果,优化求解方法能够在不增加网格点的情形下求解出线性常微分方程在插值解空间中的全局最优解.