Algorithmic computation of polynomial amoebas

7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present algorithms for computation and visualization of polynomial amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide a method and an algorithm for the computation of polynomials whose amoebas exhibit the most complicated topology among all polynomials with a fixed Newton polytope. The presented algorithms are implemented in computer algebra systems Matlab 8 and Mathematica 9.

Cite

CITATION STYLE

APA

Bogdanov, D. V., Kytmanov, A. A., & Sadykov, T. M. (2016). Algorithmic computation of polynomial amoebas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9890 LNCS, pp. 87–100). Springer Verlag. https://doi.org/10.1007/978-3-319-45641-6_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free