协方差重置的两阶段递推贝叶斯参数辨识算法

为了在有色噪声干扰情况下获得无偏估计,基于辅助模型思想和分解技术,提出了一种带协方差重置的两阶段递推贝叶斯辨识算法。该算法首先把待辨识模型分解成两个虚拟子模型,然后分别辨识;同时,把估计到的噪声方差引入算法,并加入了一种新的协方差重置方法。计算量分析表明,与带协方差重置的最小二乘算法相比,所提算法可以减少计算量。仿真结果显示,所提算法的估计误差比传统最小二乘算法要小。实例建模证明了算法的有效性。     

State inverse and decorrelated state stochastic approximation

Stochastic approximation algorithms for parameter identification are derived by a sequential optimization and weighted averaging procedure with an instructive geometric interpretation. Known algorithms including standard least squares and suboptimal versions requiring less computational effort are thereby derived. More significantly, novel schemes emerge from the theory which, in the cases studied to date and reported here, converge much more rapidly than their nearest rivals amongst the class of known simple schemes. The novel algorithms are distinguished from the known ones by either a different step size selection, and/or by working with a transformed state variable with components relatively less correlated, and/or by replacing the state vector in a crucial part of the calculations by its componentwise pseudoinverse.The convergence rate of the novel schemes in our simulations is significantly closer to that of the more sophisticated optimal least square recursions than other stochastic approximations schemes in the literature. For the case of extended least squares and recursive maximum likelihood schemes, the novel stochastic recursion performs, in loose terms within a factor of 10 (rms error), of the more sophisticated schemes in the literature. An asymptotic convergence analysis for the algorithms is a minor extension of known theory.     

基于数据滤波的带协方差重置的递推贝叶斯算法

针对传统最小二乘算法计算量大、在有色噪声干扰下估计有误差的问题,提出了一种基于滤波技术的带协方差重置的递推贝叶斯算法。该算法首先使用一个动态非线性滤波器对输入输出数据进行滤波,然后使用贝叶斯方法进行参数估计。同时,为了加快参数的收敛速度,在算法中加入了一种新型的协方差重置策略。计算量分析表明,当过程模型和噪声模型的阶数分别为6和4的时候,所提算法可以减少约62.35%的计算量。仿真结果显示,所提算法与传统最小二乘算法在采样数据长度为3000时的估计误差分别为0.771%和1.118%。因此,所提算法具有较高的计算效率,并且可以给出精度较高的参数估计值。     

基于KRLS的非均匀采样非线性系统辨识

利用提升技术可将非均匀采样非线性系统离散化为一个多输入单输出传递函数模型,从而将系统输出表示为非均匀刷新非线性输入和输出回归项的线性参数模型,进一步基于非线性输入的估计或过参数化方法进行辨识.然而,当非线性环节结构未知或不能被可测非均匀输入参数化表示时,上述辨识方法将不再适用.为了解决这个问题,利用核方法将原始非线性数据投影到高维特征空间中使其线性可分,再对投影后的数据应用递推最小二乘算法进行辨识,提出基于核递推最小二乘的非均匀采样非线性系统辨识方法.此外,针对系统含有有色噪声干扰的情况,参考递推增广最小二乘算法的思想,利用估计残差代替不可测噪声,提出核递推增广最小二乘算法.最后,通过仿真例子验证所提算法的有效性.     

有色噪声干扰输出误差系统的偏差补偿递推最小二乘辨识方法

借助于偏差补偿原理和预滤波思想, 推导了有色噪声干扰输出误差系统参数估计的偏差补偿递推最小二乘 (Bias compensation recursive least squares, BCRLS) 辨识方法. 该方法降低了辨识对输入信号平稳性的要求, 实现了偏差补偿方法参数估计的递推计算, 可以用于在线辨识. 提出的递推 BCRLS 辨识方法优于非递推偏差补偿最小二乘算法, 提高了参数估计精度. 仿真试验证实了算法的有效性.     

Algorithms for recursive/semi-recursive bias-compensating least squares system identification within the errors-in-variables framework

Algorithms for the recursive/semi-recursive estimation of the system parameters as well as the measurement noise variances for linear single-input single-output errors-in-variables systems are considered. Approaches based on three offline techniques are presented: namely, the bias eliminating least squares, the Frisch scheme and the extended bias compensating the least squares method. Whilst the underlying equations used within these approaches are identical under certain design choices, the performances of the recursive/semi-recursive algorithms are investigated via simulation, in order to determine the most suitable technique for practical applications.     

