In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation...In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.展开更多
With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued no...With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square（LMS） algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error（MSE） performance among of complex kernel LMS（KLMS） methods according to the specified kernel bandwidth and the length of dictionary.展开更多
The cyclic cross-correlation between a stationary process and a cyclostationary process at cycle frequency α(≠ 0)is identically zero under an ideal condition, which indicates that a cyclic cross-correlation method p...The cyclic cross-correlation between a stationary process and a cyclostationary process at cycle frequency α(≠ 0)is identically zero under an ideal condition, which indicates that a cyclic cross-correlation method performs much better than the conventional cross-correlation method in suppressing the stationary noise or interference. But unfortunately, the cyclic cross-correlation will not really approach zero due to the limited data length in some real conditions. In this paper, the quantitative relation between the data length and the estimated cyclic cross-correlation is deduced, and some useful conclusions are drawn, which are proven by some computer simulations. The conclusion in this paper is really useful for the practical application of cyclostationary signal processing.展开更多
A simplex particle swarm optimization(simplex-PSO) derived from the Nelder-Mead simplex method was proposed to optimize the high dimensionality functions.In simplex-PSO,the velocity term was abandoned and its referenc...A simplex particle swarm optimization(simplex-PSO) derived from the Nelder-Mead simplex method was proposed to optimize the high dimensionality functions.In simplex-PSO,the velocity term was abandoned and its reference objectives were the best particle and the centroid of all particles except the best particle.The convergence theorems of linear time-varying discrete system proved that simplex-PSO is of consistent asymptotic convergence.In order to reduce the probability of trapping into a local optimal value,an extremum mutation was introduced into simplex-PSO and simplex-PSO-t(simplex-PSO with turbulence) was devised.Several experiments were carried out to verify the validity of simplex-PSO and simplex-PSO-t,and the experimental results confirmed the conclusions:(1) simplex-PSO-t can optimize high-dimension functions with 200-dimensionality;(2) compared PSO with chaos PSO(CPSO),the best optimum index increases by a factor of 1×102-1×104.展开更多
The consensus problems of multi-agents with time-varying delays and switching topologies are studied. First, assume that an agent receives state information from its neighbors with fixed communication delays and proce...The consensus problems of multi-agents with time-varying delays and switching topologies are studied. First, assume that an agent receives state information from its neighbors with fixed communication delays and processes its own state information with time-varying self-delay respectively. The state time-delay feedback is introduced into the existing consensus protocol to begenerate an improved protocol. Then a sufficient condition is derived which can make the system with time-varying self-delays achieve the consensus. On this basis, a specific form of consensus equilibrium influenced by the initial states of agents, time-delays and state feedback intensity is figured out. In addition, the multi-agent consensus is considered with time-varying topologies. Finally, simulations are presented to il ustrate the validity of theoretical results.展开更多
A higher-order cumulant-based weighted least square（HOCWLS） and a higher-order cumulant-based iterative least square（HOCILS） are derived for multiple inputs single output（MISO） errors-in-variables（EIV） systems...A higher-order cumulant-based weighted least square（HOCWLS） and a higher-order cumulant-based iterative least square（HOCILS） are derived for multiple inputs single output（MISO） errors-in-variables（EIV） systems from noisy input/output data. Whether the noises of the input/output of the system are white or colored, the proposed algorithms can be insensitive to these noises and yield unbiased estimates. To realize adaptive parameter estimates, a higher-order cumulant-based recursive least square（HOCRLS） method is also studied. Convergence analysis of the HOCRLS is conducted by using the stochastic process theory and the stochastic martingale theory. It indicates that the parameter estimation error of HOCRLS consistently converges to zero under a generalized persistent excitation condition. The usefulness of the proposed algorithms is assessed through numerical simulations.展开更多
The identification of nonlinear systems with multiple sampled rates is a difficult task.The motivation of our paper is to study the parameter estimation problem of Hammerstein systems with dead-zone characteristics by...The identification of nonlinear systems with multiple sampled rates is a difficult task.The motivation of our paper is to study the parameter estimation problem of Hammerstein systems with dead-zone characteristics by using the dual-rate sampled data.Firstly,the auxiliary model identification principle is used to estimate the unmeasurable variables,and the recursive estimation algorithm is proposed to identify the parameters of the static nonlinear model with the dead-zone function and the parameters of the dynamic linear system model.Then,the convergence of the proposed identification algorithm is analyzed by using the martingale convergence theorem.It is proved theoretically that the estimated parameters can converge to the real values under the condition of continuous excitation.Finally,the validity of the proposed algorithm is proved by the identification of the dual-rate sampled nonlinear systems.展开更多
Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new ...Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed.展开更多
文摘In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.
基金supported by the National Natural Science Foundation of China(6100115361271415+4 种基金6140149961531015)the Fundamental Research Funds for the Central Universities(3102014JCQ010103102014ZD0041)the Opening Research Foundation of State Key Laboratory of Underwater Information Processing and Control(9140C231002130C23085)
文摘With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square（LMS） algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error（MSE） performance among of complex kernel LMS（KLMS） methods according to the specified kernel bandwidth and the length of dictionary.
文摘The cyclic cross-correlation between a stationary process and a cyclostationary process at cycle frequency α(≠ 0)is identically zero under an ideal condition, which indicates that a cyclic cross-correlation method performs much better than the conventional cross-correlation method in suppressing the stationary noise or interference. But unfortunately, the cyclic cross-correlation will not really approach zero due to the limited data length in some real conditions. In this paper, the quantitative relation between the data length and the estimated cyclic cross-correlation is deduced, and some useful conclusions are drawn, which are proven by some computer simulations. The conclusion in this paper is really useful for the practical application of cyclostationary signal processing.
基金Project(50275150) supported by the National Natural Science Foundation of ChinaProject(20070533131) supported by Research Fund for the Doctoral Program of Higher Education of China
文摘A simplex particle swarm optimization(simplex-PSO) derived from the Nelder-Mead simplex method was proposed to optimize the high dimensionality functions.In simplex-PSO,the velocity term was abandoned and its reference objectives were the best particle and the centroid of all particles except the best particle.The convergence theorems of linear time-varying discrete system proved that simplex-PSO is of consistent asymptotic convergence.In order to reduce the probability of trapping into a local optimal value,an extremum mutation was introduced into simplex-PSO and simplex-PSO-t(simplex-PSO with turbulence) was devised.Several experiments were carried out to verify the validity of simplex-PSO and simplex-PSO-t,and the experimental results confirmed the conclusions:(1) simplex-PSO-t can optimize high-dimension functions with 200-dimensionality;(2) compared PSO with chaos PSO(CPSO),the best optimum index increases by a factor of 1×102-1×104.
基金supported by the National Natural Science Foundation of China(6087405361034006)
文摘The consensus problems of multi-agents with time-varying delays and switching topologies are studied. First, assume that an agent receives state information from its neighbors with fixed communication delays and processes its own state information with time-varying self-delay respectively. The state time-delay feedback is introduced into the existing consensus protocol to begenerate an improved protocol. Then a sufficient condition is derived which can make the system with time-varying self-delays achieve the consensus. On this basis, a specific form of consensus equilibrium influenced by the initial states of agents, time-delays and state feedback intensity is figured out. In addition, the multi-agent consensus is considered with time-varying topologies. Finally, simulations are presented to il ustrate the validity of theoretical results.
基金supported by the National High Technology Researchand Development Program of China(863 Program)(2012AA121602)the Preliminary Research Program of the General Armament Department of China(51322050202)
文摘A higher-order cumulant-based weighted least square（HOCWLS） and a higher-order cumulant-based iterative least square（HOCILS） are derived for multiple inputs single output（MISO） errors-in-variables（EIV） systems from noisy input/output data. Whether the noises of the input/output of the system are white or colored, the proposed algorithms can be insensitive to these noises and yield unbiased estimates. To realize adaptive parameter estimates, a higher-order cumulant-based recursive least square（HOCRLS） method is also studied. Convergence analysis of the HOCRLS is conducted by using the stochastic process theory and the stochastic martingale theory. It indicates that the parameter estimation error of HOCRLS consistently converges to zero under a generalized persistent excitation condition. The usefulness of the proposed algorithms is assessed through numerical simulations.
基金supported by the National Natural Science Foundation of China(61863034)
文摘The identification of nonlinear systems with multiple sampled rates is a difficult task.The motivation of our paper is to study the parameter estimation problem of Hammerstein systems with dead-zone characteristics by using the dual-rate sampled data.Firstly,the auxiliary model identification principle is used to estimate the unmeasurable variables,and the recursive estimation algorithm is proposed to identify the parameters of the static nonlinear model with the dead-zone function and the parameters of the dynamic linear system model.Then,the convergence of the proposed identification algorithm is analyzed by using the martingale convergence theorem.It is proved theoretically that the estimated parameters can converge to the real values under the condition of continuous excitation.Finally,the validity of the proposed algorithm is proved by the identification of the dual-rate sampled nonlinear systems.
基金supported by the Key Foundation of Southwest University for Nationalities(09NZD001).
文摘Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed.
