Robust estimation of GCD with sparse coefficients

DOI10.1016/j.sigpro.2009.09.024zbMath1177.94069OpenAlexW1973612721MaRDI QIDQ1046678

Efstratios Skafidas, Wanzhi Qiu

Publication date: 22 December 2009

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

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

zbMATH Keywords

subspacegreatest common divisor\(L^1\)-norm programming

Mathematics Subject Classification ID

Estimation and detection in stochastic control theory (93E10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

Computing sparse GCD of multivariate polynomials via polynomial interpolation

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• A subspace method for the computation of the GCD of polynomials
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Greatest common divisor via generalized Sylvester and Bezout matrices
• Sparse Image Reconstruction for Molecular Imaging

This page was built for publication: Robust estimation of GCD with sparse coefficients