Local Discontinuous Galerkin Finite Element Method and Error Estimates for One Class of Sobolev Equation

In this paper we present a numerical scheme based on the local discontinuous Galerkin (LDG) finite element method for one class of Sobolev equations, for example, generalized equal width Burgers equation. The proposed scheme will be proved to have good numerical stability and high order accuracy for arbitrary nonlinear convection flux, when time variable is continuous. Also an optimal error estimate is obtained for the fully discrete scheme, when time is discreted by the second order explicit total variation diminishing (TVD) Runge-Kutta time-marching. Finally some numerical results are given to verify our analysis for the scheme.     

Stabilization of Hybrid Systems by Feedback Control Based on Discrete‐Time State and Mode Observations

Recently, a kind of feedback control based on discrete‐time state observations was proposed to stabilize continuous‐time hybrid stochastic systems in the mean‐square sense. We find that the feedback control there still depends on the continuous‐time observations of the mode. However, it usually costs to identify the current mode of the system in practice. So we can further improve the control to reduce the control cost by identifying the mode at discrete times when we make observations for the state. In this paper, we aim to design such a type of feedback control based on the discrete‐time observations of both state and mode to stabilize the given hybrid stochastic differential equations (SDEs) in the sense of mean‐square exponential stability. Moreover, a numerical example is given to illustrate our results.     

Compensatability and optimal compensation of systems with white parameters in the delta domain

Using the delta operator, the strengthened discrete-time optimal projection equations for optimal reduced-order compensation of systems with white stochastic parameters are formulated in the delta domain. The delta domain unifies discrete time and continuous time. Moreover, when formulated in this domain, the efficiency and numerical conditioning of algorithms improves when the sampling rate is high. Exploiting the unification, important theoretical results, algorithms and compensatability tests concerning finite and infinite horizon optimal compensation of systems with white stochastic parameters are carried over from discrete time to continuous time. Among others, we consider the finite-horizon time-varying compensation problem for systems with white stochastic parameters and the property mean-square compensatability (ms-compensatability) that determines whether a system with white stochastic parameters can be stabilised by means of a compensator. In continuous time, both of these appear to be new. This also holds for the associated numerical algorithms and tests to verify ms-compensatability. They are illustrated with three numerical examples that reveal several interesting theoretical and numerical issues. A fourth example illustrates the improvement of both the efficiency and numerical conditioning of the algorithms. This is of vital practical importance for digital control system design when the sampling rate is high.     

Multiple time scale decomposition of discrete time Markov chains

The multiple time scale decomposition of discrete time, finite state Markov chains is addressed. In [1, 2], the behavior of a continuous time Markov chain is approximated using a fast time scale, ε-independent, continuous time process, and a reduced order perturbed process. The procedure can then be iterated to obtain a complete multiple time scale decomposition. In the discrete time case presented in this paper, the basic approximation has a ‘hybrid’ form. In this form, the fast time scale behavior is approximated using an ε-independent, discrete time Markov chain, and the slow behavior is captured by a perturbed, continuous time process. Further time scale decomposition then involves the continuous time procedure in [1, 2]. This extension to discrete time chains bridges previous multiple time scale decomposition results, which have dealt exclusively with either continuous time or discrete time processes, and provides a uniform framework for the analysis of both types of systems.     

一种基于死区离散趋近律的准滑模控制

针对受正弦信号干扰的不确定离散时间系统,提出一种基于死区离散趋近律的准滑模控制方法. 系统能够由任一初始状态向死区作单调趋近运动,并于有限时间到达准滑动模态区作准滑动模态运动. 准滑动模态带具有任意阶次小的特点.该方法进一步增强了系统鲁棒性,有效改善系统动态品质,减小了稳态误差.系统无 控制抖振和稳态抖振产生.仿真结果表明该方法的有效性.     

含扩散项不可靠生产系统最优生产控制的数值求解

针对含扩散项不可靠随机生产系统最优生产控制的优化命题, 采用数值解方法来求解该优化命题最优控制所满足的模态耦合的非线性偏微分HJB方程. 首先构造Markov链来近似生产系统状态演化, 并基于局部一致性原理, 把求解连续时间随机控制问题转化为求解离散时间的Markov决策过程问题, 然后采用数值迭代和策略迭代算法来实现最优控制数值求解过程. 文末仿真结果验证了该方法的正确性和有效性.     

Compensation of time‐varying input delay for discrete‐time nonlinear systems

