نتایج جستجو برای: local conditions

تعداد نتایج: 1331329  

Journal: :bulletin of the iranian mathematical society 2013
m. jahanshahi m. sajjadmanesh

in this paper, two inverse problems of stephen kind with local (dirichlet) boundary conditions are investigated. in the first problem only a part of boundary is unknown and in the second problem, the whole of boundary is unknown. for the both of problems, at first, analytic expressions for unknown boundary are presented, then by using these analytic expressions for unknown boundaries and bounda...

Journal: :international journal of industrial mathematics 2015
n. ‎aliev s. ashrafi a. r. sarakhsi‎

singular perturbation problems have been studied by many mathematicians. since the approximate solutions of these problems are as the sum of internal solution (boundary layer area) and external ones, the formation or non-formation of boundary layers should be specified. this paper, investigates this issue for a singular perturbation problem including a first order differential equation with gen...

Journal: :international journal of nonlinear analysis and applications 2015
mohamed houas maamar benbachir

this paper studies a fractional boundary value problem of nonlineardifferential equations of arbitrary orders. new existence and uniquenessresults are established using banach contraction principle. other existenceresults are obtained using schaefer and krasnoselskii fixed point theorems.in order to clarify our results, some illustrative examples are alsopresented.

Journal: :journal of artificial intelligence in electrical engineering 0

nowadays, the use of intelligent control systems to reduce human error is one of the most popularresearch fields. design and implementation of such controllers requires to actual knowledge of theenvironment conditions. traffic lights as one of the inputs of intelligent control systems are significant.usually the traffic lights have the various physical structure. also, generally in image proces...

Journal: :SIAM Journal on Optimization 2017
Chao Ding Defeng Sun Liwei Zhang

This paper is devoted to studying the robust isolated calmness of the Karush– Kuhn–Tucker (KKT) solution mapping for a large class of interesting conic programming problems (including most commonly known ones arising from applications) at a locally optimal solution. Under the Robinson constraint qualification, we show that the KKT solution mapping is robustly isolated calm if and only if both t...

Journal: :iranian journal of science and technology (sciences) 2013
m. jahanshahi

in this paper we study the boundary layer problems in which boundary conditions are non-local. here we try to find the necessary conditions by the help of fundamental solution to the given adjoint equation. by getting help from these conditions, at first the boundary condition is changed from non-local to local. the main aim of this paper is to identify the location of the boundary layer. in ot...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1377

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

2005
ANTHONY BONATO ALEXANDRU COSTEA

A graph has the neighbour-closed-co-neighbour, or ncc property, if for each of its vertices x, the subgraph induced by the neighbour set of x is isomorphic to the subgraph induced by the closed non-neighbour set of x. Graphs with the ncc property were characterized in [1] by the existence of a locally C4 perfect matching M : every two edges of M induce a subgraph isomorphic to C4. In the presen...

1995
Celina M. H. de Figueiredo

In this note, we investigate three versions of the overfull property for graphs and their relation to the edge-coloring problem. Each of these properties implies that the graph cannot be edge-colored with colors, where is the maximum degree. The three versions are not equivalent for general graphs. However, we show that some equivalences hold for the classes of indiierence graphs, split graphs,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید