On Algorithmic Estimation of Analytic Complexity for Polynomial Solutions to Hypergeometric Systems

07/18/2020
by   Vitaly A. Krasikov, et al.
0

The paper deals with the analytic complexity of solutions to bivariate holonomic hypergeometric systems of the Horn type. We obtain estimates on the analytic complexity of Puiseux polynomial solutions to the hypergeometric systems defined by zonotopes. We also propose algorithms of the analytic complexity estimation for polynomials.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2022

Analytic torsion for graphs

Analytic torsion is a functional on graphs which only needs linear algeb...
research
01/24/2019

Effective certification of approximate solutions to systems of equations involving analytic functions

We develop algorithms for certifying an approximation to a nonsingular s...
research
02/15/2021

"From What I see, this makes sense": Seeing meaning in algorithmic results

In this workshop paper, we use an empirical example from our ongoing fie...
research
06/28/2019

Solving Polynomial Systems with phcpy

The solutions of a system of polynomials in several variables are often ...
research
11/28/2022

Analytic Estimation of Region of Attraction of an LQR Controller for Torque Limited Simple Pendulum

Linear-quadratic regulators (LQR) are a well known and widely used tool ...

Please sign up or login with your details

Forgot password? Click here to reset