The optimal robust finite-horizon Kalman filtering for multiple sensors with different stochastic failure rates

This work deals with the filtering problem for norm-bounded uncertain discrete dynamic systems with multiple sensors having different stochastic failure rates. For tackling the uncertainties of the covariance matrices of state and state estimation error simultaneously, their upper bounds containing a scaling parameter are derived, and then a robust finite-horizon filtering minimizing the upper bound of the estimation error covariance is proposed. Furthermore, an optimal scaling parameter is exploited to reduce the conservativeness of the upper bounds of the state and estimation error covariances, which leads to an optimal robust filtering for all possible missing measurements and all admissible parameter uncertainties. A numerical example illustrates the performance improvement over the traditional Kalman filtering method.     

误差服从多元t分布的一类线性模型下参数估计的若干注记

研究一类线性模型下参数估计的若干问题．这类模型包含了多个因变量线性模型、增长曲线模型、扩充的增长曲线模型、似乎不相关回归方程组、方差分量模型等常用模型．在这类线性模型下,证明了当误差服从多元t分布时与误差服从多元正态分布时,具有相同的完全统计量和无偏估计,且在后一种情况下的充分统计量必为前一种情况下的充分统计量．对于带有多种协方差结构的前述几种模型,把在误差服从多元正态分布下,相应的协方差阵及有关参数的一致最小风险无偏(UMRU)估计存在性的结论推广到了相应的误差服从多元t分布情形．此外,对于误差服从多元t分布的这类统一的线性模型,给出了回归系数的线性可估函数的无偏估计的协方差阵的C-R下界．     

Estimation of systems with statistically-constrained inputs

This paper discusses the estimation of a class of discrete-time linear stochastic systems with statistically-constrained unknown inputs (UI), which can represent an arbitrary combination of a class of un-modeled dynamics, random UI with unknown covariance matrix and deterministic UI. In filter design, an upper bound filter is explored to compute, recursively and adaptively, the upper bounds of covariance matrices of the state prediction error, innovation and state estimate error. Furthermore, the minimum upper bound filter (MUBF) is obtained via online scalar parameter convex optimization in pursuit of the minimum upper bounds. Two examples, a system with multiple piecewise UIs and a continuous stirred tank reactor (CSTR), are used to illustrate the proposed MUBF scheme and verify its performance.     

Estimation from a multisensor environment for systems with multiple packet dropouts and correlated measurement noises

This paper addresses the problem of distributed fusion estimation from measurements with packet dropouts and cross-correlated noises acquired from different sensors. Assuming that the packet dropouts are modelled by independent Bernoulli random variables with different characteristics for each sensor and that measurement noises are cross-correlated at the same and at consecutive sampling times, filtering and smoothing algorithms are derived using the distributed fusion method. The distributed fusion filter and smoother are obtained as a matrix-weighted linear combination of corresponding local least-squares linear estimators, verifying that the mean squared error is minimum. The local linear filtering and fixed-point smoothing algorithms are derived using the first and second-order moments of the signal and the noises present in the observation model. Simulation results are provided to illustrate the feasibility of the proposed algorithms, using the error estimation covariance matrices as measure of the quality of the estimators.     

Effect of numerical integration for elliptic obstacle problems

Summary. An elliptic obstacle problem is approximated by piecewise linear finite elements with numerical integration on the penalty and forcing terms. This leads to diagonal nonlinearities and thereby to a practical scheme. Optimal error estimates in the maximum norm are derived. The proof is based on constructing suitable super and subsolutions that exploit the special structure of the penalization, and using quite precise pointwise error estimates for an associated linear elliptic problem with quadrature via the discrete maximum principle. Received March 19, 1993     

Numerical Methods for Parameter Estimation Using Krylov-Type Techniques

In the paper we consider constrained nonlinear parameter estimation problems. The method of choice to solve such problems is the generalized Gauss-Newton method. At each iteration of the Gauss-Newton we solve the linearized parameter estimation problem and compute covariance matrix, necessary for the error assessment of the estimates, using an iterative linear algebra technique, namely LSQR algorithm. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Adaptive estimation of linear functionals in functional linear models

