A Chebyshev pseudospectral multidomain method for the soliton solution of coupled nonlinear Schrödinger equations

The collision of solitary waves is an important problem in both physics and applied mathematics. In this paper, we study the solution of coupled nonlinear Schrödinger equations based on pseudospectral collocation method with domain decomposition algorithm for approximating the spatial variable. The problem is converted to a system of nonlinear ordinary differential equations which will be integrated in time by explicit Runge–Kutta method of order four. The multidomain scheme has much better stability properties than the single domain. Thus this permits using much larger step size for the time integration which fulfills stability restrictions. The proposed scheme reduces the effects of round-of-error for the Chebyshev collocation and also uses less memory without sacrificing the accuracy. The numerical experiments are presented which show the multidomain pseudospectral method has excellent long-time numerical behavior and preserves energy conservation property.     

A new second-order accurate time discretization method for the nonlinear cubic Schrödinger equation

A new second-order accurate semi-analytical time discretization method is introduced for the numerical solution of the one-dimensional nonlinear cubic Schrödinger equation. This method is based on the combination of the method of lines, Crank–Nicolson method, Newton method and Lanczos’ Tau method. It is a self-starting averaged two-time-level scheme that has proved to be stable, accurate and energy conservative for long time integration periods. At each time level, approximate solutions are sought on a segmented spatial interval as finite expansions in terms of a given orthogonal polynomial basis mapped appropriately onto each spatial subsegment. We have carried out numerical simulation concerning several cases for the propagation, collision and the bound states of solitons. Accurate results have been obtained using Chebyshev and Legendre polynomials. These results are well comparable with other published results obtained by the use of various standard numerical methods.     

Integrating synchronization with priority into a Kronecker representation

The compositional representation of a Markov chain using Kronecker algebra, according to a compositional model representation as a superposed generalized stochastic Petri net or a stochastic automata network, has been studied for a while. In this paper we describe a Kronecker expression and associated data structures, that allows to handle nets with synchronization over activities of different levels of priority. New algorithms for these structures are provided to perform an iterative solution method of Jacobi or Gauss–Seidel type. These algorithms are implemented in the APNN Toolbox. We use this implementation in combination with GreatSPN and exercise an example that illustrates characteristics of the presented algorithms.     

Modeling of failure in composites by X-FEM and level sets within a multiscale framework

Composites or multi-phase materials are characterized by a distinct heterogeneous microstructure. The failure modes of these materials are governed by several micromechanical effects like debonding phenomena and matrix cracks. The overall mechanical behavior of composites in the linear as well as the nonlinear regime is not only governed by the material properties of the components and their bonds but also by the material layout. In the present contribution the material structure is resolved and modeled on a small scale allowing to deal with these effects. For the numerical simulation we apply a combination of the extended finite-element method (X-FEM) [N. Moës, J. Dolbow, T. Belytschko, A finite element method for crack growth without remeshing, Int. J. Numer. Methods Engrg. 46 (1999) 131-150] and the level set method (LSM) [S. Osher, J. Sethian, Fronts propagating with curvature dependent speed: algorithms based on Hamilton-Jacobi formulations, J. Comput. Phys. 79 (1988) 12-49]. In the X-FEM the finite-element approximation is enriched by appropriate functions through the concept of partition of unity. The geometry of material interfaces and cracks is described by the LSM. The combination of both, X-FEM and LSM, turns out to be very natural since the enrichment can be described and even constructed in terms of level set functions. In order to project the material behavior modeled on a small scale onto the large or structural scale, we employ the variational multiscale method (VMM) [T. Hughes, G. Feijoo, L. Mazzei, J.-B. Quiney, The variational multiscale method - a paradigm for computational mechanics, Comput. Methods Appl. Mech. Engrg. 166 (1998) 3-24]. This concept is based on an additive split of the displacement field into large and small scale parts. For an efficient solution of the discrete problem we postulate that the small scale displacements are locally supported; in order to achieve this objective one has to assume appropriate constraint conditions. It can be shown that the applied numerical model allows a considerable flexibility concerning the variation of the material design and consequently of the mechanical behavior of a composite.     

Spectral multidomain technique with Local Fourier Basis II: Decomposition into cells

The spectral multidomain method for the solution of 2-D elliptic and parabolic PDE's is developed. The computational region is decomposed into rectangular cells. A Local Fourier Basis technique is implemented for the discretization in space. Such a technique enables the global (typically 10⁴–10⁵) matching relations for the interface unknows to be decoupled into a set of relations for only few interface points at a time.This research is supported partly by a grant from the French-Israeli Binational Foundation for 1991–1992.     

A solution method for a two-layer sustainable supply chain distribution model