基于辅助模型的递推增广最小二乘辨识方法

针对有色噪声干扰的输出误差滑动平均系统, 将辅助模型与递推增广最小二乘算法相结合: 用辅助模型的输出代替辨识模型信息向量中的未知真实输出项, 用估计残差代替信息向量中的不可测噪声项, 从而提出了基于辅助模型的递推增广最小二乘辨识方法. 为了展示所提方法的特点, 文中还给出了经过模型变换的递推增广最小二乘算法. 理论分析和仿真研究表明, 提出的方法原理简单、计算量小, 可以给出高精度参数估计, 且能够用于在线辨识.     

Recursive prediction error algorithms without a stability test

In this paper, recursive prediction error identification schemes are studied which incorporate Kalman gain calculations to ensure exponential stability of the predictor and related recursions. Thus there is an alternative to the trial and error projection techniques and stability test calculations of earlier schemes with no compromise on convergence rate or computational effort. The resulting algorithms are then attractive for a wide range of applications.     

A Fast Nonlinear Model Identification Method

The identification of nonlinear dynamic systems using linear-in-the-parameters models is studied. A fast recursive algorithm (FRA) is proposed to select both the model structure and to estimate the model parameters. Unlike orthogonal least squares (OLS) method, FRA solves the least-squares problem recursively over the model order without requiring matrix decomposition. The computational complexity of both algorithms is analyzed, along with their numerical stability. The new method is shown to require much less computational effort and is also numerically more stable than OLS.     

广义输出误差模型的两阶段最小二乘递推辨识

在有色噪声干扰系统中有一类系统, 它具有广义输出误差模型(OEARMA), 本文提出一类广义输出误差模型的 两阶段递推最小二乘参数估计算法. 该算法基本思想是结合辅助模型辨识思想和分解技术, 将系统分解成两个子系统, 每个子系统包含一个参数向量. 借助基于辅助模型和递推最小二乘理论, 用辅助模型的输出代替辨识模型信息向量中未 知中间变量, 用估计残差代替信息向量中不可测噪声项, 从而可以运用递推辨识思想来估计系统所有参数. 该算法具有 较高的计算效率, 仿真例子说明提出算法的有效性.     

Maximum likelihood based identification methods for rational models

ABSTRACT

In a rational model, some terms of the information vector are correlated with the noise, which makes the traditional least squares based iterative algorithms biased. In order to overcome this shortcoming, this paper develops two recursive algorithms for estimating the rational model parameters. These two algorithms, based on the maximum likelihood principle, have three integrated key features: (1) to establish two unbiased maximum likelihood recursive algorithms, (2) to develop a maximum likelihood recursive least squares (ML-RLS) algorithm to decrease the computational efforts, (3) to update the parameter estimates by the ML-RLS based particle swarm optimisation (ML-RLS-PSO) algorithm when the noise-to-output ratio is large. Comparative studies demonstrate that (1) the ML-RLS algorithm is only valid for rational models when the noise-to-output ratio is small, (2) the ML-RLS-PSO algorithm is effective for rational models with random noise-to-output ratio, but at the cost of heavy computational efforts. Furthermore, the simulations provide cases for potential expansion and applications of the proposed algorithms.     

Input–output data filtering based recursive least squares identification for CARARMA systems

This paper uses an estimated noise transfer function to filter the input–output data and presents filtering based recursive least squares algorithms (F-RLS) for controlled autoregressive autoregressive moving average (CARARMA) systems. Through the data filtering, we obtain two identification models, one including the parameters of the system model, and the other including the parameters of the noise model. Thus, the recursive least squares method can be used to estimate the parameters of these two identification models, respectively, by replacing the unmeasurable variables in the information vectors with their estimates. The proposed F-RLS algorithm has a high computational efficiency because the dimensions of its covariance matrices become small and can generate more accurate parameter estimation compared with other existing algorithms.     

衰减激励条件下递阶最小二乘辨识的均方收敛性

为减少递推辨识的计算量，提出了递阶辨识原理，它是将系统分解为多个维数较小的虚拟子系统进行辨识，从而获得递阶最小二乘辨识方法。在衰减激励条件下，针对时不变系统研究了递阶最小二乘法的收敛性，得到了参数估计误差均方收敛于零时衰减指数应满足的条件。递阶最小二乘具有良好的性能，其计算量比递推量小二乘辨识要小得多，并具有容易实现等优点。     

Iterative and recursive least squares estimation algorithms for moving average systems

An iterative least squares algorithm and a recursive least squares algorithms are developed for estimating the parameters of moving average systems. The key is use the least squares principle and to replace the unmeasurable noise terms in the information vector. The steps and flowcharts of computing the parameter estimates are given. The simulation results validate that the proposed algorithms can work well.     

Maximum likelihood least squares‐based iterative methods for output‐error bilinear‐parameter models with colored noises

This article is concerned with the parameter identification of output‐error bilinear‐parameter models with colored noises from measurement data. An auxiliary model least squares‐based iterative method is developed through the overparameterization model. It examines the difficulty of estimating the overparameterized vector, which usually presents a heavy computational burden in the identification process. To overcome this drawback, a parameter separation technique is introduced and the nonlinear model is reformulated as a refined identification model through eliminating the crossmultiplying terms. In this regard, a parameter separation least squares‐based iterative (PS‐LSI) algorithm is derived by avoiding estimating the redundant parameters. On the basis of the PS‐LSI algorithm, we derive a maximum likelihood least squares‐based iterative method to further improve the numerical accuracy. The identification is dependent on the formulation of a pseudolinear regression relationship, which contains two linear prefilters constructed from the system and noise models. The performance of this proposed method is confirmed by the numerical simulations as well as direct comparisons with other existing algorithms.     

有色噪声干扰下Hammerstein非线性系统两阶段辨识

针对实际工业过程中普遍存在有色噪声,提出了有色噪声干扰下Hammerstein非线性系统两阶段辨识方法。采用设计的组合式信号实现Hammerstein系统各模块参数辨识分离,简化了辨识过程。在第一阶段,基于可分离信号的输入输出数据,利用相关分析算法估计线性模块参数,减少了有色噪声对辨识的干扰。在第二阶段,基于随机信号的...     

Recursive identification for multivariate autoregressive equation-error systems with autoregressive noise

This paper considers the recursive identification problems for a class of multivariate autoregressive equation-error systems with autoregressive noise. By decomposing the system into several regressive identification subsystems, a maximum likelihood recursive generalised least squares identification algorithm is proposed to identify the parameter vectors in each subsystem. In addition, a multivariate recursive generalised least squares algorithm is derived as a comparison. The numerical simulation results indicate that the maximum likelihood recursive generalised least squares algorithm can effectively estimate the parameters of the multivariate autoregressive equation-error autoregressive systems and get more accurate parameter estimates than the multivariate recursive generalised least squares algorithm.     

Recursive least squares parameter identification algorithms for systems with colored noise using the filtering technique and the auxilary model

This paper focuses on the parameter estimation problems of output error autoregressive systems and output error autoregressive moving average systems (i.e., the Box–Jenkins systems). Two recursive least squares parameter estimation algorithms are proposed by using the data filtering technique and the auxiliary model identification idea. The key is to use a linear filter to filter the input–output data. The proposed algorithms can identify the parameters of the system models and the noise models interactively and can generate more accurate parameter estimates than the auxiliary model based recursive least squares algorithms. Two examples are given to test the proposed algorithms.     

A theoretical analysis of recursive identification methods

In this paper five different recursive identification methods will be analyzed and compared, namely recursive versions of the least squares method, the instrumental variable method, the generalized least squares method, the extended least squares method and the maximum likelihood method. They are shown to be similar in structure and need of computer storage and time. Making use of recently developed theory for asymptotic analysis of recursive stochastic algorithms, these methods are examined from a theoretical viewpoint. Possible convergence points and their global and local convergence properties are studied. The theoretical analysis is illustrated and supplemented by simulations.     

Global convergence of output error recursions in colored noise

This paper presents a variation on a known extended least-squares algorithm of the "output error" or "parallel model" type. Under reasonable conditions, the algorithms achieve global convergence of the one-step-ahead prediction error to the additive independent (possible colored) measurement noise. The convergence of the algorithms proposed is not critically sensitive to the color in the noise, as are related extended least-squares schemes, which require a simultaneous noise model identification. The algorithms are also simpler to implement than for the competing schemes. In the paper an add-on scheme is also studied which consists of additional processing of the prediction errors to achieve simultaneous noise model identification and improved prediction. Such a scheme is attractive from the computational cost point of view. Global convergence results are developed for the algorithms based on martingale convergence theorems as in earlier theories for extended least-squares schemes. The key contribution of the paper as far as the theory is concerned is to show how to cope with the colored noise in the martingale framework.