The existence of positive solutions to a non‐local singular boundary value problem

We consider the non‐local singular boundary value problem (1) where q ∈ C⁰([0,1]) and f, h ∈ C⁰((0,∞)), limf(x)=?∞, limh(x)=∞. We present conditions guaranteeing the existence of a solution x ∈ C¹([0,1]) ∩ C²((0,1]) which is positive on (0,1]. The proof of the existence result is based on regularization and sequential techniques and on a non‐linear alternative of Leray–Schauder type. Copyright © 2005 John Wiley & Sons, Ltd.     

1‐Factorizations of pseudorandom graphs

A 1‐factorization of a graph G is a collection of edge‐disjoint perfect matchings whose union is E(G). In this paper, we prove that for any ?>0, an (n,d,λ)‐graph G admits a 1‐factorization provided that n is even, C₀ ≤ d ≤ n?1 (where C₀=C₀(?) is a constant depending only on ?), and λ ≤ d^1??. In particular, since (as is well known) a typical random d‐regular graph G_n,d is such a graph, we obtain the existence of a 1‐factorization in a typical G_n,d for all C₀ ≤ d ≤ n?1, thereby extending to all possible values of d results obtained by Janson, and independently by Molloy, Robalewska, Robinson, and Wormald for fixed d. Moreover, we also obtain a lower bound for the number of distinct 1‐factorizations of such graphs G, which is better by a factor of 2^nd/2 than the previously best known lower bounds, even in the simplest case where G is the complete graph.     

Computable analysis of a boundary‐value problem for the generalized KdV–Burgers equation

In this paper, we investigate the computability of the solution operator of the generalized KdV‐Burgers equation with initial‐boundary value problem. Here, the solution operator is a nonlinear map H^{3m ? 1}(R⁺) × H^m(0,T)→C([0,T];H^{3m ? 1}(R⁺)) from the initial‐boundary value data to the solution of the equation. By a technique that is widely used for the study of nonlinear dispersive equation, and using the type 2 theory of effectivity as computable model, we prove that the solution map is Turing computable, for any integer m ≥ 2, and computable real number T > 0. Copyright © 2014 John Wiley & Sons, Ltd.     

Global C∞‐solutions to 1D compressible Navier–Stokes equations with density‐dependent viscosity

In this paper, we consider the existence of global smooth solutions to 1D compressible isentropic Navier–Stokes equations with density‐dependent viscosity and free boundaries. The initial density ρ₀∈W^1,2n is bounded below away from zero and the initial velocity u₀∈L²ⁿ. The viscosity coefficient µ is proportional to ρ^θ with 0<θ?1, where ρis the density. The existence and uniqueness of global solutions in Hⁱ([0,1])(i = 1,2,4) have been established in (J. Math. Phys. 2009; 50 :023101; Meth. Appl. Anal. 2005; 12 :239–252; J. Differ. Equations 2008; 245:3956–3973; Commun. Pure Appl. Anal. 2008; 7 :373–381). By mathematical induction method, we will establish the existence of global smooth solutions to 1D compressible isentropic Navier–Stokes equations with density‐dependent viscosity and free boundaries when the initial data ρ₀ and u₀ are smooth. Copyright © 2011 John Wiley & Sons, Ltd.     

Hyers–Ulam–Rassias stability of a generalized Apollonius–Jensen type additive mapping and isomorphisms between C *‐algebras

