A fast algorithm for solving the Sylvester structured total least squares problem

DOI10.1016/j.sigpro.2007.03.001zbMath1186.94202OpenAlexW2093728760MaRDI QIDQ971002

Bingyu Li, Lihong Zhi, Zhuo-Jun Liu

Publication date: 19 May 2010

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2007.03.001

zbMATH Keywords

displacement structureSylvester matrixstructured total least squaresapproximate greatest common divisor

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

An ODE-based method for computing the approximate greatest common divisor of polynomials

Uses Software

• MultRoot

This page was built for publication: A fast algorithm for solving the Sylvester structured total least squares problem