Abstract
We study the structured total least squares (STLS) problem of system of linear equations Ax = b, where A has a block circulant structure with N blocks. We show that by applying the discrete Fourier transform (DFT), the STLS problem decomposes into Nunstructured total least squares (TLS) problems. The N solutions of these problems are then assembled to generate the optimal global solution of the STLS problem. Similar results are obtained for elementary block circulant matrices. Here the optimal solution is obtained by assembling two solutions: one of an unstructured TLS problem and the second of a multidimensional TLS problem.
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.
