On strongly almost trivial embeddings of graphs

We present four new classes of graphs, two of which every member has a strongly almost trivial embedding, and the other two of which every member has no strongly almost trivial embeddings. We show that the property that a graph has a strongly almost trivial embedding and the property that a graph has no strongly almost trivial embeddings are not inherited by minors. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory     

A class of non‐graded left‐symmetric algebraic structures on the Witt algebra

We classify the compatible left‐symmetric algebraic structures on the Witt algebra satisfying certain non‐graded conditions. It is unexpected that they are Novikov algebras. Furthermore, as applications, we study the induced non‐graded modules of the Witt algebra and the induced Lie algebras by Novikov‐Poisson algebras’ approach and Balinskii‐Novikov's construction.     

Global well‐posedness of the compressible Euler with damping in Besov spaces

In this paper, we consider the Cauchy problems for compressible Euler equations with damping. In terms of the Littlewood–Paley decomposition and Bony's para‐product formula, we prove the global existence, uniqueness and asymptotic behavior of the solution in the critical Besov space comparing with previous results. Copyright © 2012 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     

Spectral approximation for drainage of an Elastico‐viscous liquid and error analysis

A Fourier‐Galerkin spectral method is proposed and used to analyze a system of quasilinear partial differential equations governing the drainage of liquids of the Oldroyd four‐constant type. It is shown that, Fourier‐Galerkin approximations are convergent with spectral accuracy. An efficient and accurate algorithm based on the Fourier‐Galerkin approximations to the system of quasilinear partial differential equations are developed and implemented. Numerical results indicating the high accuracy and effectiveness of this algorithm are presented. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 492–505, 2012     

On a hierarchical error estimator combined with a stabilized method for the Navier–Stokes equations

This work combines two complementary strategies for solving the steady incompressible Navier–Stokes model with a zeroth‐order term, namely, a stabilized finite element method and a mesh–refinement approach based on an error estimator. First, equal order interpolation spaces are adopted to approximate both the velocity and the pressure while stability is recovered within the stabilization approach. Also designed to handle advection dominated flows under zeroth‐order term influence, the stabilized method incorporates a new parameter with a threefold asymptotic behavior. Mesh adaptivity driven by a new hierarchical error estimator and built on the stabilized method is the second ingredient. The estimator construction process circumvents the saturation assumption by using an enhancing space strategy which is shown to be equivalent to the error. Several numerical tests validate the methodology. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Fourth‐order compact scheme with local mesh refinement for option pricing in jump‐diffusion model

The value of a contingent claim under a jump‐diffusion process satisfies a partial integro‐differential equation. A fourth‐order compact finite difference scheme is applied to discretize the spatial variable of this equation. It is discretized in time by an implicit‐explicit method. Meanwhile, a local mesh refinement strategy is used for handling the nonsmooth payoff condition. Moreover, the numerical quadrature method is exploited to evaluate the jump integral term. It guarantees a Toeplitz‐like structure of the integral operator such that a fast algorithm is feasible. Numerical results show that this approach gives fourth‐order accuracy in space. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2011     

Finite difference approximations and dynamics simulations for the Lévy Fractional Klein‐Kramers equation

The Klein‐Kramers equation describes position and velocity distribution of Langevin dynamics, the diffusion equation and Fokker‐Planck equation are its special cases for characterizing position distribution and velocity distribution, respectively. Incorporating the mechanisms of Lévy flights into the Klein‐Kramers formalism leads to the Lévy fractional Klein‐Kramers equation, which can effectively describe Lévy flights in the presence of an external force field in the phase space. For numerically solving the Lévy fractional Klein‐Kramers equation, this article presents the explicit and implicit finite difference schemes. The discrete maximum principle is generalized, using this result the detailed stability and convergence analyses of the schemes are given. And the extrapolation and some other possible techniques for improving the convergent rate or making the schemes efficient in more general cases are also discussed. The extensive numerical experiments are performed to confirm the effectiveness of the numerical schemes or simulate the superdiffusion processes. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Imposing no‐arbitrage conditions in implied volatilities using constrained smoothing splines

We apply constrained smoothing B‐splines to the construction of arbitrage‐free implied volatilities and derived measures. The constrained smoothing B‐splines allows the imposition of the constraints of monotonicity and convexity given by the no‐arbitrage conditions in the pricing function. We illustrate the methodology in the construction of implied volatilities and also in the construction of derived measures such as risk‐neutral densities, showing that it can be used as an effective tool for general treatment of option prices. Copyright © 2011 John Wiley & Sons, Ltd.     

Some results on λ‐designs with two block sizes

A λ‐design is a family ?? = {B₁, B₂, …, B_v} of subsets of X = {1, 2, …, v} such that |B_i∩B_j| = λ for all i≠jand not all B_i are of the same size. The only known example of λ‐designs (called type‐1 designs) are those obtained from symmetric designs by a certain complementation procedure. Ryser [J Algebra 10 (1968), 246–261] and Woodall [Proc London Math Soc 20 (1970), 669–687] independently conjectured that all λ‐designs are type‐1. Let g = gcd(r ? 1, r^* ? 1), where rand r^* are the two replication numbers. Ionin and Shrikhande [J Combin Comput 22 (1996), 135–142; J Combin Theory Ser A 74 (1996), 100–114] showed that λ‐designs with g = 1, 2, 3, 4 are type‐1 and that the Ryser–Woodall conjecture is true for λ‐designs on p + 1, 2p + 1, 3p + 1, 4p + 1 points, where pis a prime. Hein and Ionin [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 145–156] proved corresponding results for g = 5 and Fiala [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 109–124; Ars Combin 68 (2003), 17–32; Ars Combin, to appear] for g = 6, 7, and 8. In this article, we consider λ designs with exactly two block sizes. We show that in this case, the conjecture is true for g = 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, and for g = 10, 14, 18, 22 with v≠4λ ? 1. We also give two results on such λ‐designs on v = 9p + 1 and 12p + 1 points, where pis a prime. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:95‐110, 2011