Numerical solution of fractional diffusion-wave equation based on fractional multistep method

This paper is devoted to application of fractional multistep method in the numerical solution of fractional diffusion-wave equation. By transforming the diffusion-wave equation into an equivalent integro-differential equation and applying Lubich’s fractional multistep method of second order we obtain a scheme of order O(τ^α+h²)$O({\tau }^{\alpha }+h^2)$ for 1?α?1.71832$1?\alpha ?1.71832$ where α$\alpha$ is the order of temporal derivative and τ$\tau$ and h denote temporal and spatial stepsizes. The solvability, convergence and stability properties of the algorithm are investigated and numerical experiment is carried out to verify the feasibility of the scheme.     

Iterative methods for solving nonlinear equations with finitely many roots in an interval

In this paper we consider a nonlinear equation f(x)=0$f\left(x\right)=0$ having finitely many roots in a bounded interval. Based on the so-called numerical integration method [B.I. Yun, A non-iterative method for solving non-linear equations, Appl. Math. Comput. 198 (2008) 691–699] without any initial guess, we propose iterative methods to obtain all the roots of the nonlinear equation. In the result, an algorithm to find all of the simple roots and multiple ones as well as the extrema of f(x)$f\left(x\right)$ is developed. Moreover, criteria for distinguishing zeros and extrema are included in the algorithm. Availability of the proposed method is demonstrated by some numerical examples.     

Finite element approximation to nonlinear coupled thermal problem

A nonlinear coupled elliptic system modelling a large class of engineering problems was discussed in [A.F.D. Loula, J. Zhu, Finite element analysis of a coupled nonlinear system, Comp. Appl. Math. 20 (3) (2001) 321–339; J. Zhu, A.F.D. Loula, Mixed finite element analysis of a thermally nonlinear coupled problem, Numer. Methods Partial Differential Equations 22 (1) (2006) 180–196]. The convergence analysis of iterative finite element approximation to the solution was done under an assumption of ‘small’ solution or source data which guarantees the uniqueness of the nonlinear coupled system. Generally, a nonlinear system may have multiple solutions. In this work, the regularity of the weak solutions is further studied. The nonlinear finite element approximations to the nonsingular solutions are then proposed and analyzed. Finally, the optimal order error estimates in H¹$H^1$-norm and L²$L^2$-norm as well as in W^1,p$W^{1,p}$-norm and L^p$L^p$-norm are obtained.     

A computational matrix method for solving systems of high order fractional differential equations

In this paper, we introduced an accurate computational matrix method for solving systems of high order fractional differential equations. The proposed method is based on the derived relation between the Chebyshev coefficient matrix A of the truncated Chebyshev solution u(t)$\mathbf{u}(\mathbf{t})$ and the Chebyshev coefficient matrix A^(ν)${\mathbf{A}}^{(\nu )}$ of the fractional derivative u^(ν)${\mathbf{u}}^{(\nu )}$. The fractional derivatives are presented in terms of Caputo sense. The matrix method for the approximate solution for the systems of high order fractional differential equations (FDEs) in terms of Chebyshev collocation points is presented. The systems of FDEs and their conditions (initial or boundary) are transformed to matrix equations, which corresponds to system of algebraic equations with unknown Chebyshev coefficients. The remaining set of algebraic equations is solved numerically to yield the Chebyshev coefficients. Several numerical examples for real problems are provided to confirm the accuracy and effectiveness of the present method.     

Existence and non-existence of positive solutions of BVPs for fractional order elastic beam equations with a non-Caratheodory nonlinearity

In this article, the existence and non-existence results on positive solutions of two classes of boundary value problems for nonlinear singular fractional order elastic beam equations is established. Here f depends on x  x^′$x^{\prime }$ and x^″,f$x^{″}\text{,}f$ may be singular at t=0$t=0$ and t=1$t=1$ and f may be a non-Caratheodory function. The analysis relies on the well known Schauder’s fixed point theorem. By applying iterative techniques, results on the existence of positive solutions are obtained and the iterative scheme which starts off with zero function for approximating the solution is established. The iterative scheme obtained is very useful and feasible for computational purpose. Examples and their numerical simulation are presented to illustrate the main theorems. A conclusion section is also given at the end of this paper.     

Branch-and-reduce algorithm for convex programs with additional multiplicative constraints

This article presents a branch-and-reduce algorithm for globally solving for the first time a convex minimization problem (P) with p?1$p?1$ additional multiplicative constraints. In each of these p   additional constraints, the product of two convex functions is constrained to be less than or equal to a positive number. The algorithm works by globally solving a 2p$2p$-dimensional master problem (MP) equivalent to problem (P). During a typical stage k of the algorithm, a point is found that minimizes the objective function of problem (MP) over a nonconvex set F^k$F^k$ that contains the portion of the boundary of the feasible region of the problem where a global optimal solution lies. If this point is feasible in problem (MP), the algorithm terminates. Otherwise, the algorithm continues by branching and creating a new, reduced nonconvex set F^k+1$F^{k+1}$ that is a strict subset of F^k$F^k$. To implement the algorithm, all that is required is the ability to solve standard convex programming problems and to implement simple algebraic steps. Convergence properties of the algorithm are given, and results of some computational experiments are reported.     

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.     

