An interval algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems ∗
نویسندگان
چکیده
The idea of Componentwise Newton Operator has been presented in [9]. It seems up to now not much attention has been paid to this concept. In this paper we present properties of the Componentwise Newton Operator and show how they can be used in numerical algorithms. It seems they are especially important when transforming the problem by some symbolic methods, based on the computation of Groebner bases. The resulting algorithm will be applied to a problem of optimizing control rules for a queueing system.
منابع مشابه
An Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems
متن کامل
A class of multi-agent discrete hybrid non linearizable systems: Optimal controller design based on quasi-Newton algorithm for a class of sign-undefinite hessian cost functions
In the present paper, a class of hybrid, nonlinear and non linearizable dynamic systems is considered. The noted dynamic system is generalized to a multi-agent configuration. The interaction of agents is presented based on graph theory and finally, an interaction tensor defines the multi-agent system in leader-follower consensus in order to design a desirable controller for the noted system. A...
متن کاملNumerical solution for the risk of transmission of some novel coronavirus (2019-nCov) models by the Newton-Taylor polynomial solutions
In this paper we consider two type of mathematical models for the novel coronavirus (2019-nCov), which are in the form of a nonlinear differential equations system. In the first model the contact rate, , and transition rate of symptomatic infected indeviduals to the quarantined infected class, , are constant. And in the second model these quantities are time dependent. These models are the...
متن کاملCombining Local Consistency, Symbolic Rewriting and Interval Methods
This paper is an attempt to address the processing of nonlinear numerical constraints over the Reals by combining three different methods: local consistency techniques, symbolic rewriting and interval methods. To formalize this combination, we define a generic two-step constraint processing technique based on an extension of the Constraint Satisfaction Problem, called Extended Constraint Satisf...
متن کاملCombining Local Consistency ,
This paper is an attempt to address the processing of non-linear numerical constraints over the Reals by combining three diierent methods: local consistency techniques, symbolic rewriting and interval methods. To formalize this combination, we deene a generic two-step constraint processing technique based on an extension of the Constraint Satisfaction Problem, called Extended Constraint Satisfa...
متن کامل