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

Anything in here will be replaced on browsers that support the canvas element