Existence and optimal decay rates of the compressible non-isentropic Navier–Stokes–Poisson models with external forces

In this paper, we consider the three dimensional compressible non-isentropic Navier–Stokes–Poisson equations with the potential external force. Under the smallness assumption of the external force in some Sobolev space, the existence of the stationary solution is established by solving a nonlinear elliptic system. Next, we show global well-posedness of the initial value problem for the three dimensional compressible non-isentropic Navier–Stokes–Poisson equations, provided the prescribed initial data is close to the stationary solution. Finally, based on the elaborate energy estimates for the nonlinear system and L²$L^2$-decay estimates for the semigroup generated by the linearized equation, we give the optimal L²$L^2$-convergence rates of the solutions toward the stationary solution.     

Exponential stability of nonlinear impulsive neutral integro-differential equations

In this paper, a nonlinear impulsive neutral integro-differential equation with time-varying delays is considered. By establishing a singular impulsive delay integro-differential inequality and transforming the n$n$-dimensional impulsive neutral integro-differential equation to a 2n$2n$-dimensional singular impulsive delay integro-differential equation, some sufficient conditions ensuring the global exponential stability in PC¹$P{C}^1$ of the zero solution of an impulsive neutral integro-differential equation are obtained. The results extend and improve the earlier publications. An example is also discussed to illustrate the efficiency of the obtained results.     

Spectral analysis for transition front solutions in multidimensional Cahn–Hilliard systems

We consider the spectrum associated with the linear operator obtained when a Cahn–Hilliard system on Rⁿ${\mathbb{R}}^n$ is linearized about a planar transition front solution. In the case of single Cahn–Hilliard equations on Rⁿ${\mathbb{R}}^n$, it's known that under general physical conditions the leading eigenvalue moves into the negative real half plane at a rate |ξ|³${|\xi |}^3$, where ξ is the Fourier transform variable corresponding with components transverse to the wave. Moreover, it has recently been verified that for single equations this spectral behavior implies nonlinear stability. In the current analysis, we establish that the same cubic rate law holds for a broad range of multidimensional Cahn–Hilliard systems. The analysis of nonlinear stability will be carried out separately.     

The wave equation for the Bessel Laplacian

We study radial solutions of the Cauchy problem for the wave equation in the multidimensional unit ball B^d$B^d$, d≥1$d\ge 1$. In this case, the operator that appears is the Bessel Laplacian and the solution u(t,x)$u(t,x)$ is given in terms of a Fourier–Bessel expansion. We prove that, for initial L^p$L^p$ data, the series converges in the L²$L^2$ norm. The analysis of a particular operator, the adjoint of the Riesz transform for Fourier–Bessel series, is needed for our purposes, and may be of independent interest. As applications, certain L^p−L²$L^p-L^2$ estimates for the solution of the heat equation and the extension problem for the fractional Bessel Laplacian are obtained.     

Minimum size transversals in uniform hypergraphs

A set of vertices in a hypergraph which meets all the edges is called a transversal. The transversal number τ(H)$\tau \left(H\right)$ of a hypergraph H$H$ is the minimum cardinality of a transversal in H$H$. A classical greedy algorithm for constructing a transversal of small size selects in each step a vertex which has the largest degree in the hypergraph formed by the edges not met yet. The analysis of this algorithm (by Chvátal and McDiarmid (1992)  [3]) gave some upper bounds for τ(H)$\tau \left(H\right)$ in a uniform hypergraph H$H$ with a given number of vertices and edges. We discuss a variation of this greedy algorithm. Analyzing this new algorithm, we obtain upper bounds for τ(H)$\tau \left(H\right)$ which improve the bounds by Chvátal and McDiarmid.     

Nonlinear stability of traveling wave solutions for the compressible fluid models of Korteweg type

This paper is concerned with the existence and time-asymptotic nonlinear stability of traveling wave solutions to the Cauchy problem of the one-dimensional compressible fluid models of Korteweg type, which governs the motions of the compressible fluids with internal capillarity. The existence of traveling wave solutions is obtained by the phase plane analysis, then the traveling wave solution is shown to be asymptotically stable by the elementary L²$L^2$-energy method.     

Perfect simulation and moment properties for the Matérn type III process

In a seminal work, Bertil Matérn introduced several types of processes for modeling repulsive point processes. In this paper an algorithm is presented for the perfect simulation of the Matérn III process within a bounded window in R^d${\mathbb{R}}^d$, fully accounting for edge effects. A simple upper bound on the mean time needed to generate each point is computed when interaction between points is characterized by balls of fixed radius R$R$. This method is then generalized to handle interactions resulting from use of random grains about each point. This includes the case of random radii as a special case. In each case, the perfect simulation method is shown to be provably fast, making it a useful tool for analysis of such processes.     

On the convergence of Variational multiscale methods based on Newton’s iteration for the incompressible flows

In this paper, the convergence of a general algorithm with θ$\theta$-type stabilization form for the variational multiscale (VMS) method is presented. Meanwhile, explicit-type and implicit-type algorithms with linear convergence and quadratic convergence are derived from the θ$\theta$-type algorithm, respectively. The combination of explicit-type and implicit-type algorithms are applied to adaptive VMS, which shows good efficiency. Finally, some numerical tests are shown to support the convergence analysis.