scholarly journals Quasi-exact solvability in a general polynomial setting

2007 ◽  
Vol 23 (5) ◽  
pp. 1915-1942 ◽  
Author(s):  
D Gómez-Ullate ◽  
N Kamran ◽  
R Milson
Keyword(s):  
Exact Solvability ◽  
General Polynomial

scholarly journals Iterative stability analysis for general polynomial control systems

2021 ◽  
Author(s):  
Bo Xiao ◽  
Hak-Keung Lam ◽  
Zhixiong Zhong
Keyword(s):  
Stability Analysis ◽  
Lyapunov Function ◽  
Control Systems ◽  
Polynomial System ◽  
Stability Conditions ◽  
General Polynomial ◽  
Main Challenge ◽  
Detailed Simulation ◽  
Feasible Solutions ◽  
The Stability

AbstractThe main challenge of the stability analysis for general polynomial control systems is that non-convex terms exist in the stability conditions, which hinders solving the stability conditions numerically. Most approaches in the literature impose constraints on the Lyapunov function candidates or the non-convex related terms to circumvent this problem. Motivated by this difficulty, in this paper, we confront the non-convex problem directly and present an iterative stability analysis to address the long-standing problem in general polynomial control systems. Different from the existing methods, no constraints are imposed on the polynomial Lyapunov function candidates. Therefore, the limitations on the Lyapunov function candidate and non-convex terms are eliminated from the proposed analysis, which makes the proposed method more general than the state-of-the-art. In the proposed approach, the stability for the general polynomial model is analyzed and the original non-convex stability conditions are developed. To solve the non-convex stability conditions through the sum-of-squares programming, the iterative stability analysis is presented. The feasible solutions are verified by the original non-convex stability conditions to guarantee the asymptotic stability of the general polynomial system. The detailed simulation example is provided to verify the effectiveness of the proposed approach. The simulation results show that the proposed approach is more capable to find feasible solutions for the general polynomial control systems when compared with the existing ones.

scholarly journals Constructions of general polynomial lattice rules based on the weighted star discrepancy

2007 ◽  
Vol 13 (4) ◽  
pp. 1045-1070 ◽  
Author(s):  
Josef Dick ◽  
Peter Kritzer ◽  
Gunther Leobacher ◽  
Friedrich Pillichshammer
Keyword(s):  
Lattice Rules ◽  
General Polynomial ◽  
Star Discrepancy

scholarly journals The radiation instability in modified gravity

2021 ◽  
Vol 36 (08n09) ◽  
pp. 2150060
Author(s):  
Spiros Cotsakis ◽  
Dimitrios Trachilis
Keyword(s):  
General Relativity ◽  
General Solution ◽  
Modified Gravity ◽  
Evolution Equations ◽  
Formal Series ◽  
Series Expansions ◽  
General Polynomial ◽  
Theories Of Gravity ◽  
Polynomial Extensions

We study the problem of the instability of inhomogeneous radiation universes in quadratic Lagrangian theories of gravity written as a system of evolution equations with constraints. We construct formal series expansions and show that the resulting solutions have a smaller number of arbitrary functions than that required in a general solution. These results continue to hold for more general polynomial extensions of general relativity.

scholarly journals Reconstruction of score sets

2014 ◽  
Vol 6 (2) ◽  
pp. 210-229
Author(s):  
Antal Iványi
Keyword(s):  
Polynomial Time ◽  
Constructive Proof ◽  
Construction Algorithm ◽  
Polynomial Time Algorithms ◽  
General Polynomial ◽  
Degree Set ◽  
New Algorithms

Abstract The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] published the conjecture that for any set of nonnegative integers D there exists a tournament T whose degree set is D. Reid proved the conjecture for tournaments containing n = 1, 2, and 3 vertices. In 1986 Hager [4] published a constructive proof of the conjecture for n = 4 and 5 vertices. In 1989 Yao [18] presented an arithmetical proof of the conjecture, but general polynomial construction algorithm is not known. In [6] we described polynomial time algorithms which reconstruct the score sets containing only elements less than 7. In [5] we improved this bound to 9. In this paper we present and analyze new algorithms Hole-Map, Hole-Pairs, Hole-Max, Hole-Shift, Fill-All, Prefix-Deletion, and using them improve the above bound to 12, giving a constructive partial proof of Reid’s conjecture.

Sign in / Sign up

Export Citation Format

Share Document