Abstract
We present a method for the multiplication of an arbitrary vector by a symmetric centrosymmetric matrix, requiring 5 4 n 2+ O(n) floating-point operations, rather than the 2n 2 operations needed in the case of an arbitrary matrix. Combining this method with Trench's algorithm for Toeplitz matrix inversion yields a method for solving Toeplitz systems with the same complexity as Levinson's algorithm.
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.