We consider the estimation of the value of a linear functional of the slope parameter in functional linear regression, where scalar responses are modeled in dependence of randomfunctions. In Johannes and Schenk [2010] it has been shown that a plug-in estimator based on dimension reduction and additional thresholding can attain minimax optimal rates of convergence up to a constant. However, this estimation procedure requires an optimal choice of a tuning parameter with regard to certain characteristics of the slope function and the covariance operator associated with the functional regressor. As these are unknown in practice, we investigate a fully data-driven choice of the tuning parameter based on a combination of model selection and Lepski??s method, which is inspired by the recent work of Goldenshluger and Lepski [2011]. The tuning parameter is selected as theminimizer of a stochastic penalized contrast function imitating Lepski??smethod among a random collection of admissible values. We show that this adaptive procedure attains the lower bound for the minimax risk up to a logarithmic factor over a wide range of classes of slope functions and covariance operators. In particular, our theory covers pointwise estimation as well as the estimation of local averages of the slope parameter.     

Investigation of the effect of the measurement with the abrupt noise and the number of approximated terms in conductional boundary estimation problem

A direct error vector analysis of inverse heat conduction problem is presented to detect the measured noise. Based on the reverse matrix approach that the inverse problem is solved directly in a linear domain, and the error vector is formulated from the difference between the measured temperature and the estimated temperature. There is no prior knowledge on the exact solution while the error vector is constructed. The error vector is used to investigate the consistence of the measured data in the domain and lead to detect the noise data. Furthermore, the proper number of the undetermined variable is able to suggest based on the mean value of the error vector and the value of the condition number of the reverse matrix. In the first example, a test problem with the measurement noise is presented. The estimated result is influent by the noise globally. The result shows that the value of error vector is changed significantly at the coordinate of the measurement noise appeared. In other words, the error vector analysis is able to identify the noise data. In the second example, the proper number of series expansion terms is investigated. From the result, it shows that the number of expansion terms with the small mean value and condition number can better approximate to the unknown condition. It means that the proposed method is able to suggest a proper number of expansion terms when the function of the recovered boundary is unknown.     

High-Dimensional Covariance Matrix Estimation Based on Network

A new method for estimating high-dimensional covariance matrix based on network structure with heteroscedasticity of response variables is proposed in this paper. This method greatly reduces the computational complexity by transforming the high-dimensional covariance matrix estimation problem into a low-dimensional linear regression problem. Even if the size of sample is finite, the estimation method is still effective. The error of estimation will decrease with the increase of matrix dimension. In addition, this paper presents a method of identifying influential nodes in network via covariance matrix. This method is very suitable for academic cooperation networks by taking into account both the contribution of the node itself and the impact of the node on other nodes.     

相关噪声下多步无序量测状态估计更新算法

在多传感器系统中,由于通信时间的延迟性,常常会出现无序量测情况.为了提高估计精度,系统须对无序量测进行更新估计.状态估计更新算法是处理无序量测问题的一种有效方法.在过程噪声和量测噪声相关条件下,给出了含无序量测的传感器系统状态估计更新算法.仿真计算验证了该算法的有效性.     

A well-conditioned estimator for large-dimensional covariance matrices

Many applied problems require a covariance matrix estimator that is not only invertible, but also well-conditioned (that is, inverting it does not amplify estimation error). For large-dimensional covariance matrices, the usual estimator—the sample covariance matrix—is typically not well-conditioned and may not even be invertible. This paper introduces an estimator that is both well-conditioned and more accurate than the sample covariance matrix asymptotically. This estimator is distribution-free and has a simple explicit formula that is easy to compute and interpret. It is the asymptotically optimal convex linear combination of the sample covariance matrix with the identity matrix. Optimality is meant with respect to a quadratic loss function, asymptotically as the number of observations and the number of variables go to infinity together. Extensive Monte Carlo confirm that the asymptotic results tend to hold well in finite sample.     

漂移向量与扩散矩阵的非参数估计模型

考虑多维扩散过程的非参数估计问题.利用It扩散的性质,将漂移向量和扩散矩阵的样本表示成带有测量误差的回归模型,并讨论了系统误差的L~r上界以及随机误差项的收敛速度,建立了漂移向量与扩散矩阵非参数估计的通用模型.     

On the identifiability of measurement error in the bifurcating autoregressive model

Huggins and Staudte (1994) considered a mixed linear model for the analysis of cell lineage data and in models for the covariance structure which involved measurement error, it was not immediately clear that the parameters involved were identifiable. Whilst a numerical examination of the Hessian matrix at the estimated parameter values gave some reassurance, this was not theoretically satisfying. Here a matrix formulation of the robust estimating functions of Huggins (1993a, b) as applied in Huggins and Staudte (1994), which include the maximum likelihood estimating functions under the assumption of multivariate normality as a special case, is given along with a direct proof linking identifiability expressed in terms of the estimating functions with the information matrix or its analogue in more general settings. The resulting conditions on the estimating functions may then be checked globally using computer algebra, suggesting a method for establishing identifiability in mixed linear models in general.     

