Multi-strategy hybrid whale optimization algorithms for complex constrained optimization problems

A multi-strategy hybrid whale optimization algorithm(MSHWOA)for complex constrained optimization problems is proposed to overcome the drawbacks of easily trapping into local optimum,slow convergence speed and low optimization precision.Firstly,the population is initialized by introducing the theory of good point set,which increases the randomness and diversity of the population and lays the foundation for the global optimization of the algorithm.Then,a novel linearly update equation of convergence factor is designed to coordinate the abilities of exploration and exploitation.At the same time,the global exploration and local exploitation capabilities are improved through the siege mechanism of Harris Hawks optimization algorithm.Finally,the simulation experiments are conducted on the 6 benchmark functions and Wilcoxon rank sum test to evaluate the optimization performance of the improved algorithm.The experimental results show that the proposed algorithm has more significant improvement in optimization accuracy,convergence speed and robustness than the comparison algorithm.

Improved gradient iterative algorithms for solving Lyapunov matrix equations

In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.

An Improved Measurement Uncertainty Calculation Method of Profile Error for Sculptured Surfaces

The current researches mainly adopt "Guide to the expression of uncertainty in measurement(GUM)" to calculate the profile error. However, GUM can only be applied in the linear models. The standard GUM is not appropriate to calculate the uncertainty of profile error because the mathematical model of profile error is strongly non-linear. An improved second-order GUM method(GUMM) is proposed to calculate the uncertainty. At the same time, the uncertainties in different coordinate axes directions are calculated as the measuring points uncertainties. In addition, the correlations between variables could not be ignored while calculating the uncertainty. A k-factor conversion method is proposed to calculate the converge factor due to the unknown and asymmetrical distribution of the output quantity. Subsequently, the adaptive Monte Carlo method(AMCM) is used to evaluate whether the second-order GUMM is better. Two practical examples are listed and the conclusion is drawn by comparing and discussing the second-order GUMM and AMCM. The results show that the difference between the improved second-order GUM and the AMCM is smaller than the difference between the standard GUM and the AMCM. The improved second-order GUMM is more precise in consideration of the nonlinear mathematical model of profile error.

A COMBINED TECHNIQUE FOR SOLUTION OF PDE＇s VIA THE GENERALIZED DOMAIN DECOMPOSITION METHOD

The Domain Decomposition Method(DDM) is a powerful approach to solving maily types of PDE's. DDM is especially suitable for massively Parallel computers. In the past, most research on DDM has focused on the domain splitting technique. In this paper. we focus our attention on use of a combination of techniques to solve each subproblem. The central question with DDM is that of how to doal with the pseodoboundary conditions. Here, we introduce a set of operators which act on the pseudo-boundaries in the solution process, referring to this new. procedure as the 'Generalized Domain Decomposition A.Jlethod(GDDM).' We have already obtained convergence factors for GDDM with certain classes of PDE's. These ctonvergence factors show that we can derive exact solutions of the whole problem for certain types of PDE's, and can get superior speed of convergence for other types.

ON BLOCK PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION PROBLEMS

Recently, Bal proposed a block-counter-diagonal and a block-counter-triangular precon- ditioning matrices to precondition the GMRES method for solving the structured system of linear equations arising from the Galerkin finite-element discretizations of the distributed control problems in （Computing 91 （2011） 379-395）. He analyzed the spectral properties and derived explicit expressions of the eigenvalues and eigenvectors of the preconditioned matrices. By applying the special structures and properties of the eigenvector matrices of the preconditioned matrices, we derive upper bounds for the 2-norm condition numbers of the eigenvector matrices and give asymptotic convergence factors of the preconditioned GMRES methods with the block-counter-diagonal and the block-counter-triangular pre- conditioners. Experimental results show that the convergence analyses match well with the numerical results.