Algorithmic computation of polynomial amoebas

04/12/2016
by   D. V. Bogdanov, et al.
0

We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2019

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems

Gröbner bases is one the most powerful tools in algorithmic non-linear a...
research
08/04/2023

Algorithmic computation of multivector inverses and characteristic polynomials in non-degenerate Clifford algebras

The power of Clifford or, geometric, algebra lies in its ability to repr...
research
10/08/2019

The conjugate gradient method with various viewpoints

Connections of the conjugate gradient (CG) method with other methods in ...
research
07/26/2017

An Invitation to Polynomiography via Exponential Series

The subject of Polynomiography deals with algorithmic visualization of p...
research
05/31/2021

Resultant-based Elimination in Ore Algebra

We consider resultant-based methods for elimination of indeterminates of...
research
12/18/2020

Analytic Integration of the Newton Potential over Cuboids and an Application to Fast Multipole Methods

We present simplified formulae for the analytic integration of the Newto...
research
06/17/2016

Computing all Space Curve Solutions of Polynomial Systems by Polyhedral Methods

A polyhedral method to solve a system of polynomial equations exploits i...

Please sign up or login with your details

Forgot password? Click here to reset