A survey on computational aspects of polynomial amoebas

From MaRDI portal
Revision as of 06:33, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6138131

DOI10.1007/S11786-023-00570-XarXiv2211.09416OpenAlexW4385305243MaRDI QIDQ6138131FDOQ6138131

V. A. Krasikov

Publication date: 5 September 2023

Published in: Mathematics in Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2211.09416





Cites Work







This page was built for publication: A survey on computational aspects of polynomial amoebas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138131)