This article presents an effective solution method for a two-layer, NP-hard sustainable supply chain distribution model. A DoE-guided MOGA-II optimiser based solution method is proposed for locating a set of non-dominated solutions distributed along the Pareto frontier. The solution method allows decision-makers to prioritise the realistic solutions, while focusing on alternate transportation scenarios. The solution method has been implemented for the case of an Irish dairy processing industry׳s two-layer supply chain network. The DoE generates 6100 real feasible solutions after 100 generations of the MOGA-II optimiser which are then refined using statistical experimentation. As the decision-maker is presented with a choice of several distribution routes on the demand side of the two-layer network, TOPSIS is applied to rank the set of non-dominated solutions thus facilitating the selection of the best sustainable distribution route. The solution method characterises the Pareto solutions from disparate scenarios through numerical and statistical experimentations. A set of realistic routes from plants to consumers is derived and mapped which minimises total CO₂ emissions and costs where it can be seen that the solution method outperforms existing solution methods.     

Pseudospectral method of solution of the Fitzhugh–Nagumo equation

We present a study of the convergence of different numerical schemes in the solution of the Fitzhugh–Nagumo equations in the form of two coupled reaction diffusion equations for activator and inhibitor variables. The diffusion coefficient for the inhibitor is taken to be zero. The Fitzhugh–Nagumo equations, have spatial and temporal dynamics in two different scales and the solutions exhibit shock-like waves. The numerical schemes employed are a Chebyshev multidomain method, a finite difference method and the method developed by Barkley [D. Barkley, A model for fast computer simulation of excitable media, Physica D, 49 (1991) 61–70]. We consider two different models for the local dynamics. We present results for plane wave propagation in one dimension and spiral waves for two dimensions. We use an operator splitting method with the Chebyshev multidomain approach in order to reduce the computational time. Zero flux boundary conditions are imposed on the solutions.     

一种LU分解与迭代法的结合策略及算法实现

在矩阵求解算法中，直接法或迭代法都不能有效地求解大规模稀疏或病态矩阵,因此提出一种LU分解与迭代法结合的策略。采用LU分解对矩阵进行预处理，以提高迭代法的收敛性,并采用一种判断策略使矩阵的LU分解结果可最大限度地重复利用。此结合策略应用于两种共轭梯度（CG）法，得到CLUCG和CLUTCG两种算法。它们已应用于模拟和混合信号电路模拟器ZeniVDE中。大量实验结果表明此结合策略是很有效的，得到的两种算法具有较快的速度和较好的收敛性。     

Theoretically supported scalable BETI method for variational inequalities

Summary The Boundary Element Tearing and Interconnecting (BETI) methods were recently introduced as boundary element counterparts of the well established Finite Element Tearing and Interconnecting (FETI) methods. Here we combine the BETI method preconditioned by the projector to the “natural coarse grid” with recently proposed optimal algorithms for the solution of bound and equality constrained quadratic programming problems in order to develop a theoretically supported scalable solver for elliptic multidomain boundary variational inequalities such as those describing the equilibrium of a system of bodies in mutual contact. The key observation is that the “natural coarse grid” defines a subspace that contains the solution, so that the preconditioning affects also the non-linear steps. The results are validated by numerical experiments.      

A truncated Legendre spectral method for solving numerical differentiation

A numerical differentiation problem for a given function with noisy data is discussed in this paper. A truncated spectral method has been introduced to deal with the ill-posedness of the problem. The theoretical analysis shows that the smoother the genuine solution, the higher the convergence rate of the numerical solution by our method. Numerical examples are also given to show the efficiency of the method.     

The Chebyshev multidomain approach to stiff problems in fluid mechanics

The Chebyshev multidomain technique for calculating solutions with steep gradients is first discussed regarding accuracy and stability in case of simple model equations. Then the method is described for the solution of the Navier-Stokes equations and applications to double-diffusive convection exhibiting thin inner layers are presented.     

Two-dimensional differential transform method,Adomian's decomposition method,and variational iteration method for partial differential equations

The implementation of the two-dimensional differential transform method (DTM), Adomian's decomposition method (ADM), and the variational iteration method (VIM) in the mathematical applications of partial differential equations is examined in this paper. The VIM has been found to be particularly valuable as a tool for the solution of differential equations in engineering, science, and applied mathematics. The three methods are compared and it is shown that the VIM is more efficient and effective than the ADM and the DTM, and also converges to its exact solution more rapidly. Numerical solutions of two examples are calculated and the results are presented in tables and figures.     

Numerical solution of incompressible Navier–Stokes equations using a fractional-step approach

A fractional step method for the solution of steady and unsteady incompressible Navier–Stokes equations is outlined. The method is based on a finite-volume formulation and uses the pressure in the cell center and the mass fluxes across the faces of each cell as dependent variables. Implicit treatment of convective and viscous terms in the momentum equations enables the numerical stability restrictions to be relaxed. The linearization error in the implicit solution of momentum equations is reduced by using three subiterations in order to achieve second order temporal accuracy for time-accurate calculations. In spatial discretizations of the momentum equations, a high-order (third and fifth) flux-difference splitting for the convective terms and a second-order central difference for the viscous terms are used. The resulting algebraic equations are solved with a line-relaxation scheme which allows the use of large time step. A four color ZEBRA scheme is employed after the line-relaxation procedure in the solution of the Poisson equation for pressure. This procedure is applied to a Couette flow problem using a distorted computational grid to show that the method minimizes grid effects. Additional benchmark cases include the unsteady laminar flow over a circular cylinder for Reynolds numbers of 200, and a 3-D, steady, turbulent wingtip vortex wake propagation study. The solution algorithm does a very good job in resolving the vortex core when fifth-order upwind differencing and a modified production term in the Baldwin–Barth one-equation turbulence model are used with adequate grid resolution.     

