Variable projection methods for approximate GCD computations

Authors:
Konstantin Usevich;Ivan Markovsky
Affiliations:
University of Southampton, Southampton, UK;University of Southampton, Southampton, UK
Venue:
ACM Communications in Computer Algebra
Year:
2013

Citing 4
Cited 0

Optimization strategies for the approximate GCD problem

ISSAC '98 Proceedings of the 1998 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
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A subdivision method for computing nearest gcd with certification

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.