Computing GCRDs of approximate differential polynomials

DOI10.1145/2631948.2631964MaRDI QIDQ2819716zbMATH OpenOpenAlexFDO

Authors Joseph Haraldson, Mark Giesbrecht

Publication date 29 September 2016

Published in Proceedings of the 2014 Symposium on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1406.0907

zbMATH Keywords

approximate polynomialdifferential polynomialGCRDOre polynomialSVD

Mathematics Subject Classification ID

Differential algebra (12H05) Algorithms for approximation of functions (65D15) Symbolic computation and algebraic computation (68W30)

Abstract: Differential (Ore) type polynomials with approximate polynomial coefficients are introduced. These provide a useful representation of approximate differential operators with a strong algebraic structure, which has been used successfully in the exact, symbolic, setting. We then present an algorithm for the approximate Greatest Common Right Divisor (GCRD) of two approximate differential polynomials, which intuitively is the differential operator whose solutions are those common to the two inputs operators. More formally, given approximate differential polynomials $f$ and $g$, we show how to find "nearby" polynomials $widetildef$ and $widetildeg$ which have a non-trivial GCRD. Here "nearby" is under a suitably defined norm. The algorithm is a generalization of the SVD-based method of Corless et al. (1995) for the approximate GCD of regular polynomials. We work on an appropriately "linearized" differential Sylvester matrix, to which we apply a block SVD. The algorithm has been implemented in Maple and a demonstration of its robustness is presented.

Recommendations

• Computing approximate greatest common right divisors of differential polynomials
• Computation of approximate polynomial GCDs and an extension
• Certified approximate univariate GCDs
• An algorithm for computing certified approximate GCD of n univariate polynomials
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials

Cited in

(3)

• Computing lower rank approximations of matrix polynomials
• Computing approximate greatest common right divisors of differential polynomials
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Computing GCRDs of approximate differential polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819716)