We consider general discrete‐time nonlinear systems (of arbitrary nonlinear growth) with time‐varying input delays and design an explicit predictor feedback controller to compensate the input delay. Such results have been achieved in continuous time, but only under the restriction that the delay rate is bounded by unity, which ensures that the input signal flow does not get reversed, namely, that old inputs are not felt multiple times by the plant (because on such subsequent occasions, the control input acts as a disturbance). For discrete‐time systems, an analogous restriction would be that the input delay is non‐increasing. In this work, we do not impose such a restriction. We provide a design and a global stability analysis that allow the input delay to be arbitrary (containing intervals of increase, decrease, or stagnation) over an arbitrarily long finite period of time. Unlike in the continuous‐time case, the predictor feedback law in the discrete‐time case is explicit. We specialize the result to linear time‐invariant systems and provide an explicit estimate of the exponential decay rate. Carefully constructed examples are provided to illustrate the design and analytical challenges. Copyright © 2015 John Wiley & Sons, Ltd.     

Convergence analysis of Schwarz methods without overlap for the Helmholtz equation

In this paper, the continuous and discrete optimal transmission conditions for the Schwarz algorithm without overlap for the Helmholtz equation are studied. Since such transmission conditions lead to non-local operators, they are approximated through two different approaches. The first approach, called optimized, consists of an approximation of the optimal continuous transmission conditions with partial differential operators, which are then optimized for efficiency. The second approach, called approximated, is based on pure algebraic operations performed on the optimal discrete transmission conditions. After demonstrating the optimal convergence properties of the Schwarz algorithm new numerical investigations are performed on a wide range of unstructured meshes and arbitrary mesh partitioning with cross points. Numerical results illustrate for the first time the effectiveness, robustness and comparative performance of the optimized and approximated Schwarz methods on a model problem and on industrial problems.     

Consensus condition for linear multi-agent systems over randomly switching topologies

This paper studies both continuous and discrete time consensus problems for multi-agent systems with linear time-invariant agent dynamics over randomly switching topologies. The switching is governed by a time-homogeneous Markov process, whose state corresponds to a possible interaction topology among agents. Necessary and sufficient conditions are derived for achieving consensus under a common control protocol, respectively. It is shown that the effect of switching topologies on consensus is determined by the union of topologies associated with the positive recurrent states of the Markov process. Moreover, the effect of random link failures on discrete time consensus is investigated. The implications and relationships with the existing results are discussed. Finally, the theoretical results are validated via simulations.     

Continuous/discrete modeling and analysis of elastic planar multi-body systems

The modeling and analysis of continuous/discrete multi-body systems are described, with emphasis on applications to elastic planar closed-loop systems. Whereas the continuous formulations presented can be applied to simplified models (with less effort) to help isolate the dominant factors for parametric evaluations in preliminary analysis studies, on the other hand, the finite element formulations described are, in general, applicable for more complex geometries and larger problems. In this regard, an explicit self-starting velocity-based time integration architecture is employed for the numerical simulation of multi-body dynamics with several inherent attractive features. Numerical test cases for planar multi-body dynamic situations employing the Timoshenko beam theory are presented from a generalized viewpoint in conjunction with the present formulations to validate the applicability of the proposed formulations.     

Exponential stability of impulsive positive switched systems with discrete and distributed time‐varying delays

This paper studies the exponential stability problems of discrete‐time and continuous‐time impulsive positive switched systems with mixed (discrete and distributed) time‐varying delays, respectively. By constructing novel copositive Lyapunov‐Krasovskii functionals and using the average dwell time technique, delay‐dependent sufficient conditions for the solvability of considered problems are given in terms of fairly simple linear matrix inequalities. Compared with the most existing results, by introducing an extra real vector, restrictive conditions on derivative of the time‐varying delays (less than 1) are relaxed, thus the obtained improved stability criteria can deal with a wider class of continuous‐time positive switched systems with time‐varying delays. Finally, two simple examples are provided to verify the validity of theoretical results.     

Border and surface tracing--theoretical foundations

In this paper we define and study digital manifolds of arbitrary dimension, and provide (in particular)a general theoretical basis for curve or surface tracing in picture analysis. The studies involve properties such as one-dimensionality of digital curves and (n-1)-dimensionality of digital hypersurfaces that makes them discrete analogs of corresponding notions in continuous topology. The presented approach is fully based on the concept of adjacency relation and complements the concept of dimension as common in combinatorial topology. This work appears to be the first one on digital manifolds based ona graph-theoretical definition of dimension. In particular, in the n-dimensional digital space, a digital curve is a one-dimensional object and a digital hypersurface is an (n-1)-dimensional object, as it is in the case of curves and hypersurfaces in the Euclidean space. Relying on the obtained properties of digital hypersurfaces, we propose a uniform approach for studying good pairs defined by separations and obtain a classification of good pairs in arbitrary dimension. We also discuss possible applications of the presented definitions and results.     