A note on improving quadratic inference functions using a linear shrinkage approach

In some commonly used longitudinal clinical trials designs, the quadratic inference functions (QIF) method fails to work due to non-invertible estimation of the optimal weighting matrix. We propose a modified QIF method, in which the optimal weighting matrix is estimated by a linear shrinkage estimator, replacing the sample covariance matrix. We prove that the linear shrinkage estimator is consistent and asymptotically optimal under the expected quadratic loss, and will have more stable numerical performance than the sample covariance matrix. Simulations show that numerical improvements are acquired in light of a higher percentage of convergence, and smaller standard errors and mean square errors of parameter estimates.     

Convergence and Error Bound for Perturbation of Linear Programs

In various penalty/smoothing approaches to solving a linear program, one regularizes the problem by adding to the linear cost function a separable nonlinear function multiplied by a small positive parameter. Popular choices of this nonlinear function include the quadratic function, the logarithm function, and the x ln(x)-entropy function. Furthermore, the solutions generated by such approaches may satisfy the linear constraints only inexactly and thus are optimal solutions of the regularized problem with a perturbed right-hand side. We give a general condition for such an optimal solution to converge to an optimal solution of the original problem as the perturbation parameter tends to zero. In the case where the nonlinear function is strictly convex, we further derive a local (error) bound on the distance from such an optimal solution to the limiting optimal solution of the original problem, expressed in terms of the perturbation parameter.     

State estimation of memristor‐based recurrent neural networks with time‐varying delays based on passivity theory

This article deals with the state estimation problem of memristor‐based recurrent neural networks (MRNNs) with time‐varying delay based on passivity theory. The main purpose is to estimate the neuron states, through available output measurements such that for all admissible time delay, the dynamics of the estimation error is passive from the control input to the output error. Based on the Lyapunov–Krasovskii functional (LKF) involving proper triple integral terms, convex combination technique, and reciprocal convex technique, a delay‐dependent state estimation of MRNNs with time‐varying delay is established in terms of linear matrix inequalities (LMIs). The information about the neuron activation functions and lower bound of the time‐varying delays is fully used in the LKF. Then, the desired estimator gain matrix is accomplished by solving LMIs. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed theoretical results. © 2013 Wiley Periodicals, Inc. Complexity 19: 32–43, 2014     

线性对流占优扩散方程的后验误差估计

对于线性对流占优扩散方程,采用特征线有限元方法离散时间导数项和对流项,用分片线性有限元离散空间扩散项,并给出了一致的后验误差估计,其中估计常数不依赖与扩散项系数。     

An algebraic study of BLUPs under two linear random-effects models with correlated covariance matrices

Assume that a pair of general Linear Random-effects Models (LRMs) are given with a correlated covariance matrix for their error terms. This paper presents an algebraic approach to the statistical analysis and inference of the two correlated LRMs using some state-of-the-art formulas in linear algebra and matrix theory. It is shown first that the best linear unbiased predictors (BLUPs) of all unknown parameters under LRMs can be determined by certain linear matrix equations, and thus the BLUPs under the two LRMs can be obtained in exact algebraic expressions. We also discuss algebraical and statistical properties of the BLUPs, as well as some additive decompositions of the BLUPs. In particular, we present necessary and sufficient conditions for the separated and simultaneous BLUPs to be equivalent. The whole work provides direct access to a very simple algebraic treatment of predictors/estimators under two LRMs with correlated covariance matrices.     

Semidiscretization and error estimates for distributed control of the instationary Navier-Stokes equations

Summary. Optimal control problems governed by the two-dimensional instationary Navier–Stokes equations and their spatial discretizations with finite elements are investigated. A concept of semi–discrete solutions to the control problem is introduced which is utilized to prove existence and uniqueness of discrete controls in neighborhoods of regular continuous solutions. Furthermore, an optimal error estimate in terms of the spatial discretization parameter is given.Correspondence to: M. Hinze     

Divergence-free wavelet solution to the Stokes problem

In this paper, we use divergence-free wavelets to give an adaptive solution to the velocity field of the Stokes problem. We first use divergence-free wavelets to discretize the divergence-free weak formulation of the Stokes problem and obtain a discrete positive definite linear system of equations whose coefficient matrix is quasi-sparse; Secondly, an adaptive scheme is used to solve the discrete linear system of equations and the error estimation and complexity analysis are given.