Existence of three nontrivial solutions for nonlinear Neumann hemivariational inequalities

In this paper we consider a nonlinear Neumann problem driven by the p$p$-Laplacian with a nonsmooth potential (hemivariational inequality). Using minimax methods based on the nonsmooth critical point theory together with suitable truncation techniques, we show that the problem has at least three nontrivial smooth solutions. Two of these solutions have constant sign (one is positive, the other negative).     

Multiple positive solutions for nonlinear eigenvalue problems with the p-Laplacian

In this paper we consider a nonlinear eigenvalue problem driven by the p$p$-Laplacian differential operator and with a nonsmooth potential. Using degree theoretic arguments based on the degree map for certain operators of monotone type, we show that the problem has at least two nontrivial positive solutions as the parameter λ>0$\lambda >0$ varies in a half-line.     

Multiple positive solutions for semi-linear elliptic systems with sign-changing weight

In this paper, we study the multiplicity results of positive solutions for a semi-linear elliptic system involving both concave–convex and critical growth terms. With the help of the Nehari manifold and the Lusternik–Schnirelmann category, we investigate how the coefficient h(x)$h\left(x\right)$ of the critical nonlinearity affects the number of positive solutions of that problem and get a relationship between the number of positive solutions and the topology of the global maximum set of h$h$.     

Multiple positive and sign-changing solutions for a singular Schrödinger equation with critical growth

Variational methods are used to prove the existence of multiple positive and sign-changing solutions for a Schrödinger equation with singular potential having prescribed finitely many singular points. Some exact local behavior for positive solutions obtained here are also given. The interesting aspects are two. One is that one singular point of the potential V(x)$V(x)$ and one positive solution can produce one sign-changing solution of the problem. The other is that each sign-changing solution changes its sign exactly once.     

Large solutions for the Laplacian with a power nonlinearity given by a variable exponent

In this paper we consider positive boundary blow-up solutions to the problem Δu=uq(x)$\mathrm{\Delta }u=u^{q(x)}$ in a smooth bounded domain Ω⊂Rn$\Omega \subset {\mathbb{R}}^n$. The exponent q(x)$q(x)$ is allowed to be a variable positive Hölder continuous function. The issues of existence, asymptotic behavior near the boundary and uniqueness of positive solutions are considered. Furthermore, since q(x)$q(x)$ is also allowed to take values less than one, it is shown that the blow up of solutions on ∂Ω is compatible with the occurrence of dead cores, i.e., nonempty interior regions where solutions vanish.     

The effect of predator competition on positive solutions for a predator–prey model with diffusion

A diffusive predator–prey model with predator competition is considered under Dirichlet boundary conditions. Some existence and non-existence results are firstly obtained. Then by investigating the bifurcation of positive solutions, the multiplicity of positive solutions is established for suitably large m$m$. Furthermore, by meticulously analyzing the asymptotic behaviors of positive solutions when k$k$ goes to ∞$\infty$, we find that there is at most a positive solution for any c∈R$c\in R$ when k$k$ is sufficiently large. At last, some numerical simulations are presented to supplement the analytic results in one dimension.     

A remark on least-squares mixed element methods for reaction–diffusion problems

In this paper, we propose a least-squares mixed element procedure for a reaction–diffusion problem based on the first-order system. By selecting the least-squares functional properly, the resulting procedure can be split into two independent symmetric positive definite schemes, one of which is for the unknown variable and the other of which is for the unknown flux variable, which lead to the optimal order H¹(Ω)$H^1(\Omega )$ and L²(Ω)$L^2(\Omega )$ norm error estimates for the primal unknown and optimal H(div;Ω)$H(\mathrm{div};\Omega )$ norm error estimate for the unknown flux. Finally, we give some numerical examples.     

Boundary value problems involving upper and lower solutions in reverse order

In this paper, we discuss the existence of extreme solutions of the boundary value problem for a class of first-order functional equations with a nonlinear boundary condition. In the presence of a lower solution α$\alpha$ and an upper solution β$\beta$ with β≤α$\beta \le \alpha$, we establish existence results of extreme solutions by using the method of upper and lower solutions and a monotone iterative technique.     

Computing steady-state solutions for a free boundary problem modeling tumor growth by Stokes equation