Let X, Y be Banach modules over a C *‐algebra. We prove the Hyers–Ulam–Rassias stability of the following functional equation in Banach modules over a unital C *‐algebra: It is shown that a mapping f: X → Y satisfies the above functional equation and f (0) = 0 if and only if the mapping f: X → Y is Cauchy additive. As an application, we show that every almost linear bijection h: A → B of a unital C *‐algebra A onto a unital C *‐algebra B is a C *‐algebra isomorphism when h (2^d uy) = h (2^d u) h (y) for all unitaries u ∈ A, all y ∈ A, and all d ∈ Z . (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Strong solutions to the Keller‐Segel system with the weak Ln /2 initial data and its application to the blow‐up rate

We shall show an exact time interval for the existence of local strong solutions to the Keller‐Segel system with the initial data u₀ in L^{n /2}_w (?ⁿ), the weak L^{n /2}‐space on ?ⁿ. If ‖u₀‖ is sufficiently small, then our solution exists globally in time. Our motivation to construct solutions in L^{n /2}_w (?ⁿ) stems from obtaining a self‐similar solution which does not belong to any usual L^p(?ⁿ). Furthermore, the characterization of local existence of solutions gives us an explicit blow‐up rate of ‖u (t)‖ for n /2 < p < ∞ as t → T_max, where T_max denotes the maximal existence time (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Positive solutions for a p−q‐Laplacian system with critical nonlinearities

In this paper, our main purpose is to establish the existence results of positive solutions for a p ?q ‐Laplacian system involving concave‐convex nonlinearities: where Ω is a bounded domain in R ^N , λ ,θ >0 and 1<r <q <p <N . We assume 1<α ,β and is the critical Sobolev exponent and △_s ·=div(|?·|^{s ?2}?·) is the s‐Laplacian operator. The main results are obtained by variational methods.     

Global existence to a reaction–diffusion equation through a self‐similar‐like upper solution

A demonstration method is presented, which will ensure the existence of positive global solutions in time to the reaction–diffusion equation ?u_t+Δu+u^p=0 in ?ⁿ×[0, ∞), for exponents p?3 and space dimensions n?3. This method does not require the initial value to have a specific uniform smallness condition, but rather to satisfy a bell‐like form. The method is based on a specific upper solution, which models the diffusion process of the heat equation. The upper solution is not self‐similar, but does have a self‐similar‐like form. After transforming the reaction–diffusion problem into an equivalent one, whose initial value is uniformly very small, a local solution is obtained in the time interval [0, 1] by the use of this upper solution. This local solution is then extended to [0, ∞) through an infinite sequence of extensions. At each step, an appropriate change of variables will transform the extension into a problem nearly identical to the local problem in [0, 1]. These transformations exploit the diffusive and self‐similar‐like nature of the upper solution. Copyright © 2009 John Wiley & Sons, Ltd.     

Blow‐up analysis,existence and qualitative properties of solutions for the two‐dimensional Emden–Fowler equation with singular potential

Motivated by the study of a two‐dimensional point vortex model, we analyse the following Emden–Fowler type problem with singular potential: where V(x) = K(x)/|x|^2α with α∈(0, 1), 0<a?K(x)?b< + ∞, ?x∈Ω and ∥?K∥_∞?C. We first extend various results, already known in case α?0, to cover the case α∈(0, 1). In particular, we study the concentration‐compactness problem and the mass quantization properties, obtaining some existence results. Then, by a special choice of K, we include the effect of the angular momentum in the system and obtain the existence of axially symmetric one peak non‐radial blow‐up solutions. Copyright © 2007 John Wiley & Sons, Ltd.     

Existence of positive solutions for nonlinear singular boundary value problem with p‐Laplacian

In this paper, we study the existence of positive solutions for the following Sturm–Liouville‐like four‐point singular boundary value problem (BVP) with p‐Laplacian where ?_p(s)=|s|^p?2 s, p>1, f is a lower semi‐continuous function. Using the fixed‐point theorem of cone expansion and compression of norm type, the existence of positive solution and infinitely many positive solutions for Sturm–Liouville‐like singular BVP with p‐Laplacian are obtained. Copyright © 2009 John Wiley & Sons, Ltd.     

The Crank‐Nicolson/Adams‐Bashforth scheme for the time‐dependent Navier‐Stokes equations with nonsmooth initial data

In this article, we study the stability and convergence of the Crank‐Nicolson/Adams‐Bashforth scheme for the two‐dimensional nonstationary Navier‐Stokes equations with a nonsmooth initial data. A finite element method is applied for the spatial approximation of the velocity and pressure. The time discretization is based on the implicit Crank‐Nicolson scheme for the linear terms and the explicit Adams‐Bashforth scheme for the nonlinear term. Moreover, we prove that the scheme is almost unconditionally stable for a nonsmooth initial data u₀ with div u₀ = 0, i.e., the time step τ satisfies: τ ≤ C₀ if u₀ ∈ H¹ ∩ L^∞; τ |log h| ≤ C₀ if u₀ ∈ H¹ for the mesh size h and some positive constant C₀. Finally, we obtain some error estimates for the discrete velocity and pressure under the above stability condition. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 28: 155‐187, 2012     

Existence and nonexistence of global solutions to the Cauchy problem for a nonlinear beam equation

The paper studies the existence and nonexistence of global solutions to the Cauchy problem for a nonlinear beam equation arising in the model in variational form for the neo–Hookean elastomer rod where k₁, k₂>0 are real numbers, g(s) is a given nonlinear function. When g(s)=sⁿ (where n?2 is an integer), by using the Fourier transform method we prove that for any T>0, the Cauchy problem admits a unique global smooth solution u∈C^∞((0, T]; H^∞( R ))∩C([0, T]; H³( R ))∩C¹([0, T]; H^?1( R )) as long as initial data u₀∈W^{4, 1}( R )∩H³( R ), u₁∈L¹( R )∩H^?1( R ). Moreover, when (u₀, u₁)∈H²( R ) × L²( R ), g∈C²( R ) satisfy certain conditions, the Cauchy problem has no global solution in space C([0, T]; H²( R ))∩C¹([0, T]; L²( R ))∩H¹(0, T; H²( R )). Copyright © 2009 John Wiley & Sons, Ltd.     

Discrete duality finite volume schemes for Leray−Lions−type elliptic problems on general 2D meshes

Discrete duality finite volume schemes on general meshes, introduced by Hermeline and Domelevo and Omnès for the Laplace equation, are proposed for nonlinear diffusion problems in 2D with nonhomogeneous Dirichlet boundary condition. This approach allows the discretization of non linear fluxes in such a way that the discrete operator inherits the key properties of the continuous one. Furthermore, it is well adapted to very general meshes including the case of nonconformal locally refined meshes. We show that the approximate solution exists and is unique, which is not obvious since the scheme is nonlinear. We prove that, for general W^?1,p′(Ω) source term and W^1‐(1/p),p(?Ω) boundary data, the approximate solution and its discrete gradient converge strongly towards the exact solution and its gradient, respectively, in appropriate Lebesgue spaces. Finally, error estimates are given in the case where the solution is assumed to be in W^2,p(Ω). Numerical examples are given, including those on locally refined meshes. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

The existence of a 2‐factor in K1, n‐free graphs with large connectivity and large edge‐connectivity

In this article, we study the existence of a 2‐factor in a K_{1, n}‐free graph. Sumner [J London Math Soc 13 (1976), 351–359] proved that for n?4, an (n?1)‐connected K_{1, n}‐free graph of even order has a 1‐factor. On the other hand, for every pair of integers m and n with m?n?4, there exist infinitely many (n?2)‐connected K_{1, n}‐free graphs of even order and minimum degree at least m which have no 1‐factor. This implies that the connectivity condition of Sumner's result is sharp, and we cannot guarantee the existence of a 1‐factor by imposing a large minimum degree. On the other hand, Ota and Tokuda [J Graph Theory 22 (1996), 59–64] proved that for n?3, every K_{1, n}‐free graph of minimum degree at least 2n?2 has a 2‐factor, regardless of its connectivity. They also gave examples showing that their minimum degree condition is sharp. But all of them have bridges. These suggest that the effects of connectivity, edge‐connectivity and minimum degree to the existence of a 2‐factor in a K_{1, n}‐free graph are more complicated than those to the existence of a 1‐factor. In this article, we clarify these effects by giving sharp minimum degree conditions for a K_{1, n}‐free graph with a given connectivity or edge‐connectivity to have a 2‐factor. Copyright © 2010 Wiley Periodicals, Inc. J Graph Theory 68:77‐89, 2011     

K4−‐factor in a graph

Let G be a graph of order 4k and let δ(G) denote the minimum degree of G. Let F be a given connected graph. Suppose that |V(G)| is a multiple of |V(F)|. A spanning subgraph of G is called an F‐factor if its components are all isomorphic to F. In this paper, we prove that if δ(G)≥5/2k, then G contains a K₄^?‐factor (K₄^? is the graph obtained from K₄ by deleting just one edge). The condition on the minimum degree is best possible in a sense. In addition, the proof can be made algorithmic. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 111–128, 2002     

Well‐posedness of time‐space fractional stochastic evolution equations driven by α‐stable noise

This paper is devoted to the well‐posedness for time‐space fractional Ginzburg‐Landau equation and time‐space fractional Navier‐Stokes equations by α‐stable noise. The spatial regularity and the temporal regularity of the nonlocal stochastic convolution are firstly established, and then the existence and uniqueness of the global mild solution are obtained by the Banach fixed point theorem and Mittag‐Leffler functions, respectively. Numerical simulations for time‐space fractional Ginzburg‐Landau equation are provided to verify the analysis results.     

Combination of standard Galerkin and subspace methods for the time‐dependent Navier‐Stokes equations with nonsmooth initial data

We consider a combination of the standard Galerkin method and the subspace decomposition methods for the numerical solution of the two‐dimensional time‐dependent incompressible Navier‐Stokes equations with nonsmooth initial data. Because of the poor smoothness of the solution near t = 0, we use the standard Galerkin method for time interval [0, 1] and the subspace decomposition method time interval [1, ∞). The subspace decomposition method is based on the solution into the sum of a low frequency component integrated using a small time step Δt and a high frequency integrated using a larger time step pΔt with p > 1. From the H¹‐stability and L²‐error analysis, we show that the subspace decomposition method can yield a significant gain in computing time. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2009     

Perturbation analysis for the generalized Schur complement of a positive semi‐definite matrix

Let and S=C?B^HA^?B be the generalized Schur complement of A?0 in P. In this paper, some perturbation bounds of S are presented which generalize the result of Stewart (Technical Report TR‐95‐38, University of Maryland, 1995) and enrich the perturbation theory for the Schur complement. Also, an error estimate for the smallest perturbation of C, which lowers the rank of P, is discussed. Copyright © 2007 John Wiley & Sons, Ltd.     

Long time error analysis of the fourth‐order compact finite difference methods for the nonlinear Klein–Gordon equation with weak nonlinearity

We present the fourth‐order compact finite difference (4cFD) discretizations for the long time dynamics of the nonlinear Klein–Gordon equation (NKGE), while the nonlinearity strength is characterized by ?^p with a constant p ∈ ?⁺ and a dimensionless parameter ? ∈ (0, 1] . Based on analytical results of the life‐span of the solution, rigorous error bounds of the 4cFD methods are carried out up to the time at O(?^?p) . We pay particular attention to how error bounds depend explicitly on the mesh size h and time step τ as well as the small parameter ? ∈ (0, 1] , which indicate that, in order to obtain ‘correct’ numerical solutions up to the time at O(?^?p) , the ? ‐scalability (or meshing strategy requirement) of the 4cFD methods should be taken as: h = O(?^p/4) and τ = O(?^p/2) . It has better spatial resolution capacity than the classical second order central difference methods. By a rescaling in time, it is equivalent to an oscillatory NKGE whose solution propagates waves with wavelength at O(1) in space and O(?^p) in time. It is straightforward to get the error bounds of the oscillatory NKGE in the fixed time. Finally, numerical results are provided to confirm our theoretical analysis.     

Error estimates for two‐level penalty finite volume method for the stationary Navier–Stokes equations

Two‐level penalty finite volume method for the stationary Navier–Stokes equations based on the P₁ ? P₀ element is considered in this paper. The method involves solving one small penalty Navier–Stokes problem on a coarse mesh with mesh size H = ?^{1 / 4}h^{1 / 2}, a large penalty Stokes problem on a fine mesh with mesh size h, where 0 < ? < 1 is a penalty parameter. The method we study provides an approximate solution with the convergence rate of same order as the penalty finite volume solution (u_?h,p_?h), which involves solving one large penalty Navier–Stokes problem on a fine mesh with the same mesh size h. However, our method can save a large amount of computational time. Copyright © 2013 John Wiley & Sons, Ltd.