Efficient computation of tr{TR-1} for Toeplitz matrices.

Efficient computation of tr{TR-1} for Toeplitz matrices.

An efficient algorithm for the computation of tr{TR-1}, where T and R are Toeplitz matrices and R is also symmetric positive definite, is presented. The method exploits the fact that the trace of TR-1 depends only on the sum of the diagonals of R-1 , and not on the whole matrix R-1. To obtain this s...

Full beskrivning

Bibliografiska uppgifter
I publikationen:IEEE Signal processing letters 9, 2 (2002).
Huvudupphovsman: Dias, J.M.B
Materialtyp: Artikel
Språk:English
Ämnen:
Toeplitz matrices.
Trench algorithm.
Algorithm complexity.
Autoregressive processes.
Diagonal sum.
Efficient computation.
Generic functions.
Inverse Toeplitz matrix.
Signal processing.
Symmetric positive definite matrix.