We consider a free boundary problem modeling tumor growth where the model equations include a diffusion equation for the nutrient concentration and the Stokes equation for the proliferation of tumor cells. For any positive radius R$R$, it is known that there exists a unique radially symmetric stationary solution. The proliferation rate μ$\mu$ and the cell-to-cell adhesiveness γ$\gamma$ are two parameters for characterizing “aggressiveness” of the tumor. We compute symmetry-breaking bifurcation branches of solutions by studying a polynomial discretization of the system. By tracking the discretized system, we numerically verified a sequence of μ/γ$\mu /\gamma$ symmetry breaking bifurcation branches. Furthermore, we study the stability of both radially symmetric and radially asymmetric stationary solutions.     

Quadratic reflected BSDEs with unbounded obstacles

In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator f$f$ has quadratic growth in the z$z$-variable. In particular, we obtain existence, uniqueness, and stability results, and consider the optimal stopping for quadratic g$g$-evaluations. As an application of our results we analyze the obstacle problem for semi-linear parabolic PDEs in which the non-linearity appears as the square of the gradient. Finally, we prove a comparison theorem for these obstacle problems when the generator is concave in the z$z$-variable.     

Oscillation of harmonic functions for subordinate Brownian motion and its applications

In this paper, we establish an oscillation estimate of nonnegative harmonic functions for a pure-jump subordinate Brownian motion. The infinitesimal generator of such subordinate Brownian motion is an integro-differential operator. As an application, we give a probabilistic proof of the following form of relative Fatou theorem for such subordinate Brownian motion X$X$ in a bounded κ$\kappa$-fat open set; if u$u$ is a positive harmonic function with respect to X$X$ in a bounded κ$\kappa$-fat open set D$D$ and h$h$ is a positive harmonic function in D$D$ vanishing on D^c$D^c$, then the non-tangential limit of u/h$u/h$ exists almost everywhere with respect to the Martin-representing measure of h$h$.     

Hardness of comparing two run-length encoded strings

In this paper, we consider a commonly used compression scheme called run-length encoding. We provide both lower and upper bounds for the problems of comparing two run-length encoded strings. Specifically, we prove the 3sum-hardness for both the wildcard matching problem and the k$k$-mismatch problem with run-length compressed inputs. Given two run-length encoded strings of m$m$ and n$n$ runs, such a result implies that it is very unlikely to devise an o(mn)$o\left(mn\right)$-time algorithm for either of them. We then present an inplace algorithm running in O(mnlogm)$O(mnlogm)$ time for their combined problem, i.e. k$k$-mismatch with wildcards. We further demonstrate that if the aim is to report the positions of all the occurrences, there exists a stronger barrier of Ω(mnlogm)$\Omega (mnlogm)$-time, matching the running time of our algorithm. Moreover, our algorithm can be easily generalized to a two-dimensional setting without impairing the time and space complexity.     

Positive soliton solutions for generalized quasilinear Schrödinger equations with critical growth

This paper is concerned with the positive solutions for generalized quasilinear Schrödinger equations in R^N${\mathbb{R}}^N$ with critical growth which have appeared from plasma physics, as well as high-power ultrashort laser in matter. By using a change of variables and variational argument, we obtain the existence of positive solutions for the given problem.     

A variant smoothing Newton method for P0-NCP based on a new smoothing function

In this paper, we present a new one-step smoothing Newton method proposed for solving the non-linear complementarity problem with _P0$P_0$-function based on a new smoothing NCP$NCP$-function. We adopt a variant merit function. Our algorithm needs only to solve one linear system of equations and perform one line search per iteration. It shows that any accumulation point of the iteration sequence generated by our algorithm is a solution of _P0-NCP$P_0\text{-}NCP$. Furthermore, under the assumption that the solution set is non-empty and bounded, we can guarantee at least one accumulation point of the generated sequence. Numerical experiments show the feasibility and efficiency of the algorithm.     

The effect of domain shape on the number of positive and nodal solutions for semilinear elliptic equations

In this paper, we study the effect of domain shape on the number of positive and nodal (sign-changing) solutions for a class of semilinear elliptic equations. We prove a semilinear elliptic equation in a domain Ω$\Omega$ that contains m$m$ disjoint large enough balls has m²$m^2$ 2-nodal solutions and m$m$ positive solutions.     

