منابع مشابه
Global minimization of rational functions and the nearest GCDs
This paper discusses the global minimization of rational functions with or without constraints. The sum of squares (SOS) relaxations are proposed to find the global minimum and minimizers. Some special features of the SOS relaxations are studied. As an application, we show how to find the nearest common divisors of polynomials via global minimization of rational functions. keywords: Rational fu...
متن کاملTowards an algebraic characterization of rational word functions
Introduction In formal language theory, several models characterize regular languages: finite au-tomata, congruences of finite index, monadic second-order logic (MSO), see e.g. [Büc60, Elg61, Tra61]. Further connections exist between monoid varieties and logical fragments of MSO, for instance aperiodic monoids have been shown to recognize exactly the word languages defined by first-order (FO) f...
متن کاملOn characterizations of the fully rational fuzzy choice functions
In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.
متن کاملNumerical solution of Troesch's problem using Christov rational functions
We present a collocation method to obtain the approximate solution of Troesch's problem which arises in the confinement of a plasma column by radiation pressure and applied physics. By using the Christov rational functions and collocation points, this method transforms Troesch's problem into a system of nonlinear algebraic equations. The rate of convergence is shown to be exponential. The numer...
متن کاملMinimization of Boolean Functions
This thesis presents two new methods of test-per-clock BIST design for combinational circuits. One of them is based on a transformation of the PRPG code words into test patterns generated by an ATPG tool. This transformation is done by a combinational circuit. For a design of such a circuit two major tasks have to be solved: first, the proper matching between the PRPG code words and the test pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1991
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0220042