DocumentCode :
1211836
Title :
Block matrices with L-block-banded inverse: inversion algorithms
Author :
Asif, Amir ; Moura, José M F
Author_Institution :
Dept. of Comput. Sci. & Eng., York Univ., Toronto, Ont., Canada
Volume :
53
Issue :
2
fYear :
2005
fDate :
2/1/2005 12:00:00 AM
Firstpage :
630
Lastpage :
642
Abstract :
Block-banded matrices generalize banded matrices. We study the properties of positive definite full matrices P whose inverses A are L-block-banded. We show that, for such matrices, the blocks in the L-block band of P completely determine P; namely, all blocks of P outside its L-block band are computed from the blocks in the L-block band of P. We derive fast inversion algorithms for P and its inverse A that, when compared to direct inversion, are faster by two orders of magnitude of the linear dimension of the constituent blocks. We apply these inversion algorithms to successfully develop fast approximations to Kalman-Bucy filters in applications with high dimensional states where the direct inversion of the covariance matrix is computationally unfeasible.
Keywords :
Kalman filters; covariance matrices; matrix inversion; signal processing; sparse matrices; L-block-banded inverse matrix; block-banded matrix; covariance matrix; filter; inversion algorithm; sparse matrix; Covariance matrix; Filters; Gaussian approximation; Gaussian processes; Matrix decomposition; Random processes; Signal processing; Signal processing algorithms; Sparse matrices; Symmetric matrices; Block-banded matrix; Cholesky decomposition; Gauss–Markov random process; Kalman–Bucy filter; covariance matrix; matrix inversion; sparse matrix;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2004.840709
Filename :
1381754
Link To Document :
بازگشت