A review on computational aspects of polynomial amoebas

TL;DR

This paper reviews the computational methods, algorithms, and software tools for analyzing polynomial amoebas, highlighting their complexity and applications across scientific domains.

Contribution

It provides a comprehensive overview of algorithms and software for computing and visualizing polynomial amoebas, emphasizing recent advancements and performance comparisons.

Findings

Algorithms for computing amoebas are complex but effective.

Software packages vary in functionality and efficiency.

Computational methods enable practical applications of polynomial amoebas.

Abstract

We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a given polynomial and describing its properties is in general a problem of formidable complexity. We describe the main algorithms for computing and depicting the amoebas and geometrical objects associated with them, such as contours and spines. We review the latest software packages for computing the polynomial amoebas and compare their functionality and performance.