Constructing uniform designs: A heuristic integer programming method

In this paper, the wrap-around _L2$L_2$-discrepancy (WD) of asymmetrical design is represented as a quadratic form, thus the problem of constructing a uniform design becomes a quadratic integer programming problem. By the theory of optimization, some theoretic properties are obtained. Algorithms for constructing uniform designs are then studied. When the number of runs n$n$ is smaller than the number of all level-combinations m$m$, the construction problem can be transferred to a zero–one quadratic integer programming problem, and an efficient algorithm based on the simulated annealing is proposed. When n≥m$n\ge m$, another algorithm is proposed. Empirical study shows that when n$n$ is large, the proposed algorithms can generate designs with lower WD compared to many existing methods. Moreover, these algorithms are suitable for constructing both symmetrical and asymmetrical designs.     

Mass transport problems for the Euclidean distance obtained as limits of p-Laplacian type problems with obstacles

In this paper we analyze a mass transportation problem that consists in moving optimally (paying a transport cost given by the Euclidean distance) an amount of a commodity larger than or equal to a fixed one to fulfil a demand also larger than or equal to a fixed one, with the obligation of paying an extra cost of −_g1(x)$-g_1(x)$ for extra production of one unit at location x   and an extra cost of _g2(y)$g_2(y)$ for creating one unit of demand at y  . The extra amounts of mass (commodity/demand) are unknowns of the problem. Our approach to this problem is by taking the limit as p→∞$p\to \infty$ to a double obstacle problem (with obstacles _g1$g_1$, _g2$g_2$) for the p  -Laplacian. In fact, under a certain natural constraint on the extra costs (that is equivalent to impose that the total optimal cost is bounded) we prove that this limit gives the extra material and extra demand needed for optimality and a Kantorovich potential for the mass transport problem involved. We also show that this problem can be interpreted as an optimal mass transport problem in which one can make the transport directly (paying a cost given by the Euclidean distance) or may hire a courier that cost _g2(y)−_g1(x)$g_2(y)-g_1(x)$ to pick up a unit of mass at y and deliver it to x. For this different interpretation we provide examples and a decomposition of the optimal transport plan that shows when we have to use the courier.     

An implicit iterative scheme for monotone variational inequalities and fixed point problems

In this paper we introduce an implicit iterative scheme for finding a common element of the set of common fixed points of N$N$ nonexpansive mappings and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping. The implicit iterative scheme is based on two well-known methods: extragradient and approximate proximal. We obtain a weak convergence theorem for three sequences generated by this implicit iterative scheme. On the basis of this theorem, we also construct an implicit iterative process for finding a common fixed point of N+1$N+1$ mappings, such that one of these mappings is taken from the more general class of Lipschitz pseudocontractive mappings and the other N$N$ mappings are nonexpansive.     

Boundary value problems in spaces of distributions on smooth and polygonal domains

We study boundary value problems of the form -Δu=f$-\mathrm{\Delta }u=f$ on Ω$\Omega$ and Bu=g$\mathit{Bu}=g$ on the boundary ∂Ω$\mathrm{\partial }\Omega$, with either Dirichlet or Neumann boundary conditions, where Ω$\Omega$ is a smooth bounded domain in Rⁿ${\mathbb{R}}^n$ and the data f,g$f,g$ are distributions  . This problem has to be first properly reformulated and, for practical applications, it is of crucial importance to obtain the continuity of the solution u$u$ in terms of f and g  . For f=0$f=0$, taking advantage of the fact that u$u$ is harmonic on Ω$\Omega$, we provide four formulations of this boundary value problem (one using nontangential limits of harmonic functions, one using Green functions, one using the Dirichlet-to-Neumann map, and a variational one); we show that these four formulations are equivalent. We provide a similar analysis for f≠0$f\ne 0$ and discuss the roles of f and g, which turn to be somewhat interchangeable in the low regularity case. The weak formulation is more convenient for numerical approximation, whereas the nontangential limits definition is closer to the intuition and easier to check in concrete situations. We extend the weak formulation to polygonal domains using weighted Sobolev spaces. We also point out some new phenomena for the “concentrated loads” at the vertices in the polygonal case.