The Solution of a Special Set of Hermitian Toeplitz Linear Equations
暂无分享,去创建一个
Abstract : The solution of a set of m linear equations L sub m s sub m = d sub m, where L sub m is an mth order Hermitian Toeplitz matrix and the elements of d sub m possess a Hermitian symmetry, is considered. A specialized algorithm is developed for this case which solves for s sub m in about 1.5 m square operations, whereas the Hermitian case of an algorithm developed by Zohar solves for s sub m in approximately 2 m square operations. An operation is used here to denote one addition and one multiplication. A further reduction in computational requirements is shown in case L sub m and d sub m are real. As with Zohar's algorithm, the specialized algorithm requires that all principal minors of L sub m be nonzero.
[1] Shalhav Zohar,et al. The Solution of a Toeplitz Set of Linear Equations , 1974, JACM.
[2] W. F. Trench. An Algorithm for the Inversion of Finite Toeplitz Matrices , 1964 .
[3] P. Butler. Comments on "Statistical design of nonrecursive digital filters , 1975 .
[4] Shalhav Zohar,et al. Toeplitz Matrix Inversion: The Algorithm of W. F. Trench , 1969, JACM.
[5] D. Farden,et al. Statistical design of nonrecursive digital filters , 1974 .