The variational iteration method for solitary patterns solutions of gBBM equation

We consider solitary patterns solutions of generalized Benjamin–Bona–Mahony equations (shortly gBBM). The variational iteration method (shortly VIM) is applied for the numerical solution subject to appropriate initial condition. The numerical solutions of our model equation are calculated in the form of convergence power series with easily computable components. The VIM performs extremely well in terms of accuracy, efficiently, simplicity, stability and reliability.     

直接解调成像的快速算法

直接解调方法(Direct Demodulate Method, DD)中运用的最多的迭代方法是Richardson-Lucy (RL)迭代. RL迭代的公式可以改写成矩阵形式, 其中包含了主要计算量的两次矩阵乘法在点扩展函数满足平移不变性的情况下可以写成卷积的形式, 而卷积可以使用快速傅里叶变换(Fast Fourier Transform, FFT)做快速计算. 详细介绍了上述过程, 并将该方法应用到了硬X射线调制望远镜(Hard X-ray Modulate Telescope,HXMT)的DD成像中, 通过理论的和模拟的计算对比了优化前后DD方法对计算资源的开销.     

Initial guess by improved population-based intelligent algorithms for large inter-frame deformation measurement using digital image correlation

Digital image correlation (DIC) has received a widespread research and application in experimental mechanics. In DIC, the performance of subpixel registration algorithm (e.g., Newton-Raphson method, quasi-Newton method) relies heavily on the initial guess of deformation. In the case of small inter-frame deformation, the initial guess could be found by simple search scheme, the coarse-fine search for instance. While for large inter-frame deformation, it is difficult for simple search scheme to robustly estimate displacement parameters and deformation parameters simultaneously with low computational cost. In this paper, we proposed three improving strategies, i.e. Q-stage evolutionary strategy (T), parameter control strategy (C) and space expanding strategy (E), and then combined them into three population-based intelligent algorithms (PIAs), i.e. genetic algorithm (GA), differential evolution (DE) and particle swarm optimization (PSO), and finally derived eighteen different algorithms to calculate the initial guess for qN. The eighteen algorithms were compared in three sets of experiments including large rigid body translation, finite uniaxial strain and large rigid body rotation, and the results showed the effectiveness of proposed improving strategies. Among all compared algorithms, DE-TCE is the best which is robust, convenient and efficient for large inter-frame deformation measurement.     

拟线性双曲抛物耦合组强适定非线性初边值问题

本文用叠代方法得到强适定双曲抛物耦合系统非线性初始边值问题局部解的存在唯一性。     

复合材料迭层板弯曲分步分析法

本文提出了一种用于分析复合材料迭层板弯曲的新方法。首先利用经典理论进行初步分析,之后,据所得横向剪力,设定横向剪切应变,再进一步分析。本文方法基本未知函数少,基本方程易解,计算精度较高。     

BECOOL: Ballooning eigensolver with COOL finite elements

An incompressible variational ideal ballooning mode equation is discretized with the COOL finite element discretization scheme using basis functions composed of variable order Legendre polynomials. This reduces the second order ordinary differential equation to a special block pentadiagonal matrix equation that is solved using an inverse vector iteration method. A benchmark test of BECOOL (Ballooning Eigensolver using COOL finite elements) with second order Legendre polynomials recovers precisely the eigenvalues computed by the VVBAL shooting code. Timing runs reveal the need to determine an optimal lower order case. Eigenvalue convergence runs show that cubic Legendre polynomials construct the optimal ballooning mode equation for intensive computations.     

On the solutions of the time-delayed Burgers equation

The time-delayed Burgers equation is introduced and the improved tanh-function method is used to construct exact multiple-soliton and triangular periodic solutions. For an understanding of the nature of the exact solutions that contained the time-delay parameter, we calculated the numerical solutions of this equation by using the Adomian decomposition method and the variational iteration method (IVM) to the boundary value problem.     

Orthogonal similarity transformation into block‐semiseparable matrices of semiseparability rank k

Very recently, an algorithm, which reduces any symmetric matrix into a semiseparable one of semi‐ separability rank 1 by similar orthogonality transformations, has been proposed by Vandebril, Van Barel and Mastronardi. Partial execution of this algorithm computes a semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the Lanczos' process applied to the original matrix. Also a kind of nested subspace iteration is performed at each step. In this paper, we generalize the above results and propose an algorithm to reduce any symmetric matrix into a similar block‐semiseparable one of semiseparability rank k, with k ∈ ?, by orthogonal similarity transformations. Also in this case partial execution of the algorithm computes a block‐semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the block‐Lanczos' process with k starting vectors, applied to the original matrix. Subspace iteration is performed at each step as well. Copyright © 2005 John Wiley & Sons, Ltd.     

Iteration 2-theories

The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteration in conjunction with horizontal and vertical composition in all algebraically complete categories. We give a concrete representation of the free iteration 2-theory generated by a 2-signature.