Dynamical Systems and Adaptive Timestepping in ODE Solvers

Initial value problems for ODEs are often solved numerically using adaptive timestepping algorithms. These algorithms are controlled by a user-defined tolerance which bounds from above the estimated error committed at each step. We formulate a large class of such algorithms as discrete dynamical systems which are discontinuous and of higher dimension than the underlying ODE. By assuming sufficiently strong finite-time convergence results on some neighbourhood of an attractor of the ODE we prove existence and upper semicontinuity results for a nearby numerical attractor as the tolerance tends to zero.This assumption of sufficiently strong finite-time convergence results is then examined for adaptive algorithms that use a pair of explicit Runge-Kutta methods of different order to estimate the one-step error. For arbitrary Runge-Kutta pairs the necessary finite-time convergence results fail to hold on a set of points in the phase space that includes all the equilibria of the ODE. Therefore, in general, the asymptotic convergence results cannot be applied to attractors containing equilibria. However, for a particular class of Runge-Kutta pairs, the finite-time convergence results can be strengthened to include neighbourhoods of equilibrium points for which the Jacobian is invertible.     

二维风险模型中Copula 相依下的破产概率

在本文中, 我们把Copula 连结函数用到二维的风险模型中, 考虑两个模型索赔额之间基于Copula 的相依关系. 首先对二维复合Poisson 模型给出了最早破产时刻定义下的生存概率满足的偏微分方程; 然后对二维的复合二项模型, 分别在连续型索赔额分布和离散型索赔额分布下给出了不同定义的生存概率和破产概率的递归公式, 并且特别选择了FGM Copula 连结函数, 给出了相应的结果; 另外在离散型分布下, 对于其Copula 函数的不唯一性进行了说明.     

On weak and strong reachability and controllability of infinite-dimensional linear systems

The notions of reachability and controllability generalize to infinite-dimensional systems in two different ways. We show that the strong notions are equivalent to finite-time reachability and controllability. For discrete systems in Hilbert space, we get simple relations generalizing the Kalman conditions. In the case of a continuous system in Hilbert space, weak reachability is equivalent to the weak reachability of a related discrete system via the Cayley transform.This research was partially supported by the Batsheva de Rothschild Fund for the Advancement of Science and Technology.     

Some criteria for the global finite-time synchronization of two Lorenz–Stenflo systems coupled by a new controller

This paper investigates the global finite-time synchronization of two chaotic Lorenz–Stenflo systems coupled by a new controller called the generalized variable substitution controller. First of all, the generalized variable substitution controller is designed to establish the master–slave finite-time synchronization scheme for the Lorenz–Stenflo systems. And then, based on the finite-time stability theory, a sufficient criterion on the finite-time synchronization of this scheme is rigorously verified in the form of matrix and the corresponding estimation for the synchronization time is analytically given. Applying this criterion, some sufficient finite-time synchronization criteria under various generalized variable substitution controllers are further derived in the algebraic form. Finally, some numerical examples are introduced to compare the results proposed in this paper with those proposed in the existing literature, verifying the effectiveness of the criteria obtained.     

Analysis of Static Simulated Annealing Algorithms

Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms to address intractable discrete optimization problems. This paper introduces a measure for determining the expected number of iterations to visit a predetermined objective function level, given that an inferior objective function level has been reached in a finite number of iterations. A variation of simulated annealing (SA), termed static simulated annealing (S²A), is analyzed using this measure. S²A uses a fixed cooling schedule during the algorithm execution. Though S²A is probably nonconvergent, its finite-time performance can be assessed using the finite-time performance measure defined in this paper.     

Resilient and robust finite-time H∞ control for uncertain discrete-time jump nonlinear systems

This paper studies the robust and resilient finite-time H_∞ control problem for uncertain discrete-time nonlinear systems with Markovian jump parameters. With the help of linear matrix inequalities and stochastic analysis techniques, the criteria concerning stochastic finite-time boundedness and stochastic H_∞ finite-time boundedness are initially established for the nonlinear stochastic model. We then turn to stochastic finite-time controller analysis and design to guarantee that the stochastic model is stochastically H_∞ finite-time bounded by employing matrix decomposition method. Applying resilient control schemes, the resilient and robust finite-time controllers are further designed to ensure stochastic H_∞ finite-time boundedness of the derived stochastic nonlinear systems. Moreover, the results concerning stochastic finite-time stability and stochastic finite-time boundedness are addressed. All derived criteria are expressed in terms of linear matrix inequalities, which can be solved by utilizing the available convex optimal method. Finally, the validity of obtained methods is illustrated by numerical examples.     

