Generalized Chandrasekhar recursions from the generalized Schur algorithm

Abstract
We present a new approach to the Chandrasekhar recursionsand some generalizations thereof. The derivation uses thegeneralized Schur recursions, which are O(N2) recursions forthe triangular factorization of N \Theta N matrices having a certainToeplitz-like displacement structure. It is shown thatwhen the extra structure provided by an underlying statespacemodel is properly incorporated into the generalizedSchur algorithm, it reduces to the Chandrasekhar recursions,which are O(Nn2...

This publication has 19 references indexed in Scilit: