SOME FURTHER GROWTH AND DECAY RESULTS IN LINEAR THERMOELASTODYNAMICS
نویسندگان
چکیده
منابع مشابه
Further results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملSome Duality Results in Grey Linear Programming Problem
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
متن کاملPolynomial Controllability in Linear Time-invariant Systems: Some Further Results and Applications to Optimal Control
Previous studies have shown that a controllable linear system can be driven from a given initial condition to a desired target by means of a polynomial input function whose coefficients are obtained simply by solving a set of linear algebraic equations. This paper shows how the application of the concept of polynomial controllability is useful for solving a suboptimal control problem. In partic...
متن کاملOn Some Tighter Inapproximability Results, Further Improvements
Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence sat-issability problems, like MAX-2SAT and E2-LIN-2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the rst time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold for ...
متن کاملSome Further Results on the Recovery Algorithms
When seeking a representation of a signal on a redundant basis one generally replaces the quest for the sparsest model by an `1 minimization and solves thus a linear program. In the presence of noise one has in addition to replace the exact reconstruction constraint by an approximate one. We consider simultaneously several ways to allow for reconstruction errors and detail the optimality condit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Thermal Stresses
سال: 2003
ISSN: 0149-5739,1521-074X
DOI: 10.1080/01495730306294