Computing GCRDs of approximate differential polynomials
From MaRDI portal
Publication:2819716
DOI10.1145/2631948.2631964zbMath1345.68283arXiv1406.0907OpenAlexW2073762939MaRDI QIDQ2819716
Joseph Haraldson, Mark W. 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ Computing nearby non-trivial Smith forms ⋮ Computing lower rank approximations of matrix polynomials ⋮ Computing approximate greatest common right divisors of differential polynomials
Uses Software
This page was built for publication: Computing GCRDs of approximate differential polynomials
