Abstract

We propose a new O( n 2) algorithm for solving complex n × n linear systems that have Hankel structure. Via FFTs the Hankel system is transformed into a Loewner system. An inversion formula enables us to calculate the inverse of the Loewner matrix explicitely. The parameters that occur in this inversion formula are calculated by solving two rational interpolation problems on the unit circle. We present an O( n 2) algorithm to solve these interpolation problems. One of the advantages of this algorithm is that it incorporates pivoting. We have implemented our Hankel solver in Fortran 90. Numerical examples are included. They show the effectiveness of our pivoting strategy.

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

Disclaimer: 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.