Finite-time stabilization of a class of chaotic systems via adaptive control method

This paper investigates the stabilization of three dimensional chaotic systems in a finite time by extending our previous method for chaos stabilization. Based on the finite-time stability theory, a control law is proposed to realize finite-time stabilization of three dimensional chaotic systems. In comparison with the previous methods, the controller obtained by our method is simpler than those. Moreover, the method obtained in this paper is suitable for a class of three dimensional chaotic systems. The efficiency of the control scheme is revealed by some illustrative simulations.     

Robust finite-time H∞ control of singular stochastic systems via static output feedback

This paper addresses the problem of robust finite-time stabilization of singular stochastic systems via static output feedback. Firstly, sufficient conditions of singular stochastic finite-time boundedness on static output feedback are obtained for the family of singular stochastic systems with parametric uncertainties and time-varying norm-bounded disturbance. Then the results are extended to singular stochastic H_∞ finite-time boundedness for the class of singular stochastic systems. Designed algorithm for static output feedback controller is provided to guarantee that the underlying closed-loop singular stochastic system is singular stochastic H_∞ finite-time boundedness in terms of strict linear matrix equalities with a fixed parameter. Finally, an illustrative example is presented to show the validity of the developed methodology.     

Finite-time dissipative control for singular discrete-time Markovian jump systems with actuator saturation and partly unknown transition rates

In this work, the finite-time dissipative control problem is considered for singular discrete-time Markovian jumping systems with actuator saturation and partly unknown transition rates. By constructing a proper Lyapunov–Krasonski functional and the method of linear matrix inequalities (LMIs), sufficient conditions that ensure the systems singular stochastic finite-time stability and singular stochastic finite-time dissipative are obtained. Then, the state feedback controllers are designed, and in order to get the optimal values of the dissipative level, the results are extended to LMI convex optimization problems. Finally, numerical examples are given to illustrate the validity of the proposed methods.     

Finite-Time Performance Analysis of Static Simulated Annealing Algorithms

Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms for addressing intractable discrete optimization problems. Current theoretical results are based on the assumption that the goal when addressing such problems is to find a globally optimal solution. However, from a practical point of view, solutions that are close enough to a globally optimal solution (where close enough is measured in terms of the objective function value) for a discrete optimization problem may be acceptable. This paper introduces -acceptable solutions, where is a value greater than or equal to the globally optimal objective function value. Moreover, measures for assessing the finite-time performance of GHC algorithms, in terms of identifying -acceptable solutions, are defined. A variation of simulated annealing (SA), termed static simulated annealing (S²A), is analyzed using these measures. S²A uses a fixed cooling schedule during the algorithm's execution. Though S²A is provably nonconvergent, its finite-time performance can be assessed using the finite-time performance measures defined in terms of identifying -acceptable solutions. Computational results with a randomly generated instance of the traveling salesman problem are reported to illustrate the results presented. These results show that upper and lower estimates for the number of iterations to reach a -acceptable solution within a specified number of iterations can be obtained, and that these estimates are most accurate for moderate and high fixed temperature values for the S²A algorithm.     

Finite-time L1 control for positive switched linear systems with time-varying delay

This paper is concerned with the problem of finite-time L₁ control for a class of positive switched linear systems with time-varying delay. Firstly, by using the average dwell time approach, sufficient conditions which can guarantee the L₁ finite-time boundedness of the underlying system are given. Then, in virtue of the results obtained, a state feedback controller is designed to ensure that the resulting closed-loop system is finite-time bounded with L₁-gain performance. All the obtained results are formulated in terms of linear matrix inequalities (LMIs), which can be solved conveniently. Finally, an example is given to illustrate the efficiency of the proposed method.     

Finite-time stochastic synchronization of complex networks

In this paper, we study the finite-time stochastic synchronization problem for complex networks with stochastic noise perturbations. By using finite-time stability theorem, inequality techniques, the properties of Weiner process and adding suitable controllers, sufficient conditions are obtained to ensure finite-time stochastic synchronization for the complex networks. The effects of control parameters on synchronization speed and time are also analyzed. The results of this paper are applicable to both directed and undirected weighted networks while do not need to know any information about eigenvalues of coupling matrix. Since finite-time synchronization means the optimality in convergence time and has better robustness and disturbance rejection properties, the results of this paper are important. A numerical example shows the effectiveness of our new results.     

