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

Authors:
Bingyu Li;Zhuojun Liu;Lihong Zhi
Affiliations:
School of Mathematics and Statistics, Northeast Normal University, Changchun 130024, China;Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Beijing 100080, China;Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Beijing 100080, China
Venue:
Signal Processing
Year:
2007

Citing 17
Cited 0

An indirect prediction error method for system identification

Automatica (Journal of IFAC)
Approximate GCD and its application to ill-conditioned algebraic equations

ISCM '90 Proceedings of the International Symposium on Computation mathematics
Displacement structure: theory and applications

SIAM Review
The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Total Least Norm Formulation and Solution for Structured Problems

SIAM Journal on Matrix Analysis and Applications
Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Common factor detection and estimation

Automatica (Journal of IFAC)
Detection and validation of clusters of polynomial zeros

Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
Polynomial remainder sequence and approximate GCD

ACM SIGSAM Bulletin
A Fast Stable Solver for Nonsymmetric Toeplitz and Quasi-Toeplitz Systems of Linear Equations

SIAM Journal on Matrix Analysis and Applications
When are two numerical polynomials relatively prime?

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Computation of approximate polynomial GCDs and an extension

Information and Computation
Common factor estimation and two applications in signal processing

Signal Processing - Special issue on independent components analysis and beyond
Approximate factorization of multivariate polynomials via differential equations

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
QR-factorization method for computing the greatest common divisorof polynomials with inexact coefficients

IEEE Transactions on Signal Processing
QR factoring to compute the GCD of univariate approximate polynomials

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

In this paper, we develop a fast structured total least squares (STLS) algorithm for computing an approximate greatest common divisor (GCD) of two univariate polynomials. By exploiting the displacement structure of the Sylvester matrix and applying the generalized Schur algorithm, each single iteration of the proposed algorithm has quadratic computational complexity in the degrees of the given polynomials.