Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  differential inequalities
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The purpose of this work is to analyze the blow-up of solutions of a nonlinear parabolic equation with a forcing term depending on both time and space variables ut − Δu = |x|α|u|p + a(t)w(x) for (t, x) ∈ (0,∞) × RN, where α ∈ R, p > 1, and a(t) as well as w(x) are suitable given functions. We generalize and somehow improve earlier existing works by considering a wide class of forcing terms that includes the most common investigated example tσ w(x) as a particular case. Using the test function method and some differential inequalities, we obtain sufficient criteria for the nonexistence of global weak solutions. This criterion mainly depends on the value of the limit lim [formula]. The main novelty lies in our treatment of the nonstandard condition on the forcing term.
EN
Consideration is given to three different analytical methods for the computation of upper bounds for the rate of convergence to the limiting regime of one specific class of (in)homogeneous continuous-time Markov chains. This class is particularly well suited to describe evolutions of the total number of customers in (in)homogeneous M/M/S queueing systems with possibly state-dependent arrival and service intensities, batch arrivals and services. One of the methods is based on the logarithmic norm of a linear operator function; the other two rely on Lyapunov functions and differential inequalities, respectively. Less restrictive conditions (compared with those known from the literature) under which the methods are applicable are being formulated. Two numerical examples are given. It is also shown that, for homogeneous birth-death Markov processes defined on a finite state space with all transition rates being positive, all methods yield the same sharp upper bound.
EN
In this article we apply an extension of a Leggett-Williams type fixed point theorem to a two-point boundary value problem for a 2n-th order ordinary differential equation. The fixed point theorem employs concave and convex functionals defined on a cone in a Banach space. Inequalities that extend the notion of concavity to 2n-th order differential inequalities are derived and employed to provide the necessary estimates. Symmetry is employed in the construction of the appropriate Banach space.
4
Content available remote Second order differential inequalities via aggregation
EN
Let E be a Banach space ordered by a solid and normal cone. We introduce a polynorm with respect to a given selection of positive pairwise disjoint vectors p1, . . . , pm, and derive monotonicity properties of solutions of second order differential inequalities under one-sided matrix Lipschitz conditions.
EN
Classical solutions of nonlinear initial boundary value problems are approximated in the paper by solutions of suitable quasilinear differential difference systems. The proof of the stability of the method of lines is based on a comparison technique with nonlinear estimates of the Perron type. Numerical examples are given.
6
Content available remote On-sided estimates for quasimonotone systems of boundary value problem
EN
We prove existence and uniqueness theorems for Dirichlet boundary value problems of the form u" + f(t,u) = 0, u(0) = uo, u(1) = ui in ordered finite dimensional Banach spaces, involving one-sided estimates and quasimonotonicity.
7
Content available remote Equipower and equichordal extension
EN
In this paper we consider the possibility of extension of a concave function f : [0, a] -> [0, +oo) to equipower convex curve or equichordal convex curve with axis of symmetry. The extension is possible if and only if f satisfies a differential inequality of the second degree.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.