Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
From MaRDI portal
Publication:2819639
DOI10.1145/2331684.2331713zbMath1346.68302OpenAlexW2050180539MaRDI QIDQ2819639
Publication date: 29 September 2016
Published in: Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2331684.2331713
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05)