نتایج جستجو برای: blow up set
تعداد نتایج: 1500945 فیلتر نتایج به سال:
for the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. when the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. in this paper we will consider the polynomial planar vector fields ...
Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Sp...
In this paper we highlight how the Fonseca and Müller blow-up technique is particularly well suited for homogenization problems. As examples we give a simple proof of the nonlinear homogenization theorem for integral functionals and we prove a homogenization theorem for sets of finite perimeter.
In this paper, we consider singular and degenerate parabolic equations$$u_t =(x^alpha u_x)_x +u^m (x_0,t)v^{n} (x_0,t),quadv_t =(x^beta v_x)_x +u^q (x_0,t)v^{p} (x_0,t),$$ in $(0,a)times (0,T)$, subject to nullDirichlet boundary conditions, where $m,n, p,qge 0$, $alpha, betain [0,2)$ and $x_0in (0,a)$. The optimal classification of non-simultaneous and simultaneous blow-up solutions is determin...
با توجه به وجود کاتیون¬های کادمیم و روی (ii) در پساب بسیاری از صنایع و لزوم حذف این فلزات از پساب، در تحقیق حاضر جداسازی آنها از محلول آبی به روش غشاء مایع ترکیبی که به دنبال آن امکان بازیافت نیز فراهم می¬گردد، مورد مطالعه قرار گرفته است. در این تحقیق از یک up- set طراحی شده جدید که ترکیبی از غشاء مایع بالک و غشاء مایع حمایت شده در آن گنجانده شده، استفاده گردیده است. استفاده از این up- set بسیا...
The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of ve...
In this work, we study the behavior of blow-up solutions to multidimensional restricted Euler--Poisson equations which are localized version full system. We provide necessary conditions for existence finite-time in terms initial data, and describe asymptotic near blow up times. also identify a rich set data yields global bounded solutions.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید