双目标瓶颈指派问题的遗传算法

给出一种双目标瓶颈指派问题的新模型,本模型结合了决策者和工人两方面的因素,特别之处在于考虑到了工人对工作的排名偏好.进而,将双目标瓶颈指派问题转化为单目标规划,并设计了解此问题的遗传算法,算法的解均为双目标瓶颈指派问题的Pareto最优解.     

关于Kenichiro的一个丢番图方程问题

研究了Kenichiro提出的轮换对称形式的丢番图方程,即方程ab bc ca=ya+b+c3的求解问题,利用素数整除的一些性质,证明了该方程仅有平凡解a=b=c以及非平凡解(a,b,c)=(k,k,4k),(k,4k,k),(4k,k,k)(k∈N),从而完全解决了这个方程.     

Twelve limit cycles around a singular point in a planar cubic-degree polynomial system

In this paper, we prove the existence of 12 small-amplitude limit cycles around a singular point in a planar cubic-degree polynomial system. Based on two previously developed cubic systems in the literature, which have been proved to exhibit 11 small-amplitude limit cycles, we applied a different method to show 11 limit cycles. Moreover, we show that one of the systems can actually have 12 small-amplitude limit cycles around a singular point. This is the best result so far obtained in cubic planar vector fields around a singular point.     

Riemann-Stieltjes积分边值问题正解的存在唯一性

利用解的先验估计和极值原理,研究了一类具有Riemann-Stieltjes积分边值问题正解的存在唯一性．     

四阶微分方程三点边值问题三个正解的存在性

在四阶微分方程非线性项f中含有未知函数“的二阶导数u”的情况下,运用Avery-Peterson不动点定理,研究了一类四阶微分方程三点边值问题三个正解的存在性,得到了该类边值问题存在三个正解的充分条件．     

Frequency domain Walsh functions and sequences: An introduction

In this letter, a new set of orthogonal band-limited basis functions is introduced. This set of basis functions is derived from the inverse Fourier transform of the frequency domain Walsh functions. The Fourier transforms of the Walsh functions were calculated by Siemens and Kitai in 1973 but they have been overlooked in the literature. Some of the properties of these functions are studied in this paper. Moreover, the orthogonal discrete version of these functions is obtained by truncation, sampling and orthogonalization utilizing the orthogonal Procrustes problem.     

Inverse subspace problems with applications

Given a square matrix A, the inverse subspace problem is concerned with determining a closest matrix to A with a prescribed invariant subspace. When A is Hermitian, the closest matrix may be required to be Hermitian. We measure distance in the Frobenius norm and discuss applications to Krylov subspace methods for the solution of large‐scale linear systems of equations and eigenvalue problems as well as to the construction of blurring matrices. Extensions that allow the matrix A to be rectangular and applications to Lanczos bidiagonalization, as well as to the recently proposed subspace‐restricted SVD method for the solution of linear discrete ill‐posed problems, also are considered.Copyright © 2013 John Wiley & Sons, Ltd.     

Approximation of inverse operators by a new family of high‐order iterative methods

The main goal of this paper is to approximate inverse operators by high‐order Newton‐type methods with the important feature of not using inverse operators. We analyse the semilocal convergence, the speed of convergence, and the efficiency of these methods. We determine that Chebyshev's method is the most efficient method and test it on two problems: one associated to the heat equation and the other one to a boundary value problem. We consider examples with matrices that are close to be singular and/or are badly conditioned. We check the robustness and the stability of the methods by considering situations with many steps and noised data. Copyright © 2013 John Wiley & Sons, Ltd.     

Imposing symmetry in augmented linear systems

This paper discusses the methods of imposing symmetry in the augmented system formulation (ASF) for least‐squares (LS) problems. A particular emphasis is on upper Hessenberg problems, where the challenge lies in leaving all zero‐by‐definition elements of the LS matrix unperturbed. Analytical solutions for optimal perturbation matrices are given, including upper Hessenberg matrices. Finally, the upper Hessenberg LS problems represented by unsymmetric ASF that indicate a normwise backward stability of the problem (which is not the case in general) are identified. It is observed that such problems normally arise from Arnoldi factorization (for example, in the generalized minimal residual (GMRES) algorithm). The problem is illustrated with a number of practical (arising in the GMRES algorithm) and some ‘purpose‐built’ examples. Copyright © 2014 John Wiley & Sons, Ltd.