Abstract

Algorithms are obtained for solving Hankel systems of order n=2 l , requiring 5 n log 2 2 n multiplications and 10 n log 2 2 n additions. An algorithm of similar complexity is constructed for Toeplitz systems. The sole condition imposed on the initial matrices is that all leading submatrices be non-singular. The algorithms are easily adapted to the case of block matrices.

Full Text
Published version (Free)

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 call