复合二项过程风险模型的精细大偏差及有限时间破产概率

讨论基于客户到来的复合二项过程风险模型.在该风险模型中,假设索赔额序列是独立同分布的重尾随机变量序列,不同保单发生实际索赔的概率可以不同,则在索赔额服从ERV的条件下,得到了损失过程的精细大偏差;进一步地,得到了有限时间破产概率的Lundberg极限结果.     

Global finite-time synchronization of different dimensional chaotic systems

This paper addresses the problem of global finite-time synchronization of two different dimensional chaotic systems. Firstly, the definition of global finite-time synchronization of different dimensional chaotic systems are introduced. Based on the finite-time stability methods, the controller is designed such that the chaotic systems are globally synchronized in a finite time. Then, some uncertain parameters are adopted in the chaotic systems, new control law and dynamical parameter estimation are proposed to guarantee that the global finite-time synchronization can be obtained. By considering a dynamical parameter designed in the controller, the adaptive updated controller is also designed to achieve the desired results. At last, the results of two different dimensional chaotic systems are also extended to two different dimensional networked chaotic systems. Finally, three numerical examples are given to verify the validity of the proposed methods.     

Finite-time ruin probability in the inhomogeneous claim case

This paper deals with the discrete-time risk model with nonidentically distributed claims. The recursive formula of finite-time ruin probability is obtained, which enables one to evaluate the probability of ruin with desired accuracy. Rational valued claims and nonconstant premium payments are considered. Some numerical examples of finite-time ruin probability calculation are presented.     

常息力更新场合有限时间破产概率对负相依索赔额的不敏感性

设索赔来到过程为具有常数利息力度的更新风险模型.在索赔额分布为负相依的次指数分布假定下,建立了有限时间破产概率的一个渐近等价公式.所得结果显示,在独立同分布索赔额情形,有限时间破产概率的有关渐近等价公式,在负相依场合依然成立.这表明有限时间破产概率对于索赔额的负相依结构是不敏感的.     

Speeding up COMPASS for high-dimensional discrete optimization via simulation

The convergent optimization via most promising area stochastic search (COMPASS) algorithm is a locally convergent random search algorithm for solving discrete optimization via simulation problems. COMPASS has drawn a significant amount of attention since its introduction. While the asymptotic convergence of COMPASS does not depend on the problem dimension, the finite-time performance of the algorithm often deteriorates as the dimension increases. In this paper, we investigate the reasons for this deterioration and propose a simple change to the solution-sampling scheme that significantly speeds up COMPASS for high-dimensional problems without affecting its convergence guarantee.     

A note on a dependent risk model with constant interest rate

For a dependent risk model with constant interest rate, in which the claim sizes form a sequence of upper tail asymptotically independent and identically distributed random variables, and their inter-arrival times are another sequence of widely lower orthant dependent and identically distributed random variables, we will give an asymptotically equivalent formula for the finite-time ruin probability. The obtained asymptotics holds uniformly in an arbitrarily finite-time interval.     

Uniform Asymptotics for the Finite-Time Ruin Probability of a Dependent Risk Model with a Constant Interest Rate

This paper gives an asymptotically equivalent formula for the finite-time ruin probability of a nonstandard risk model with a constant interest rate, in which both claim sizes and inter-arrival times follow a certain dependence structure. This new dependence structure allows the underlying random variables to be either positively or negatively dependent. The obtained asymptotics hold uniformly in a finite time interval. Especially, in the renewal risk model the uniform asymptotics of the finite-time ruin probability for all times have been given. The obtained results have extended and improved some corresponding results.     

A cyclic approach on classical ruin model

The ruin problem has long since received much attention in the literature. Under the classical compound Poisson risk model, elegant results have been obtained in the past few decades. We revisit the finite-time ruin probability by using the idea of cycle lemma, which was used in proving the ballot theorem. The finite-time result is then extended to infinite-time horizon by applying the weak law of large numbers. The cycle lemma also motivates us to study the claim instants retrospectively, and this idea can be used to reach the ladder height distribution on the infinite-time horizon. The new proofs in this paper link the classical finite-time and infinite-time ruin results, and give an intuitive way to understand the nature of ruin.