Switched nonlinear singular systems with time‐delay: Stability analysis

This paper presents an approach to the stability analysis of a class of nonlinear interconnected continuous‐time singular systems with arbitrary switching signals. This class of interconnected subsystems consists of unknown but bounded state delay and nonlinear terms, and each subsystem can be globally stable, unstable, or locally stable. By constructing a new Lyapunov‐like Krasovskii functional, sufficient conditions are derived and formulated to check the asymptotic (exponential) stability of such systems with arbitrary switching signals. Then, some new general criteria for asymptotic (exponential) stability with average dwell‐time switching signals are also established. The theoretical developments are demonstrated by two numerical simulations. Copyright © 2014 John Wiley & Sons, Ltd.     

连续时间 Hopfield网络模型数值实现分析

讨论使用Euler方法和梯形方法在数值求解连续时间的Hopfield网络模型时,离散时间步长的选择和迭代停止条件问题.利用凸函数的定义研究了能量函数下降的条件,根据凸函数的性质分析它的共轭函数减去二次函数之差仍为凸函数的条件.分析连续时间Hopfield网络模型的收敛性证明,提出了一个广义的连续时间Hopfield网络模型.对于常用的Euler方法和梯形方法数值求数值实现连续时间Hopfield网络,讨论了离散时间步长的选择.由于梯形方法为隐式方法,分析了它的迭代求算法的停止条件.根据连续时间Hopfield网络的特点,提出改进的迭代算法,并对其进行了分析.数值实验的结果表明,较大的离散时间步长不仅加速了数值实现,而且有利于提高优化性能.     

A stable space–time finite element method for parabolic evolution problems

This paper is concerned with the analysis of a new stable space–time finite element method (FEM) for the numerical solution of parabolic evolution problems in moving spatial computational domains. The discrete bilinear form is elliptic on the FEM space with respect to a discrete energy norm. This property together with a corresponding boundedness property, consistency and approximation results for the FEM spaces yield an a priori discretization error estimate with respect to the discrete norm. Finally, we confirm the theoretical results with numerical experiments in spatial moving domains.     

基于Vega的舰船模型多尺度多视点提取技术

舰船三维目标识别是一个较为复杂的问题，需通过建立完整的、准确的三维舰船目标的二维视图库来描述一艘舰船目标，为此提出了一种基于Vega的舰船多尺度多视点提取技术。首先介绍了舰船目标的三维建模技术；然后研究了怎样由三维舰船模型经由Vega仿真软件自动批量的提取出任意尺度、任意视点的二维舰船视图，并实现自动将不同视点的显示转成二值图像存储。     

Modeling and optimizing traffic light settings in road networks

We discuss continuous traffic flow network models including traffic lights. A mathematical model for traffic light settings within a macroscopic continuous traffic flow network is presented, and theoretical properties are investigated. The switching of the traffic light states is modeled as a discrete decision and is subject to optimization. A numerical approach for the optimization of switching points as a function of time based upon the macroscopic traffic flow model is proposed. The numerical discussion relies on an equivalent reformulation of the original problem as well as a mixed-integer discretization of the flow dynamics. The large-scale optimization problem is solved using derived heuristics within the optimization process. Numerical experiments are presented for a single intersection as well as for a road network.     

Probabilistic systems coalgebraically: A survey

We survey the work on both discrete and continuous-space probabilistic systems as coalgebras, starting with how probabilistic systems are modeled as coalgebras and followed by a discussion of their bisimilarity and behavioral equivalence, mentioning results that follow from the coalgebraic treatment of probabilistic systems. It is interesting to note that, for different reasons, for both discrete and continuous probabilistic systems it may be more convenient to work with behavioral equivalence than with bisimilarity.     

Spectral properties of the SPH Laplacian operator

In order to address the question of the SPH (Smoothed Particle Hydrodynamics) Laplacian conditioning, a spectral analysis of this discrete operator is performed. In the case of periodic Cartesian particle network, the eigenfunctions and eigenvalues of the SPH Laplacian are found on theoretical grounds. The theory agrees well with numerical eigenvalues. The effects of particle disorder and non-periodicity conditions are then investigated from numerical viewpoint. It is found that the matrix condition number is proportional to the square of the particle number per unit length, irrespective of the space dimension and kernel choice.     

Quasi-Monte Carlo methods for Markov chains with continuous multi-dimensional state space

We describe a quasi-Monte Carlo method for the simulation of discrete time Markov chains with continuous multi-dimensional state space. The method simulates copies of the chain in parallel. At each step the copies are reordered according to their successive coordinates. We prove the convergence of the method when the number of copies increases. We illustrate the method with numerical examples where the simulation accuracy is improved by large factors compared with Monte Carlo simulation.