A fast algorithm for solving the Sylvester structured total least squares problem
type: Item
instance of: scholarly article
title: A fast algorithm for solving the Sylvester structured total least squares problem
zbMATH Open document ID: 1186.94202
author: Bingyu Li
author: Lihong Zhi
author: Zhuojun Liu
published in: Signal Processing
publication date: 2010-05-19T00:00:00Z
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 5709422
zbMATH Keywords: approximate greatest common divisor
zbMATH Keywords: Sylvester matrix
zbMATH Keywords: structured total least squares
zbMATH Keywords: displacement structure
describes a project that uses: MultRoot
MaRDI profile type: Publication
full work available at URL: j.sigpro.2007.03.001
OpenAlex ID: W2093728760
DOI: 10.1016/J.SIGPRO.2007.03.001
Recommended article: A fast algorithm for solving regularized total least squares problems
Recommended article: New Fast Algorithms for Structured Linear Least Squares Problems
Recommended article: Fast algorithm for solving the Hankel/Toeplitz structured total least squares problem
Recommended article: Q4353207
Recommended article: Fast algorithms for the Sylvester equation \(AX-XB^{T}=C\)
Recommended article: Q4660801
Recommended article: Q4530424
Recommended article: The structured total least squares problem
Recommended article: Efficient Algorithms for Solution of Regularized Total Least Squares
Recommended article: An algorithm for solving sparse nonlinear least squares problems
description: scientific article; zbMATH DE number 5709422