期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到155篇文章
< 1 2 … 8 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Class of Parallel Algorithms of Real-TimeNumerical Simulation for Stiff Dynamic System 认领 引用 被引量：2
1
作者 Cao Xuenian Liu Degui Li Shoufu 《Journal of Systems Engineering and Electronics》 EI 2000年第4期51-58,共8页
In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these met... In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup. 展开更多
关键词 Dynamic system Real-time simulation Parallel algorithms?
暂未订购 下载PDF
Some Massively Parallel Algorithms from Nature 认领 引用
2
作者 Li Yan Kang Li-shan +3 位作者 Chen Yu-ping Liu Pu Cao Hong-qing Pan Zheng-jun 《Wuhan University Journal of Natural Sciences》 EI CAS 2002年第1期37-46,共10页
We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering,Wuhan University.Results on parallel solvers include... We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering,Wuhan University.Results on parallel solvers include the following areas:Evolutionary algorithms based on imitating the evolution processes of nature for parallel problem solving,especially for parallel optimization and model-building;Asynchronous parallel algorithms based on domain decomposition which are inspired by physical analogies such as elastic relaxation process and annealing process,for scientific computations,especially for solving nonlinear mathematical physics problems.All these algorithms have the following common characteristics:inherent parallelism,self-adaptation and self-organization,because the basic ideas of these solvers are from imitating the natural evolutionary processes. 展开更多
关键词 evolutionary computation parallel algorithm imitating nature domain decomposition knowledge discovery in databases
暂未订购 下载PDF
Accelerating Large-Scale Sorting through Parallel Algorithms 认领 引用
3
作者 Yahya Alhabboub Fares Almutairi +3 位作者 Mohammed Safhi Yazan Alqahtani Adam Almeedani Yasir Alguwaifli 《Journal of Computer and Communications》 2024年第1期131-138,共8页
This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison ... This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases. 展开更多
关键词 Sorting Algorithm Quick Sort QuickSort Parallel Parallel Algorithms
暂未订购 下载PDF
Design of efficient parallel algorithms on shared memory multiprocessors 认领 引用
4
作者 Qiao Xiangzhen 《Wuhan University Journal of Natural Sciences》 CAS 1996年第Z1期344-349,共6页
The design of parallel algorithms is studied in this paper. These algorithms are applicable to shared memory MIMD machines In this paper, the emphasis is put on the methods for design of the efficient parallel algorit... The design of parallel algorithms is studied in this paper. These algorithms are applicable to shared memory MIMD machines In this paper, the emphasis is put on the methods for design of the efficient parallel algorithms. The design of efficient parallel algorithms should be based on the following considerationst algorithm parallelism and the hardware-parallelism; granularity of the parallel algorithm, algorithm optimization according to the underling parallel machine. In this paper , these principles are applied to solve a model problem of the PDE. The speedup of the new method is high. The results were tested and evaluated on a shared memory MIMD machine. The practical results were agree with the predicted performance. 展开更多
关键词 parallel algorithm, shared memory multiprocessor parallel granularity optimization.
暂未订购 下载PDF
A Comprehensive Review of Parallel Optimization Algorithms for High-Dimensional and Incomplete Matrix Factorization 认领 引用
5
作者 Qicong Hu Hao Wu Xin Luo 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第12期2399-2426,共28页
High-dimensional and incomplete(HDI) matrices are commonly encountered in various big data-related applications for illustrating the complex interactions among numerous entities, like the user-item interactions in a c... High-dimensional and incomplete(HDI) matrices are commonly encountered in various big data-related applications for illustrating the complex interactions among numerous entities, like the user-item interactions in a commercial recommender system or the user-user interactions in a social network services system. The factorization of such an HDI matrix can embed the involved entities into the low-dimensional feature space for acquiring their principal representation, which is a vital task in various application scenes and is often established through the Latent Factor Analysis(LFA). Nevertheless, an HDI matrix can be huge when the corresponding application explodes to involve millions of users, items, or other interactive nodes. In this case, a parallel optimization algorithm is desired for raising the scalability and time efficiency of an LFA model. This paper provides a comprehensive review of the existing parallel optimization algorithms for the LFA model. Specifically, it performs: 1) discussion and summary of these algorithms based on computing architecture and mode, 2) empirical studies of representative models, and3) summary of the current challenges and future directions in this domain. This survey aims to offer an exhaustive review of Parallel Optimization Algorithms for High-Dimensional and Incomplete Matrix Factorization, thereby fostering further research in this field. 展开更多
关键词 Data-related application high-dimensional and incomplete(HDI)data high-performance computing latent feature analysis(LFA) matrix factorization parallel optimization algorithm
暂未订购 下载PDF
Local and parallel finite element algorithms for time-dependent convection-diffusion equations 认领 引用
6
作者 刘庆芳 侯延仁 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2009年第6期787-794,共8页
Local and parallel finite element algorithms based on two-grid discretization for the time-dependent convection-diffusion equations are presented. These algorithms are motivated by the observation that, for a solution... Local and parallel finite element algorithms based on two-grid discretization for the time-dependent convection-diffusion equations are presented. These algorithms are motivated by the observation that, for a solution to the convection-diffusion problem, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel proce- dures. Hence, these local and parallel algorithms only involve one small original problem on the coarse mesh and some correction problems on the local fine grid. One technical tool for the analysis is the local a priori estimates that are also obtained. Some numerical examples are given to support our theoretical analvsis. 展开更多
关键词 local and parallel algorithms finite element method convection-diffusionequations
暂未订购 下载PDF
Parallel Algorithms for Large-scale Linearly Constrained Minimization Problem 认领 引用 被引量：1
7
作者 Cong-ying HAN Fang-ying ZHENG +1 位作者 Tian-de GUO Guo-ping HE 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2014年第3期707-720,共14页
In this paper, two PVD-type algorithms are proposed for solving inseparable linear constraint optimization. Instead of computing the residual gradient function, the new algorithm uses the reduced gradients to construc... In this paper, two PVD-type algorithms are proposed for solving inseparable linear constraint optimization. Instead of computing the residual gradient function, the new algorithm uses the reduced gradients to construct the PVD directions in parallel computation, which can greatly reduce the computation amount each iteration and is closer to practical applications for solve large-scale nonlinear programming. Moreover, based on an active set computed by the coordinate rotation at each iteration, a feasible descent direction can be easily obtained by the extended reduced gradient method. The direction is then used as the PVD direction and a new PVD algorithm is proposed for the general linearly constrained optimization. And the global convergence is also proved. 展开更多
关键词 nonlinear programming large-scale minimization parallel algorithm constrained convex opti-mization
暂未订购 下载PDF
Parallel Optimization of Program Instructions Using Genetic Algorithms 认领 引用
8
作者 Petre Anghelescu 《Computers, Materials & Continua》 SCIE EI 2021年第6期3293-3310,共18页
This paper describes an efficient solution to parallelize softwareprogram instructions, regardless of the programming language in which theyare written. We solve the problem of the optimal distribution of a set ofinst... This paper describes an efficient solution to parallelize softwareprogram instructions, regardless of the programming language in which theyare written. We solve the problem of the optimal distribution of a set ofinstructions on available processors. We propose a genetic algorithm to parallelize computations, using evolution to search the solution space. The stagesof our proposed genetic algorithm are: The choice of the initial populationand its representation in chromosomes, the crossover, and the mutation operations customized to the problem being dealt with. In this paper, geneticalgorithms are applied to the entire search space of the parallelization ofthe program instructions problem. This problem is NP-complete, so thereare no polynomial algorithms that can scan the solution space and solve theproblem. The genetic algorithm-based method is general and it is simple andefficient to implement because it can be scaled to a larger or smaller number ofinstructions that must be parallelized. The parallelization technique proposedin this paper was developed in the C# programming language, and our resultsconfirm the effectiveness of our parallelization method. Experimental resultsobtained and presented for different working scenarios confirm the theoreticalresults, and they provide insight on how to improve the exploration of a searchspace that is too large to be searched exhaustively. 展开更多
关键词 Parallel instruction execution parallel algorithms genetic algorithms parallel genetic algorithms artificial intelligence techniques evolutionary strategies
暂未订购 下载PDF
Efficient Parallel Algorithms for Some Graph Theory Problems 认领 引用
9
作者 马军 马绍汉 《Journal of Computer Science & Technology》 SCIE EI 1993年第4期362-366,共5页
In this paper,a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is sho... In this paper,a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure arrayof an undirected graph.The time complexify of the parallel algorithm is O(n^3/p).If D,P andare known,it is shown that the problems to find all connected components, to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p^+ logp)time. 展开更多
关键词 Parallel graph algorithms shortest paths transitive closure connected components diameter of graph center of graph directed cycle with the minimum (maximum)length parallel random access machines (PRAMs)
暂未订购 下载PDF
New Heuristic Distributed Parallel Algorithms for Searching and Planning 认领 引用
10
作者 帅典勋 《Journal of Computer Science & Technology》 SCIE EI 1995年第4期354-374,共21页
This paper proposes new heuristic distributed parallel algorithms for search-ing and planning, which are based on the concepts of wave concurrent prop-agations and competitive activation mechanisms. These algorithms a... This paper proposes new heuristic distributed parallel algorithms for search-ing and planning, which are based on the concepts of wave concurrent prop-agations and competitive activation mechanisms. These algorithms are char-acterized by simplicity and clearness of control strategies for searching, anddistinguished abilities in many aspects, such as high speed processing, widesuitability for searching AND/OR implicit graphs, and ease in hardware imple-mentation. 展开更多
关键词 Heuristic search distributed parallel algorithm implicit AND/OR graph wave concurrent propagation
暂未订购 下载PDF
Research on the Optimal Parallel Algorithms of Broadcast-Class Problems 认领 引用
11
作者 李晓峰 寿标 郑世荣 《Journal of Computer Science & Technology》 SCIE EI 1998年第5期455-463,共9页
Speedup is considered as the criterion of determining whether a parallel algorithm is optimal. But broadcast-class problems, existing only on parallel computer system, have no sequential algorithms at all. Speedup sta... Speedup is considered as the criterion of determining whether a parallel algorithm is optimal. But broadcast-class problems, existing only on parallel computer system, have no sequential algorithms at all. Speedup standard becomes invalid here. Through this research on broadcast algorithms under several typical parallel computation models,a model-independent evaluation standard min C2 is developed, which can be not only used to determine an optimal broadcasting algorithm, but also normalized to apply to any parallel algorithm. As a new idea, min C2 will lead to a new way in this field. 展开更多
关键词 Optimal parallel algorithm broadcast-class problem parallel computation model min C^2
暂未订购 下载PDF
CONVERGENCE ANALYSIS OF SOME FINITE ELEMENT PARALLEL ALGORITHMS FOR THE STATIONARY INCOMPRESSIBLE MHD EQUATIONS 认领 引用
12
作者 Xiaojing Dong Yinnian He 《Journal of Computational Mathematics》 SCIE CSCD 2024年第1期49-70,共22页
By combination of iteration methods with the partition of unity method(PUM),some finite element parallel algorithms for the stationary incompressible magnetohydrodynamics(MHD)with different physical parameters are pre... By combination of iteration methods with the partition of unity method(PUM),some finite element parallel algorithms for the stationary incompressible magnetohydrodynamics(MHD)with different physical parameters are presented and analyzed.These algorithms are highly efficient.At first,a global solution is obtained on a coarse grid for all approaches by one of the iteration methods.By parallelized residual schemes,local corrected solutions are calculated on finer meshes with overlapping sub-domains.The subdomains can be achieved flexibly by a class of PUM.The proposed algorithm is proved to be uniformly stable and convergent.Finally,one numerical example is presented to confirm the theoretical findings. 展开更多
关键词 Partition of unity method Local and parallel algorithm Finite element method Iteration methods Magnetohydrodynamics
暂未订购 下载PDF
A Class of Parallel Algorithm for Solving Low-rank Tensor Completion 认领 引用
13
作者 LIU Tingyan WEN Ruiping 《应用数学》 北大核心 2025年第4期1134-1144,共11页
In this paper,we established a class of parallel algorithm for solving low-rank tensor completion problem.The main idea is that N singular value decompositions are implemented in N different processors for each slice ... In this paper,we established a class of parallel algorithm for solving low-rank tensor completion problem.The main idea is that N singular value decompositions are implemented in N different processors for each slice matrix under unfold operator,and then the fold operator is used to form the next iteration tensor such that the computing time can be decreased.In theory,we analyze the global convergence of the algorithm.In numerical experiment,the simulation data and real image inpainting are carried out.Experiment results show the parallel algorithm outperform its original algorithm in CPU times under the same precision. 展开更多
关键词 Tensor completion Low-rank Convergence Parallel algorithm
暂未订购 下载PDF
Asynchronous Parallel Evolutionary Algorithms for Constrained Optimizations 认领 引用
14
作者 Kang Li-shan Liu Pu +2 位作者 Kang Zhuo Li Yan Chen Yu-ping 《Wuhan University Journal of Natural Sciences》 EI CAS 2000年第4期406-412,共7页
Recently Guo Tao proposed a stochastic search algorithm in his PhD thesis for solving function optimization problems. He combined the subspace search method (a general multi-parent recombination strategy) with the pop... Recently Guo Tao proposed a stochastic search algorithm in his PhD thesis for solving function optimization problems. He combined the subspace search method (a general multi-parent recombination strategy) with the population hill-climbing method. The former keeps a global search for overall situation, and the latter keeps the convergence of the algorithm. Guo's algorithm has many advantages, such as the simplicity of its structure, the higher accuracy of its results, the wide range of its applications, and the robustness of its use. In this paper a preliminary theoretical analysis of the algorithm is given and some numerical experiments has been done by using Guo's algorithm for demonstrating the theoretical results. Three asynchronous parallel evolutionary algorithms with different granularities for MIMD machines are designed by parallelizing Guo's Algorithm. 展开更多
关键词 asynchronous parallel evolutionary algorithm function optimization
暂未订购 下载PDF
Local and Parallel Finite Element Algorithms Based on Two-grid Discretizations for the Unsteady MHD Equations with Low Electromagnetic Reynolds Number 认领 引用
15
作者 Shi-lin MI Guang-zhi DU +1 位作者 Yao RONG Li-yun ZUO 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2026年第2期512-530,共19页
This paper mainly presents and studies some local and parallel finite element methods for the unsteady magnetohydrodynamic equations with low electromagnetic Reynolds number.Firstly,both the semi discrete and fully di... This paper mainly presents and studies some local and parallel finite element methods for the unsteady magnetohydrodynamic equations with low electromagnetic Reynolds number.Firstly,both the semi discrete and fully discrete local algorithms are provided and investigated,and the theoretical tool crucial to the analysis of the fully discrete local algorithm is obtained.Subsequently,we generalize the fully discrete local algorithm to the fully discrete parallel algorithm.At the end,some numerical experiments are provided to validate the effectiveness and efficiency of our algorithms. 展开更多
关键词 unsteady magnetohydrodynamics equations backward Euler scheme two-grid method local and parallel algorithms
暂未订购 下载PDF
Efficient Data-parallel Computations on Distributed Systems 认领 引用
16
作者 曾志勇 LU Xinda 《High Technology Letters》 EI CAS 2002年第3期92-96,共5页
Task scheduling determines the performance of NOW computing to a large extent. However, the computer system architecture, computing capability and system load are rarely proposed together. In this paper, a biggest het... Task scheduling determines the performance of NOW computing to a large extent. However, the computer system architecture, computing capability and system load are rarely proposed together. In this paper, a biggest heterogeneous scheduling algorithm is presented. It fully considers the system characteristics (from application view), structure and state. So it always can utilize all processing resource under a reasonable premise. The results of experiment show the algorithm can significantly shorten the response time of jobs. 展开更多
关键词 parallel algorithms heterogeneous computing message passing load balancing
暂未订购 下载PDF
Efficient and High-quality Recommendations via Momentum-incorporated Parallel Stochastic Gradient Descent-Based Learning 认领 引用 被引量：10
17
作者 Xin Luo Wen Qin +2 位作者 Ani Dong Khaled Sedraoui MengChu Zhou 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2021年第2期402-411,共10页
A recommender system(RS)relying on latent factor analysis usually adopts stochastic gradient descent(SGD)as its learning algorithm.However,owing to its serial mechanism,an SGD algorithm suffers from low efficiency and... A recommender system(RS)relying on latent factor analysis usually adopts stochastic gradient descent(SGD)as its learning algorithm.However,owing to its serial mechanism,an SGD algorithm suffers from low efficiency and scalability when handling large-scale industrial problems.Aiming at addressing this issue,this study proposes a momentum-incorporated parallel stochastic gradient descent(MPSGD)algorithm,whose main idea is two-fold:a)implementing parallelization via a novel datasplitting strategy,and b)accelerating convergence rate by integrating momentum effects into its training process.With it,an MPSGD-based latent factor(MLF)model is achieved,which is capable of performing efficient and high-quality recommendations.Experimental results on four high-dimensional and sparse matrices generated by industrial RS indicate that owing to an MPSGD algorithm,an MLF model outperforms the existing state-of-the-art ones in both computational efficiency and scalability. 展开更多
关键词 Big data industrial application industrial data latent factor analysis machine learning parallel algorithm recommender system(RS) stochastic gradient descent(SGD)
暂未订购 下载PDF
Parallel rapid relaxation inversion of 3D magnetotelluric data 认领 引用 被引量：27
18
作者 林昌洪 谭捍东 佟拓 《Applied Geophysics》 SCIE 2009年第1期77-83,104,共7页
We implement a parallel algorithm with the advantage of MPI （Message Passing Interface） to speed up the rapid relaxation inversion for 3D magnetotelluric data. We test the parallel rapid relaxation algorithm with sy... We implement a parallel algorithm with the advantage of MPI （Message Passing Interface） to speed up the rapid relaxation inversion for 3D magnetotelluric data. We test the parallel rapid relaxation algorithm with synthetic and real data. The execution efficiency of the algorithm for several different situations is also compared. The results indicate that the parallel rapid relaxation algorithm for 3D magnetotelluric inversion is effective. This parallel algorithm implemented on a common PC promotes the practical application of 3D magnetotelluric inversion and can be suitable for the other geophysical 3D modeling and inversion. 展开更多
关键词 Magnetotelluric MPI 3D rapid relaxation inversion parallel algorithm
暂未订购 下载PDF
Strategic flight assignment approach based on multi-objective parallel evolution algorithm with dynamic migration interval 认领 引用 被引量：9
19
作者 Zhang Xuejun Guan Xiangmin +1 位作者 Zhu Yanbo Lei Jiaxing 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2015年第2期556-563,共8页
The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategi... The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by rea- sonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimiza- tion problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm （MPEA） framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is pro- posed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution （CC） algorithm combined with non-dominated sorting genetic algorithm II （NSGA-II） is intro- duced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multi- objective genetic algorithm （MOGA）, multi-objective evolutionary algorithm based on decom- position （MOEA/D）, CC-based multi-objective algorithm （CCMA） as well as other two MPEAs with different migration interval strategies. 展开更多
关键词 Air traffic flow management Cooperative co-evolution Dynamic migration intervalstrategy Flight assignment Parallel evolution algorithm
暂未订购 下载PDF
The parallel 3D magnetotelluric forward modeling algorithm 认领 引用 被引量：34
20
作者 Tan Handong Tong Tuo Lin Changhong 《Applied Geophysics》 2006年第4期197-202,共6页
The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the dat... The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the data in the frequency domain, which is very suitable for parallel computation. With the advantage of MPI and based on an analysis of the flow of the 3D magnetotelluric serial forward algorithm, we suggest the idea of parallel computation and apply it. Three theoretical models are tested and the execution efficiency is compared in different situations. The results indicate that the parallel 3D forward modeling computation is correct and the efficiency is greatly improved. This method is suitable for large size geophysical computations. 展开更多
关键词 Magnetotelluric 3D forward modeling MPI parallel programming design 3D staggered-grid finite difference method parallel algorithm.
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 8 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