ALGEBRAIC KERNEL FUNCTIONS AND REPRESENTATION OF PLANAR DOMAINS
نویسندگان
چکیده
منابع مشابه
Local Self-concordance of Barrier Functions Based on Kernel-functions
Many efficient interior-point methods (IPMs) are based on the use of a self-concordant barrier function for the domain of the problem that has to be solved. Recently, a wide class of new barrier functions has been introduced in which the functions are not self-concordant, but despite this fact give rise to efficient IPMs. Here, we introduce the notion of locally self-concordant barrier functio...
متن کاملAn invariance kernel representation of ISDS Lyapunov functions
We apply set valued analysis techniques in order to characterize the input–to–state dynamical stability (ISDS) property, a variant of the well known input–to–state stability (ISS) property. Using a suitable augmented differential inclusion we are able to characterize the epigraphs of minimal ISDS Lyapunov functions as invariance kernels. This characterization gives new insight into local ISDS p...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Algebraic Representation of Correlation Functions in Integrable Spin Chains
Taking the XXZ chain as the main example, we give a review of an algebraic representation of correlation functions in integrable spin chains obtained recently. We rewrite the previous formulas in a form which works equally well for the physically interesting homogeneous chains. We discuss also the case of quantum group invariant operators and generalization to the XYZ chain.
متن کاملPractical Distance Functions for Path-Planning in Planar Domains
Path planning is an important problem in robotics. One way to plan a path between two points x, y within a (not necessarily simply-connected) planar domain Ω, is to define a non-negative distance function d(x, y) on Ω × Ω such that following the (descending) gradient of this distance function traces such a path. This presents two equally important challenges: A mathematical challenge – to defin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Mathematical Society
سال: 2003
ISSN: 0304-9914
DOI: 10.4134/jkms.2003.40.3.447