Abstract
Split algorithms for Toeplitz matrices exploit besides the Toeplitz structure additional symmetry properties to reduce the number of operations. In this paper split Levinson and Schur algorithms for hermitian Toeplitz matrices are presented that work, in contrast to previous algorithms, without additional conditions like strong nonsingularity. The main contribution is the generalization of the split Levinson-type algorithms of B. Krishna/H. Krishna and H. Krishna/S. Morgera to general nonsingular hermitian Toeplitz matrices. Furthermore, a Schur-type counterpart of this algorithm is presented that is also new in the strongly nonsingular case. Some auxiliary considerations concerning the kernel structure of hermitian Toeplitz matrices might be of independent interest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