基于局部搜索和遗传算法的激光切割路径优化

为了缩短激光加工时间,提高加工效率,提出了一种新的局部搜索法与遗传算法相结合的激光切割路径优化算法。该算法从加工轮廓中提取节点,通过局部搜索法对节点进行局部路径优化,再运用的遗传算法求得近似最优解,遗传算法中的选择算子改进为基于相对适应度的轮盘赌选择算子。详细介绍了算法的原理及实现,通过编程仿真证明该算法与传统的遗传算法相比具有良好的优化效果,可明显缩短加工路径,减少加工时间,提高加工效率。     

Optimized DOA estimation for an array antenna

Abstract—In this paper, we propose a Direction-of-Arrival (DOA) estimation technique that allows application of the signal subspace method. In the case when interference signals are coherent to the desired signals, the performance of the subspace method is reduced remarkably. As a solution to this problem, the spatial smoothing method has been proposed and applied. With the orthogonal element in the weighted spatial smoothing method being the calculation process to realize the MUSIC method, which is the most frequently used subspace, it becomes more complex. In order to solve this problem, we maximize the performance of DOA estimation by assigning a weight vector, which is directly orthogonal to the signal subspace. In this paper we compare the efficiency of the proposed algorithm with a modified spatial smoothing method via simulation results. The text was submitted by the authors in English.     

An adaptive method of lines solution of the Korteweg-de Vries equation

Following a method of lines formulation, the Korteweg-de Vries equation is solved using a static spatial remeshing algorithm based on the equidistribution principle, which allows the number of nodes to be significantly reduced as compared to a fixed-grid solution. Several finite difference schemes, including direct and stagewise procedures, are compared and the results of a large number of computational experiments are presented, which demonstrate that the selection of a spatial approximation scheme for the third-order derivative term is the primary determinant of solution accuracy.     

A Meshless Method of Solving Three-Dimensional Nonstationary Heat Conduction Problems in Anisotropic Materials

The authors describe a meshless method for solving three-dimensional nonstationary heat conduction problems in anisotropic materials. A combination of dual reciprocity method using anisotropic radial basis function and method of fundamental solutions is used to solve the boundary-value problem. The method of fundamental solutions is used to obtain the homogenous part of the solution; the dual reciprocity method with the use of anisotropic radial basis functions allows obtaining a partial solution. The article shows the results of numerical solutions of two benchmark problems obtained by the developed numerical method; average relative, average absolute, and maximum errors are calculated.

     

Using augmented Lagrangian particle swarm optimization for constrained problems in engineering">Using augmented Lagrangian particle swarm optimization for constrained problems in engineering

The comparatively new stochastic method of particle swarm optimization (PSO) has been applied to engineering problems especially of nonlinear, non-differentiable, or non-convex type. Its robustness and its simple applicability without the need for cumbersome derivative calculations make PSO an attractive optimization method. However, engineering optimization tasks often consist of problem immanent equality and inequality constraints which are usually included by inadequate penalty functions when using stochastic algorithms. The simple structure of basic particle swarm optimization characterized by only a few lines of computer code allows an efficient implementation of a more sophisticated treatment of such constraints. In this paper, we present an approach which utilizes the simple structure of the basic PSO technique and combines it with an extended non-stationary penalty function approach, called augmented Lagrange multiplier method, for constraint handling where ill conditioning is a far less harmful problem and the correct solution can be obtained even for finite penalty factors. We describe the basic PSO algorithm and the resulting method for constrained problems as well as the results from benchmark tests. An example of a stiffness optimization of an industrial hexapod robot with parallel kinematics concludes this paper and shows the applicability of the proposed augmented Lagrange particle swarm optimization to engineering problems.     

Simultaneous algorithm for trajectory planning

This paper addresses the solution of smooth trajectory planning for industrial robots in environments with obstacles using a direct method, creating the trajectory gradually as the robot moves. The presented method deals with the uncertainties associated with the lack of knowledge of kinematic properties of intermediate via‐points since they are generated as the algorithm evolves looking for the solution. Several cost functions are also proposed, which use the time that has been calculated to guide the robot motion. The method has been applied successfully to a PUMA 560 robot and four operational parameters (execution time, computational time, distance travelled and number of configurations) have been computed to study the properties and influence of each cost function on the trajectory obtained. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

基于GIS的物流配送系统路径优化的算法

物流配送系统的车辆旅途问题是一个NP-hard问题。文中针对某烟草物流配送系统,将其配送路径抽象为TSP问题,完成现实空间到问题空间的映射,使实际问题转化为平衡运输问题的数学模型,采用单纯形法和贪婪法配合使用,从而求出最优解或满意解。实践证明:这种组合方式是相当成功的。