Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

GCD of multivariate approximate polynomials using beautification with the subtractive algorithm

From MaRDI portal
Publication:2819632
Jump to:navigation, search

DOI10.1145/2331684.2331709zbMath1346.68279OpenAlexW2082035738MaRDI QIDQ2819632

Robert M. Corless, David R. Stoutemyer, Erik Postma

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.2331709


zbMATH Keywords

GCDpolynomial algorithmsapproximate polynomial


Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Polynomials, factorization in commutative rings (13P05) Numerical approximation and computational geometry (primarily algorithms) (65D99)



Uses Software

  • MultRoot






This page was built for publication: GCD of multivariate approximate polynomials using beautification with the subtractive algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2819632&oldid=15732182"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 18:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki