This paper is concerned with the existence of monotone positive solution for the following third-order nonlocal boundary value problem u′′′ (t)+f (t, u (t) , u′ (t)) = 0, 0 < t < 1; u (0) = 0, au′ (0) − bu′′ (0) = α[u], cu′ (1) + du′′ (1) = β[u], where f ∈ C([0, 1] × R+ × R+, R+), α[u] = ∫ 1 0 u(t)dA(t) and β[u] = ∫ 1 0 u(t)dB(t) are linear functionals on C[0, 1] given by Riemann-Stieltjes inte...

In this paper, we propose a sampler for the product-form solution of basic queueing networks, closed Jackson networks with single servers. Our approach is sampling via Markov chain, but it is NOT a simulation of behavior of customers in queueing networks. We propose a new ergodic Markov chain whose unique stationary distribution is the product form solution of a closed Jackson Network, thus we ...

A modified parabolic equation for adaptive monotone difference schemes based on equal-arclength mesh, applied to the linear convection equation, is derived and its convergence analysis shows that solutions of the modified equation approach a discontinuous (piecewise smooth) solution of the linear convection equation at order one rate in the L1-norm. It is well known that solutions of the monoto...

In this paper, the concept of the strongly monotone type mapping is introduced, which contains the strongly monotone mapping and firmly type nonexpansive mapping as special cases. We show the equivalence between the fixed point problem and the complementarity problem of strongly monotone type mapping. Furthermore, it is obtained that an iteration sequence strongly converges to a unique solution...

This paper deals with a new system of nonlinear variational inclusion problems involving (A, η)-maximal relaxed monotone and relative (A, η)-maximal monotone mappings in 2-uniformly smooth Banach spaces. Using the generalized resolvent operator technique, the approximation solvability of the proposed problem is investigated. An iterative algorithm is constructed to approximate the solution of t...

let $x$ be a reflexive banach space, $t:xto x$ be a nonexpansive mapping with $c=fix(t)neqemptyset$ and $f:xto x$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. in this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences t...

Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition modulo equational reasoning. The class of languages accepted by monotone AC tree automata is known to include the solution set of the inequality x × y > z, which implies that the class properly includes the AC closure of regular tree languages. In the paper, we characte...

In this paper, we study some basic properties of the monotone semide nite nonlinear complementarity problem (SDCP). We show that the trajectory continuously accumulates into the solution set of the SDCP passing through the set of the infeasible but positive de nite matrices under certain conditions. Especially, for the monotone semide nite linear complementarity problem, the trajectory converge...

We derive a lower error bound for monotone diierence schemes to the solution of the linear advection equation with BV initial data. A rigorous analysis shows that for any monotone diierence scheme the lower L 1 error bound is O ?p x , where x is the size of space step.