An ODE-based method for computing the approximate greatest common divisor of polynomials
- 4 July 2018
- journal article
- research article
- Published by Springer Nature in Numerical Algorithms
- Vol. 81 (2) , 719-740
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A Quadratically Convergent Algorithm for Structured Low-Rank ApproximationFoundations of Computational Mathematics, 2015
- Variable projection for affinely structured low-rank approximation in weighted -normsJournal of Computational and Applied Mathematics, 2014
- Software for weighted structured low-rank approximationJournal of Computational and Applied Mathematics, 2014
- Structured Matrix Based Methods for Approximate Polynomial GCD2011
- A Fast Algorithm for Approximate Polynomial GCD Based on Structured Matrix Computations2010
- Structured low-rank approximation and its applicationsAutomatica, 2008
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximationComputers & Mathematics with Applications, 2006
- Computation of Approximate Polynomial GCDs and an ExtensionInformation and Computation, 2001
- When are Two Numerical Polynomials Relatively Prime?Journal of Symbolic Computation, 1998
- On Approximate GCDs of Univariate PolynomialsJournal of Symbolic Computation, 1998