Distributed iterate-collapse inversion (DICI) algorithm for L-banded matrices
Khan, U.A.; Moura, J.M.F.
Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on
Volume , Issue , March 31 2008-April 4 2008 Page(s):2529 - 2532
Digital Object Identifier   10.1109/ICASSP.2008.4518163
Summary:In this paper, we present a distributed algorithm to invert L-banded matrices that are symmetric positive definite (SPD), when the sub-matrices in the band are distributed among several processing nodes. We provide a distributed iterate-collapse inversion (DICI) algorithm that converges, at each node, to the corresponding submatrices in the inverse of the L-banded matrix. The computational complexity of the DICI algorithm to invert an SPD L-banded n x n matrix can be shown at each node to be independent of the size, n, of the matrix. Local information exchange is carried out after each iteration to guarantee convergence. We apply this algorithm to invert the information matrices in a computationally efficient distributed implementation of the Kalman filter and show its application towards inverting arbitrary sparse SPD matrices.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.