Variable projection methods for approximate GCD computations. This paper presents optimization methods and software for the approximate GCD problem of multiple univariate polynomials in the weighted 2-norm. Backward error minimization and Sylvester low-rank approximation formulations of the problem are solved by the variable projection method. Optimization methods are implemented in publicly available C++ software package with an interface to MATLAB. Results on computational complexity are presented.
Keywords for this software
References in zbMATH (referenced in 10 articles , 1 standard article )
Showing results 1 to 10 of 10.
- Condat, Laurent; Hirabayashi, Akira: Cadzow denoising upgraded: a new projection method for the recovery of Dirac pulses from noisy linear measurements (2015)
- Gillard, J.W.; Zhigljavsky, A.A.: Stochastic algorithms for solving structured low-rank matrix approximation problems (2015)
- Wang, Hongxing: Rank constrained matrix best approximation problem (2015)
- Ishteva, Mariya; Usevich, Konstantin; Markovsky, Ivan: Factorization approach to structured low-rank approximation with applications (2014)
- Markovsky, Ivan; Goos, Jan; Usevich, Konstantin; Pintelon, Rik: Realization and identification of autonomous linear periodically time-varying systems (2014)
- Usevich, Konstantin; Markovsky, Ivan: Variable projection for affinely structured low-rank approximation in weighted $2$-norms (2014)
- Usevich, Konstantin; Markovsky, Ivan: Optimization on a Grassmann manifold with application to system identification (2014)
- Markovsky, Ivan; Usevich, Konstantin: Structured low-rank approximation with missing data (2013)
- Markovsky, Ivan: Low rank approximation. Algorithms, implementation, applications (2012)
- Usevich, Konstantin; Markovsky, Ivan: Variable projection methods for approximate GCD computations (2012)