Determining the Upper Bound of the Spectral Norm of a Random Matrix and Its Application to Diagnosis of the Kalman Filter

Author： Gadzhiev C. M.  

Publisher： Springer Publishing Company

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.40, Iss.2, 2004-03, pp. : 208-214

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse

By Rump Siegfried  

Bit Numerical Mathematics, Vol. 51, Iss. 2, 2011-06 ,pp. : 367-384

Springer Publishing Company

Access to resources Recommend Favorite

An Upper Bound for the Expected Range of a Random Sample

By Lopez Manuel   Marengo James  

The College Mathematics Journal, Vol. 41, Iss. 1, 2010-01 ,pp. : 42-48

Mathematical Association of America

Access to resources Recommend Favorite

Windowing and random weighting‐based adaptive unscented Kalman filter

By  

INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, Vol. 29, Iss. 2, 2015-02 ,pp. : 201-223

John Wiley & Sons Inc

Access to resources Recommend Favorite

A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae

By Dubois O.   Boufkhad Y.  

Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. : 395-420

Academic Press

Access to resources Recommend Favorite

Newton’s Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound

By Li Qingna   Li Donghui   Qi Houduo  

Journal of Optimization Theory and Applications, Vol. 147, Iss. 3, 2010-12 ,pp. : 546-568

Springer Publishing Company

Access to resources Recommend Favorite