Beyond Polyhedral Homotopies

06/12/2017
by   Anton Leykin, et al.
0

We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring. This approach generalizes the polyhedral homotopies by Huber and Sturmfels.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2016

Some results on counting roots of polynomials and the Sylvester resultant

We present two results, the first on the distribution of the roots of a ...
research
11/16/2019

New Polynomial Preconditioned GMRES

A new polynomial preconditioner is given for solving large systems of li...
research
05/19/2022

Solving sparse polynomial systems using Groebner bases and resultants

Solving systems of polynomial equations is a central problem in nonlinea...
research
09/27/2022

Solving homogeneous linear equations over polynomial semirings

For a subset B of ℝ, denote by U(B) be the semiring of (univariate) poly...
research
11/26/2017

Algorithms for the solution of systems of linear equations in commutative ring

Solution methods for linear equation systems in a commutative ring are d...
research
11/28/2017

HomotopyContinuation.jl - a package for solving systems of polynomial equations in Julia

This paper is gives a short introduction into HomotopyContinuation.jl, a...
research
09/22/2020

On Approximating Polynomial-Quadratic Regulator Problems

Feedback control problems involving autonomous polynomial systems are pr...

Please sign up or login with your details

Forgot password? Click here to reset