An LMI-based approach for characterizing the solution set of polynomial systems

2002 ◽  
Author(s):  
G. Chesi ◽  
A. Garulli ◽  
A. Tesi ◽  
A. Vicino
Keyword(s):  
Polynomial Systems ◽  
Solution Set

scholarly journals Solving polynomial systems via homotopy continuation and monodromy

2018 ◽  
Vol 39 (3) ◽  
pp. 1421-1446 ◽  
Author(s):  
Timothy Duff ◽  
Cvetelina Hill ◽  
Anders Jensen ◽  
Kisun Lee ◽  
Anton Leykin ◽  
...  
Keyword(s):  
State Of The Art ◽  
Polynomial Systems ◽  
Solution Set ◽  
Software Implementation ◽  
Homotopy Continuation ◽  
Expected Number ◽  
Number Of Solutions ◽  
Study Methods ◽  
Software Packages ◽  
Generic System

Abstract We study methods for finding the solution set of a generic system in a family of polynomial systems with parametric coefficients. We present a framework for describing monodromy-based solvers in terms of decorated graphs. Under the theoretical . that monodromy actions are generated uniformly, we show that the expected number of homotopy paths tracked by an algorithm following this framework is linear in the number of solutions. We demonstrate that our software implementation is competitive with the existing state-of-the-art methods implemented in other software packages.

The Convex Polytopes and Homogeneous Coordinate Rings of Bivariate Polynomials

2019 ◽  
Vol 16 (2) ◽  
pp. 1
Author(s):  
Shamsatun Nahar Ahmad ◽  
Nor’Aini Aris ◽  
Azlina Jumadi
Keyword(s):  
Convex Polytopes ◽  
Polynomial Systems ◽  
Matrix Formulation ◽  
Bivariate Polynomials ◽  
Homogeneous Coordinates ◽  
The Matrix ◽  
Projective Vector ◽  
Coordinate Rings ◽  
Resultant Matrix ◽  
The Given

Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of a certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the entries of the Bèzout block. Conditions for determining the homogeneous coordinates are also given and proven.

scholarly journals Multi-Objective Whale Optimization Algorithm for Computation Offloading Optimization in Mobile Edge Computing

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2628
Author(s):  
Mengxing Huang ◽  
Qianhao Zhai ◽  
Yinjie Chen ◽  
Siling Feng ◽  
Feng Shu
Keyword(s):  
Optimization Algorithm ◽  
Edge Computing ◽  
Solution Set ◽  
Whale Optimization Algorithm ◽  
Computation Offloading ◽  
Mobile Edge Computing ◽  
Multi Objective ◽  
Whale Optimization ◽  
Artificial Immune System Algorithm

Computation offloading is one of the most important problems in edge computing. Devices can transmit computation tasks to servers to be executed through computation offloading. However, not all the computation tasks can be offloaded to servers with the limitation of network conditions. Therefore, it is very important to decide quickly how many tasks should be executed on servers and how many should be executed locally. Only computation tasks that are properly offloaded can improve the Quality of Service (QoS). Some existing methods only focus on a single objection, and of the others some have high computational complexity. There still have no method that could balance the targets and complexity for universal application. In this study, a Multi-Objective Whale Optimization Algorithm (MOWOA) based on time and energy consumption is proposed to solve the optimal offloading mechanism of computation offloading in mobile edge computing. It is the first time that MOWOA has been applied in this area. For improving the quality of the solution set, crowding degrees are introduced and all solutions are sorted by crowding degrees. Additionally, an improved MOWOA (MOWOA2) by using the gravity reference point method is proposed to obtain better diversity of the solution set. Compared with some typical approaches, such as the Grid-Based Evolutionary Algorithm (GrEA), Cluster-Gradient-based Artificial Immune System Algorithm (CGbAIS), Non-dominated Sorting Genetic Algorithm III (NSGA-III), etc., the MOWOA2 performs better in terms of the quality of the final solutions.

Nonlocal fractional semilinear differential inclusions with noninstantaneous impulses and of order α ∈ (1, 2)

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
JinRong Wang ◽  
Ahmed G. Ibrahim ◽  
Donal O’Regan ◽  
Adel A. Elmandouh
Keyword(s):  
Differential Inclusions ◽  
Mild Solutions ◽  
Multivalued Function ◽  
Linear Operators ◽  
Solution Set ◽  
Cosine Family ◽  
Bounded Linear Operators ◽  
Bounded Linear ◽  
Noninstantaneous Impulses

AbstractIn this paper, we establish the existence of mild solutions for nonlocal fractional semilinear differential inclusions with noninstantaneous impulses of order α ∈ (1,2) and generated by a cosine family of bounded linear operators. Moreover, we show the compactness of the solution set. We consider both the case when the values of the multivalued function are convex and nonconvex. Examples are given to illustrate the theory.

scholarly journals On the first fall degree of summation polynomials

2019 ◽  
Vol 13 (3-4) ◽  
pp. 229-237
Author(s):  
Stavros Kousidis ◽  
Andreas Wiemers
Keyword(s):  
Elliptic Curve ◽  
Gröbner Basis ◽  
Discrete Logarithm ◽  
Polynomial Systems ◽  
Discrete Logarithm Problem ◽  
Grobner Basis ◽  
Weil Descent ◽  
Degree Bound

Abstract We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.

Sign in / Sign up

Export Citation Format

Share Document