Recently we proposed a Robust Evolutionary algorithm for solving nonlinear programming(NLP) problems[4].It is an extension of Guo's algorithm[1],which possesses enhanced capabilities for solving NLP *** capabiliti...
详细信息
Recently we proposed a Robust Evolutionary algorithm for solving nonlinear programming(NLP) problems[4].It is an extension of Guo's algorithm[1],which possesses enhanced capabilities for solving NLP *** capabilities include:a) advancing the variable subspace,b) adding a search process over subspaces and normalized constraints,c) using an adaptive penalty function,and d) adding the ability to deal with integer NLP problems.0-1 NLP problems,and mixed-integer NLP problems which have equality *** this paper an asynchronous parallel evolutionary algorithm with scalable granularities for MIMD machines is designed by parallelizing the Robust Evolutionary algorithm.A challenge NLP problem is chosen as the test *** experiments show that the new algorithm is very efficient and effective.
In this paper, a multi-frontal parallel algorithm is developed to solve fully coupled heat, water and gas flow in deformable porous media. The mathematical model makes use of the modified effective stress concept toge...
详细信息
In this paper, we present two parallel algorithms for computing the all nearest neighbors of an n x n binary image on the Bulk-Synchronous parallel (BSP) model. The BSP model is an asynchronous parallel computing mode...
详细信息
In this paper, we present two parallel algorithms for computing the all nearest neighbors of an n x n binary image on the Bulk-Synchronous parallel (BSP) model. The BSP model is an asynchronous parallel computing model, where its communication features are abstracted by two parameters L and g: L denotes synchronization periodicity and g denotes a reciprocal of communication bandwidth. We propose two parallel algorithms for the ail nearest neighbor problems based on two distance metrics. The first algorithm is for L-p distance, and the second algorithm is for weighted distance. Both two algorithms run in O(n(2)/p + L) computation time and in O(g n/root p + L) communication time using p (1 less than or equal to p less than or equal to n) processors and in O(n(2)/p + (d + L) log p/n/log (d + 1)) computation time and in O(g n/root p + (gd + L) log p/n/log (d+1)) communication time using p (n < p less than or equal to n(2)) processors on the BSP model, for any integer d (1 less than or equal to d less than or equal to p/n).
The inverse determination of heal generation due to a welding process is discussed.A mathematical model and its domain decomposition are presented.A distributed algorithm based on coarse-grained computing environment ...
详细信息
The inverse determination of heal generation due to a welding process is discussed.A mathematical model and its domain decomposition are presented.A distributed algorithm based on coarse-grained computing environment is also presented.
Hybrid Scheme is a important formulation in solving Vavier-Stokes equations(incompressible flow problems),and SRM algorithm keeps the benefits of the penalty method,that is,velocity and pressure can be obtained separa...
详细信息
Hybrid Scheme is a important formulation in solving Vavier-Stokes equations(incompressible flow problems),and SRM algorithm keeps the benefits of the penalty method,that is,velocity and pressure can be obtained separately and no pressure-Poisson equation is involved,unlike the penalty method the SRM is more stable,less *** then case that a large number of time steps are needed,we introduce Domain-Decomposition based parallel techniques,and apply Sequential Approximation Virtual Boundary to compute the internal boundaries of sub-domains,less iterative is needed., computational results shows that the result is very well,and the speedup ratio of our method is larger.
This paper presents a contour line generation parallel method based on quadratic isoparametric element. In this method, the whole area is divided into many quadratic isoparametric elements by means of finite element m...
详细信息
This paper presents a contour line generation parallel method based on quadratic isoparametric element. In this method, the whole area is divided into many quadratic isoparametric elements by means of finite element method. The contour line in each isoparametric element is generated in parallel, and the whole contour is assembled. The result shows that this method improves the computation efficiency under the condition that the precision can be guaranteed.
Clustering is a basic operation in image processing and computer vision, and it plays an important role in unsupervised pattern recognition and image segmentation. While there are many methods for clustering, the sing...
详细信息
Clustering is a basic operation in image processing and computer vision, and it plays an important role in unsupervised pattern recognition and image segmentation. While there are many methods for clustering, the single-link hierarchical clustering is one of the most popular techniques. In this paper, with the advantages of both optical transmission and electronic computation, we design efficient parallel hierarchical clustering algorithms on the arrays with reconfigurable optical buses (AROB). We first design three efficient basic operations which include the matrix multiplication of two N x N matrices, finding the minimum spanning tree of a graph with N vertices, and identifying the connected component containing a specified vertex. Based on these three data operations, an O(log N) time parallel hierarchical clustering algorithm is proposed using N-3 processors. Furthermore, if the connectivity of the AROB with four-port connection is allowed, two constant time clustering algorithms can be also derived using N-4 and N-3 processors, respectively. These results improve on previously known algorithms developed on various parallel computational models. (C) 2000 Academic Press.
Let G be a connected, undirected and weighted graph with n vertices and nr edges. A most vital edge of G with respect to minimum spanning tree is an edge whose removal from G results in the greatest weight-increase in...
详细信息
Let G be a connected, undirected and weighted graph with n vertices and nr edges. A most vital edge of G with respect to minimum spanning tree is an edge whose removal from G results in the greatest weight-increase in the minimum spanning tree of the remaining graph. This paper presents a fast parallel algorithm that computes the most vital edge of G in O(logn) time using O(max{n, m log log log n/log n}) processors on a CRCW PRAM and O(log nlog log n) time using O(max{m, n(2)/(log n log log n)}) processors on an EREW PRAM respectively. It significantly improves the known results of O(logn) time and O(m) processors on the CRCW PRAM [10, 13], and of O(log(2)n) time and O(n(2)/log(2)n) processors on the CREW PRAM [13], and O(n(l+epsilon)) time using nl-E processors and O(mlog(m/N)/N + n alpha(m, n)log(m/n)) time using N less than or equal to m log m/(n alpha(m, n)log(m/n)) processors on the EREW PRAM, respectively.
We know that evaluating an n x n Vandermonde determinant usually needs O(n(2)) number of arithmetic operations. This paper presents a few fast algorithms for Vandermonde determinants, confluent Vandermonde determinant...
详细信息
We know that evaluating an n x n Vandermonde determinant usually needs O(n(2)) number of arithmetic operations. This paper presents a few fast algorithms for Vandermonde determinants, confluent Vandermonde determinants and generalized Vandermonde determinants. These algorithms need only O(log(2)(2) n) number of arithmetic operations on a serial computer, or at most need O(log(2)(2) n) number of the parallel steps on a SIMD type supercomputer with n processors.
We present an algorithm developed for the efficient computation on parallel computers of molecular dynamics simulations of materials with electrostatic potentials that allow for dynamic charge evolution. This algorith...
详细信息
We present an algorithm developed for the efficient computation on parallel computers of molecular dynamics simulations of materials with electrostatic potentials that allow for dynamic charge evolution. This algorithm combines a hierarchical cell multipole method for the fast evaluation of the electrostatic potential with a Broyden-Fletcher-Goldfarb-Shanno scheme for approximate solutions to arbitrary precision of the electronegativity equalization condition, which defines charge transfer in the material. We apply this algorithm to Me simulation of a model alpha -alumina slab at equilibrium. First, we demonstrate that simple fixed-charge models yield different bulk energies than do dynamic-charge models. Second, we compare our algorithm with two previously published techniques for the simulation of dynamic charges in electrostatic materials, discussing both computational speed and numerical accuracy. We show the relative computational speed-up of this scheme over a direct evaluation of the linear equations, and show that intrinsic flaws in other approximate dynamic-charge schemes can be avoided with this approach. (C) 2000 John Wiley & Sons, Inc.
暂无评论