Fast Toeplitz Orthogonalization Using Inner Products
George V. Cybenko · SIAM Journal on Scientific and Statistical Computing · 1987
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
SIAM Journal on Scientific and Statistical Computing · Society for Industrial and Applied Mathematics · article · 1987
Abstract
A new method for the orthogonalization of complex m by n Toeplitz matrices of full rank is presented. An inverse $QR$ factorization is computed in $9mn + (27/2)n^2 $ multiplications and divisions. This method uses inner products and projections in the same spirit as lattice algorithms for linear prediction do.
Open the resolved locator · 10.1137/0908063
Metadata licence: OpenAlex metadata (CC0)