By Topic

Fast positive definite linear system solvers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. H. Tewfik ; Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA ; M. Kim

The authors show that the M-band wavelet transforms of a wide class of covariance matrices consist of subblocks that are essentially banded. Furthermore, they prove that the Cholesky factors of the transformed covariance matrices also consist of subblocks that are essentially banded. They combine these two observations to construct a fast O(N2) algorithm for solving the N×N linear positive definite systems of equations that arise in statistical signal processing. Finally, they provide an error analysis of the proposed linear positive definite system solver

Published in:

IEEE Transactions on Signal Processing  (Volume:42 ,  Issue: 3 )