L~1空间中积分方程特征值的一种数值解法

在L¹空间中讨论积分方程的特征值问题,给出另一种解法,证明所提出算法的合理性,并举出具体算例.     

超立方机上一阶线性递推问题的并行求解

本文考察解一阶线性递推问题的三个并行算法在超立方机上的实现方案.通过给出原始数据与超立方机之间的适当的映射以及算法执行过程中数据的通讯方式,奇偶消元法、奇偶约简法和变间距二分法都可以在起立方机上有效地执行.文中给出了这些算法的复杂性结论.最后,为进一步减少通讯费用,我们提供了一种复杂性更小的新算法,其通讯时间是与问题规模无关的常数.     

On Remes algoritha for the best Chebyshev approximation from varisolvent family

In this paper, Remes algorithm is applied to compute the numerical solution of the best chebyshev approximation from varisolvent family. Feasibility and convergence of the algorithm are discussed carefully.     

The Rank-$k$ Updating Algorithm for the Exact Inversion of Matrices with Integer Elements

In this paper, the numerical solution of the matrix problems over a ring of integers is discussed. The rank-$k$ updating algorithm for the exact inversion of a matrix is proposed. This algorithm is generally more effective than Jordan elimination. The common divisor of the numbers involved is reduced to avoid over-swelling of intermediate numbers.     

A parallel algorithm to solve the stable marriage problem

In this paper a parallel algorithm to solve the stable marriage problem is given. The worst case performance of this algorithm is stated. A theoretical analysis shows that the probability of the occurrence of this worst case is extremely small. For instance, if there are sixteen men and sixteen women involved, then the probability that the worst case occurs is only 10^–45. Possible future research is also discussed in this paper.     

Wolfe线搜索下一类混合共轭梯度法的全局收敛性

本文给出了一个新的共轭梯度公式,新公式在精确线搜索下与DY公式等价,并给出了新公式的相关性质.结合新公式和DY公式提出了一个新的混合共轭梯度法,新算法在Wolfe线搜索下产生一个下降方向,并证明了算法的全局收敛性,并给出了数值例子.     

Newton's method for the nonlinear complementarity problem: A B-differentiable equation approach

This paper describes a damped-Newton method for solving the nonlinear complementarity problem when it is formulated as a system of B-differentiable equations through the use of the Minty-map. This general Newton algorithm contains a one-dimensional line search and possesses a global convergence property under certain conditions; modifications and heuristic implementations of the algorithm for the case when these conditions do not hold are also discussed. The numerical experiments show that, in general, this new scheme is more efficient and robust than the traditional Josephy-Newton algorithm.     

AHP中判断矩阵一致性改进的迭代算法

本文研究了扰动矩阵与判断矩阵的不一致性的关系 ,提出了一种新的改进判断矩阵一致性的迭代算法 .     

无界域上大规模凹二次规划的一个算法

本文给出了无界域上大规模凹二次规划的一种下逼近算法,并证明了算法的收敛性。     

On the Method of Shortest Residuals for Unconstrained Optimization

The paper discusses several versions of the method of shortest residuals, a specific variant of the conjugate gradient algorithm, first introduced by Lemaréchal and Wolfe and discussed by Hestenes in a quadratic case. In the paper we analyze the global convergence of the versions considered. Numerical comparison of these versions of the method of shortest residuals and an implementation of a standard Polak–Ribière conjugate gradient algorithm is also provided. It supports the claim that the method of shortest residuals is a viable technique, competitive to other conjugate gradient algorithms.     

双层线性规划的一个全局优化方法

用线性规划对偶理论分析了双层线性规划的最优解与下层问题的对偶问题可行域上极点之间的关系，通过求得下层问题的对偶问题可行域上的极点，将双层线性规划转化为有限个线性规划问题，从而用线性规划方法求得问题的全局最优解．由于下层对偶问题可行域上只有有限个极点，所以方法具有全局收敛性．     

On the use of Monte Carlo simulation,cache and splitting techniques to improve the Clarke and Wright savings heuristics

