Three-Dimensional Lattice Boltzmann Model for the Complex Ginzburg–Landau Equation

In this paper, a lattice Boltzmann model for the three-dimensional complex Ginzburg–Landau equation is proposed. The multi-scale technique and the Chapman–Enskog expansion are used to describe higher-order moments of the complex equilibrium distribution function and a series of complex partial differential equations. The modified partial differential equation of the three-dimensional complex Ginzburg–Landau equation with the third order truncation error is obtained. Based on the complex lattice Boltzmann model, some motions of the stable scroll, such as the scroll wave with a straight filament, scroll ring, and helical scroll are simulated. The comparisons between results of the lattice Boltzmann model with those obtained by the alternative direction implicit scheme are given. The numerical results show that this model can be used to simulate the three-dimensional complex Ginzburg–Landau equation.     

A Coupled Lattice Boltzmann Method to Solve Nernst–Planck Model for Simulating Electro-osmotic Flows

In this paper, we focus on the nonlinear coupling mechanism of the Nernst–Planck model and propose a coupled lattice Boltzmann method (LBM) to solve it. In this method, a new LBM for the Nernst–Planck equation is developed, a multi-relaxation-time (MRT)-LBM for flow field and an LBM for the Poisson equation are used. And then, we discuss the choice of the model and found that the MRT-LBM is much more stable and accurate than the LBGK model. A reasonable iterative sequence and evolution number for each LBM are proposed by considering the properties of the coupled LBM. The accuracy and stability of the presented coupled LBM are also discussed through simulating electro-osmotic flows (EOF) in micro-channels. Furthermore, to test the applicability of it, the EOF with non-uniform surface potential in micro-channels based on the Nernst–Planck model is simulated. And we investigate the effects of non-uniform surface potential on the pattern of the EOF at different external applied electric fields. Finally, a comparison of the difference between the Nernst–Planck model and the Poisson–Boltzmann model is presented.     

A Prolate-Element Method for Nonlinear PDEs on the Sphere

A p-type spectral-element method using prolate spheroidal wave functions (PSWFs) as basis functions, termed as the prolate-element method, is developed for solving partial differential equations (PDEs) on the sphere. The gridding on the sphere is based on a projection of the prolate-Gauss-Lobatto points by using the cube-sphere transform, which is free of singularity and leads to quasi-uniform grids. Various numerical results demonstrate that the proposed prolate-element method enjoys some remarkable advantages over the polynomial-based element method: (i) it can significantly relax the time step size constraint of an explicit time-marching scheme, and (ii) it can increase the accuracy and enhance the resolution.     

Development and Application of the Cauchy–Poisson Method to Layer Elastodynamics and the Timoshenko Equation

We consider a generalization of the Cauchy–Poisson method to an n-dimensional Euclidean space and its application to the construction of hyperbolic approximations. In Euclidean space, constraints on derivatives are introduced. The principle of hyperbolic degeneracy in terms of parameters is formulated and its implementation in the form of necessary and sufficient conditions is given. As the particular case of a four-dimensional space with preserving operators up to the sixth order a generalized hyperbolic equation is obtained for bending vibrations of plates with coefficients dependent only on the Poisson number. As special cases, this equation includes all the well-known Bernoulli–Euler, Kirchhoff, Rayleigh, and Timoshenko equations. As a development of Maxwell’s and Einstein’s research on the propagation of perturbations with finite velocity in a continuous medium, Tymoshenko’s non-trivial construction of the equation for bending vibrations of a beam is noted.     

Guidelines for Poisson Solvers on Irregular Domains with Dirichlet Boundary Conditions Using the Ghost Fluid Method

We consider the variable coefficient Poisson equation with Dirichlet boundary conditions on irregular domains. We present numerical evidence for the accuracy of the solution and its gradients for different treatments at the interface using the Ghost Fluid Method for Poisson problems of Gibou et al. (J. Comput. Phys. 176:205–227, 2002; 202:577–601, 2005). This paper is therefore intended as a guide for those interested in using the GFM for Poisson-type problems (and by consequence diffusion-like problems and Stefan-type problems) by providing the pros and cons of the different choices for defining the ghost values and locating the interface. We found that in order to obtain second-order-accurate gradients, both a quadratic (or higher order) extrapolation for defining the ghost values and a quadratic (or higher order) interpolation for finding the interface location are required. In the case where the ghost values are defined by a linear extrapolation, the gradients of the solution converge slowly (at most first order in average) and the convergence rate oscillates, even when the interface location is defined by a quadratic interpolation. The same conclusions hold true for the combination of a quadratic extrapolation for the ghost cells and a linear interpolation. The solution is second-order accurate in all cases. Defining the ghost values with quadratic extrapolations leads to a non-symmetric linear system with a worse conditioning than that of the linear extrapolation case, for which the linear system is symmetric and better conditioned. We conclude that for problems where only the solution matters, the method described by Gibou, F., Fedkiw, R., Cheng, L.-T. and Kang, M. in (J. Comput. Phys. 176:205–227, 2002) is advantageous since the linear system that needs to be inverted is symmetric. In problems where the solution gradient is needed, such as in Stefan-type problems, higher order extrapolation schemes as described by Gibou, F. and Fedkiw, R. in (J. Comput. Phys. 202:577–601, 2005) are desirable.     

A New Family of Mixed Methods for the Reissner-Mindlin Plate Model Based on a System of First-Order Equations

The mixed method for the biharmonic problem introduced in (Behrens and Guzmán, SIAM J. Numer. Anal., 2010) is extended to the Reissner-Mindlin plate model. The Reissner-Mindlin problem is written as a system of first order equations and all the resulting variables are approximated. However, the hybrid form of the method allows one to eliminate all the variables and have a final system only involving the Lagrange multipliers that approximate the transverse displacement and rotation at the edges of the triangulation. Mixed finite element spaces for elasticity with weakly imposed symmetry are used to approximate the bending moment matrix. Optimal estimates independent of the plate thickness are proved for the transverse displacement, rotations and bending moments. A post-processing technique is provided for the displacement and rotations variables and we show numerically that they converge faster than the original approximations.     

Stable Boundary Treatment for the Wave Equation on Second-Order Form

A stable and accurate boundary treatment is derived for the second-order wave equation. The domain is discretized using narrow-diagonal summation by parts operators and the boundary conditions are imposed using a penalty method, leading to fully explicit time integration. This discretization yields a stable and efficient scheme. The analysis is verified by numerical simulations in one-dimension using high-order finite difference discretizations, and in three-dimensions using an unstructured finite volume discretization.     

Analysis of the Finite Element Method for the Laplace–Beltrami Equation on Surfaces with Regions of High Curvature Using Graded Meshes

We derive error estimates for the piecewise linear finite element approximation of the Laplace–Beltrami operator on a bounded, orientable, \(C^3\), surface without boundary on general shape regular meshes. As an application, we consider a problem where the domain is split into two regions: one which has relatively high curvature and one that has low curvature. Using a graded mesh we prove error estimates that do not depend on the curvature on the high curvature region. Numerical experiments are provided.     

A Rectangular Finite Volume Element Method for a Semilinear Elliptic Equation

In this paper we extend the idea of interpolated coefficients for semilinear problems to the finite volume element method based on rectangular partition. At first we introduce bilinear finite volume element method with interpolated coefficients for a boundary value problem of semilinear elliptic equation. Next we derive convergence estimate in H ¹-norm and superconvergence of derivative. Finally an example is given to illustrate the effectiveness of the proposed method. This work is supported by Program for New Century Excellent Talents in University of China State Education Ministry, National Science Foundation of China, the National Basic Research Program under the Grant (2005CB321703), the key project of China State Education Ministry (204098), Scientific Research Fund of Hunan Provincial Education Department, China Postdoctoral Science Foundation (No. 20060390894) and China Postdoctoral Science Foundation (No. 20060390894).     

A Dual-Petrov-Galerkin Method for the Kawahara-Type Equations

An efficient and accurate numerical scheme is proposed, analyzed and implemented for the Kawahara and modified Kawahara equations which model many physical phenomena such as gravity-capillary waves and magneto-sound propagation in plasmas. The scheme consists of dual-Petrov-Galerkin method in space and Crank-Nicholson-leap-frog in time such that at each time step only a sparse banded linear system needs to be solved. Theoretical analysis and numerical results are presented to show that the proposed numerical is extremely accurate and efficient for Kawahara type equations and other fifth-order nonlinear equations. This work is partially supported by the National Science Council of the Republic of China under the grant NSC 94-2115-M-126-004 and 95-2115-M-126-003. This work is partially supported by NSF grant DMS-0610646.     

Direct Discretization Method for the Cahn–Hilliard Equation on an Evolving Surface

We propose a simple and efficient direct discretization scheme for solving the Cahn–Hilliard (CH) equation on an evolving surface. By using a conservation law and transport formulae, we derive the CH equation on evolving surfaces. An evolving surface is discretized using an unstructured triangular mesh. The discrete CH equation is defined on the surface mesh and its dual surface polygonal tessellation. The evolving triangular surfaces are then realized by moving the surface nodes according to a given velocity field. The proposed scheme is based on the Crank–Nicolson scheme and a linearly stabilized splitting scheme. The scheme is second-order accurate, with respect to both space and time. The resulting system of discrete equations is easy to implement, and is solved by using an efficient biconjugate gradient stabilized method. Several numerical experiments are presented to demonstrate the performance and effectiveness of the proposed numerical scheme.     

A Decomposition and Coordination Scheduling Method for Flow-shop Problem Based on TOC

