Univariate polynomial root-finding by arming with constraints
From MaRDI portal
Publication:2819625
DOI10.1145/2331684.2331702zbMath1345.65033OpenAlexW2089648692MaRDI QIDQ2819625
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.2331702
convolutioncomputations on polynomialsSylvester matricesPFDarming with constraintscomputations on matricespolynomial root-finding and factorization
Numerical computation of solutions to systems of equations (65H10) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Numerical computation of roots of polynomial equations (65H04)
Related Items