This paper presents the SR-GCWS-CS probabilistic algorithm that combines Monte Carlo simulation with splitting techniques and the Clarke and Wright savings heuristic to find competitive quasi-optimal solutions to the Capacitated Vehicle Routing Problem (CVRP) in reasonable response times. The algorithm, which does not require complex fine-tuning processes, can be used as an alternative to other metaheuristics—such as Simulated Annealing, Tabu Search, Genetic Algorithms, Ant Colony Optimization or GRASP, which might be more difficult to implement and which might require non-trivial fine-tuning processes—when solving CVRP instances. As discussed in the paper, the probabilistic approach presented here aims to provide a relatively simple and yet flexible algorithm which benefits from: (a) the use of the geometric distribution to guide the random search process, and (b) efficient cache and splitting techniques that contribute to significantly reduce computational times. The algorithm is validated through a set of CVRP standard benchmarks and competitive results are obtained in all tested cases. Future work regarding the use of parallel programming to efficiently solve large-scale CVRP instances is discussed. Finally, it is important to notice that some of the principles of the approach presented here might serve as a base to develop similar algorithms for other routing and scheduling combinatorial problems.     

About the generalized LM-inverse and the weighted Moore-Penrose inverse

The recursive method for computing the generalized LM-inverse of a constant rectangular matrix augmented by a column vector is proposed in Udwadia and Phohomsiri (2007) [16] and [17]. The corresponding algorithm for the sequential determination of the generalized LM-inverse is established in the present paper. We prove that the introduced algorithm for computing the generalized LM-inverse and the algorithm for the computation of the weighted Moore-Penrose inverse developed by Wang and Chen (1986) in [23] are equivalent algorithms. Both of the algorithms are implemented in the present paper using the package MATHEMATICA. Several rational test matrices and randomly generated constant matrices are tested and the CPU time is compared and discussed.     

Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints

This paper considers a single machine scheduling problem with the learning effect and multiple availability constraints that minimizes the total completion time. To solve this problem, a new binary integer programming model is presented, and a branch-and-bound algorithm is also developed for solving the given problem optimally. Since the problem is strongly NP-hard, to find the near-optimal solution for large-sized problems within a reasonable time, two meta-heuristics; namely, genetic algorithm and simulated annealing are developed. Finally, the computational results are provided to compare the result of the binary integer programming, branch-and-bound algorithm, genetic algorithm and simulated annealing. Then, the efficiency of the proposed algorithms is discussed.     

素数阶群理论的量词消去算法及其上界

在以前的一些工作中,作者已经证明语言(?)={+,0,e)上素数阶群的理论T有量词消去性质并研究了它的判定问题的复杂性.本文在此基础上将利用T的判定问题的复杂性结果给出理论T的量词消去的一个算法,同时给出该算法的复杂性上界.     

Image segmentation by using the localized subspace iteration algorithm

An image segmentation algorithm called"segmentation based on the localized subspace iterations"(SLSI)is proposed in this paper.The basic idea is to combine the strategies in Ncut algorithm by Shi and Malik in 2000 and the LSI by E,Li and Lu in 2007.The LSI is applied to solve an eigenvalue problem associated with the affinity matrix of an image,which makes the overall algorithm linearly scaled.The choices of the partition number,the supports and weight functions in SLSI are discussed.Numerical experiments for real images show the applicability of the algorithm.     

An approximation scheme for the anisotropic and nonlocal mean curvature flow

In 2004 Chambolle proposed an algorithm for mean curvature flow based on a variational problem. Since then, the convergence, extensions and applications of his algorithm have been studied by many people. In this paper we give a proof of the convergence of an anisotropic version of Chambolle’s algorithm by use of the signed distance function. An application of our scheme to an approximation of the nonlocal curvature flow such as crystalline one is also discussed.     

Using genetic algorithm to solve dynamic cell formation problem

In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed using genetic algorithm (GA). Previous models presented in the literature contain some essential errors which will decline their advantageous aspects. In this paper these errors are discussed and a new improved formulation for dynamic cell formation (DCF) problem is presented. Due to the fact that CF is a NP-hard problem, solving the model using classical optimization methods needs a long computational time. Therefore the improved DCF model is solved using a proposed GA and the results are compared with the optimal solution and the efficiency of the proposed algorithm is discussed and verified.     

求Ramsey数下界的循环巧妙图搜索算法研究

本文研究通过构造循环巧妙图而搜寻Ｒａｍｓｅｙ数下界的算法，给出了一个效率较高的算法，该算法已经编程实现，并由此得出了一个具有４６点（４，７）循环巧妙图，从而证明了ｒ（４，７）≥４７。     

有向网络中具有一个枢纽点的最小支撑树的计算方法

对有向网络中具有一个枢纽点的支撑树的问题和性质进行了研究,给出了在有向网络图中寻找以某一定点为枢纽点的最小支撑树的计算方法,并对算法的复杂性进行了讨论,最后将该算法应用于实际算例的计算．