There are many flow shop problems of throughput (denoted by FSPT) with constraints of due date in real production planning and scheduling. In this paper, a decomposition and coordination algorithm is proposed based on the analysis of FSPT and under the support of TOC (theory of constraint). A flow shop is at first decomposed into two subsystems named PULL and PUSH by means of bottleneck. Then the subsystem is decomposed into single machine scheduling problems, so the original NP-HARD problem can be transferred into a serial of single machine optimization problems finally. This method reduces the computational complexity, and has been used in a real project successfully.     

A Logical Design Method for Relational Databases Based on Generalization and Aggregation Semantics

In this paper,a series of esign methods for relational databases based on generalization and aggregation semantics is set up.The relationship between a class and its subclass s considered as a scheme constraint.The concept of inheritance dependencies,which describes the multiple inheritance among schemes, is presented in the paper.It is shown that the inference rules for inheritance dependencies are sound and complete.Furthermore,a series of results about the closure of inheritance dependencies and the minimal set of inheritance dependencies,which are analogues to functional dependencies,is obtained.In order to describe the aggregation semantices,the concept of aggregation dependencies is given.It is easy to implement these constraints under relational database management systems.     

A Neural Network Constructing Method Based on Many Kinds of Neurons Model

In this paper, the geometrical meaning of the neurons in BPNN （Back Propagation Neural Network） and RBFNN （Radial Basis Function Neural Network） in the High Dimensional Space （HDS） is analyzed, and a new type of NN is built based on many kinds of neurons. This new NN solves the covering problem of the complex geometry shape in the high dimensional feature space which is raised by the Biomimetic Pattern Recognition （BPR）. This new NN-Constructing method has broken the traditional thinking mode of constructing NN which only uses one kind of neuron.     

An easy and efficient combination of the Mixed Finite Element Method and the Method of Lines for the resolution of Richards’ Equation

In this work, the Mixed Hybrid Finite Element (MHFE) method is combined with the Method Of Lines (MOL) for an accurate resolution of the Richard's Equation (RE). The combination of these methods is often complicated since hybridization requires a discrete approximation of the time derivative whereas with the MOL, it should remain continuous. In this paper, we use the new mass lumping technique developed in Younes et al. [Younes, A., Ackerer, P., Lehmann, F., 2006. A new mass lumping scheme for the mixed hybrid finite element method. International Journal for Numerical Methods in Engineering 67, pp. 89–107.] for the MHFE method. With this formulation, the MOL is easily implemented and sophisticated time integration packages can be used without significant amount of work.Numerical simulations are performed on both homogeneous and heterogeneous porous media to show the efficiency and robustness of the developed scheme.     

The WKB Local Discontinuous Galerkin Method for the Simulation of Schrödinger Equation in a Resonant Tunneling Diode

In this paper, we develop a multiscale local discontinuous Galerkin (LDG) method to simulate the one-dimensional stationary Schrödinger-Poisson problem. The stationary Schrödinger equation is discretized by the WKB local discontinuous Galerkin (WKB-LDG) method, and the Poisson potential equation is discretized by the minimal dissipation LDG (MD-LDG) method. The WKB-LDG method we propose provides a significant reduction of both the computational cost and memory in solving the Schrödinger equation. Compared with traditional continuous finite element Galerkin methodology, the WKB-LDG method has the advantages of the DG methods including their flexibility in h-p adaptivity and allowance of complete discontinuity at element interfaces. Although not addressed in this paper, a major advantage of the WKB-LDG method is its feasibility for two-dimensional devices.     

A Time Series Data Mining Based on ARMA and MLFNN Model for Intrusion Detection

This paper investigates the issue on how to effectively model time series with a new algorithm given by a Multilayer Feedforward Neural Network （MLFNN） and an Autoregressive Moving Average （ARMA）. The static nonlinear part is modeled by MLFNN, and the linear part is modeled by an ARMA model, The algorithm is developed for estimating the weights of the MLFNN and the parameters of ARMA model. To illustrate the feasibility and simplicity of the above procedures for time series data mining, the problem of measuring normality in H＇FI＇P traffic for the purpose of anomaly-based network intrusion detection is addressed. The detection results provided by the approach of this paper show important improvements, both in detection ratio and regarding false alarms, in comparison with those obtained using other current techniques, Simulation examples are included to illustrate the performance of the proposed method.     

A Hybrid Algorithm for the Baer-Nunziato Model Using the Riemann Invariants

The paper considers the Baer-Nunziato model for two-phase flow in porous media, with discontinuous porosity. Computing solutions of the Riemann problem rests on capturing the jump in the solution across the porosity jump. A recent study (Lowe in J. Comput. Phys. 204:598–632, 2005) showed that numerical discretizations may fail to correctly capture the jump conditions across the so-called compaction wave, and yield incorrect solutions. We have formulated the Baer-Nunziato system using the Riemann invariants across the porosity jump, and propose a hybrid algorithm that uses the Riemann invariants formulation across the compaction wave, and the conservative formulation away from the compaction wave. The paper motivates and describes the hybrid scheme and present numerical results.