Abstract
A new algorithm which solves a Toeplitz system having t unknowns with computational complexity of 0(t2) is proposed. The solving algorithm is based upon iterative solutions of Toeplitz systems for sub-Toeplitz-matrices of the given Toeplitz matrix and works well even when some of the sub-Toeplitz-matrices is singular. That is, the solving algorithm is a generalized version of the Levinson algorithm in the sense that its solving process is quite similar to that of the Levinson algorithm and it overcomes the defect which the Levinson algorithm possesses. We may expect that the accuracy of the new solving algorithm is superior to those of the Brent-Gustavson-Yun algorithm and the solving algorithm based upon Euclid algorithm, when the given Toeplitz matrix is a type of matrices such as a covariance matrix, since the former algorithm uses sub-Toeplitz-matrices and the latter algorithms use sub-Hankel-matrices.
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.
