期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到4,203篇文章
< 1 2 … 211 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Class of Parallel Algorithm for Solving Low-rank Tensor Completion 认领 引用
1
作者 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
A Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection 认领 引用 被引量：35
2
作者 Lin-Bo Zhang 《Numerical Mathematics(Theory,Methods and Applications)》 SCIE 2009年第1期65-89,共25页
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement... Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure. 展开更多
关键词 Adaptive refinement bisection tetrahedral mesh parallel algorithm MPI.
暂未订购 下载PDF
An Optimal Parallel Algorithm for the Knapsack Problem Based on EREW 认领 引用 被引量：1
3
作者 李肯立 蒋盛益 +1 位作者 王卉 李庆华 《Journal of Southwest Jiaotong University(English Edition)》 2003年第2期131-137,共7页
A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε process... A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε processors, 0≤ ε ≤1, and O(2 n/2 ) memory to find a solution for the n -element knapsack problem in time O(2 n/4 (2 n/4 ) ε) . The cost of the proposed parallel algorithm is O(2 n/2 ) , which is an optimal method for solving the knapsack problem without memory conflicts and an improved result over the past researches. 展开更多
关键词 knapsack problem NP-complete parallel algorithm divide and conquer
暂未订购 下载PDF
Some Massively Parallel Algorithms from Nature 认领 引用
4
作者 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
A HYBRID GRANULARITY PARALLEL ALGORITHM FOR PRECISE INTEGRATION OF STRUCTURAL DYNAMIC RESPONSES 认领 引用
5
作者 Yuanyin Li Xianlong Jin Genguo Li 《Acta Mechanica Solida Sinica》 SCIE EI 2008年第1期28-33,共6页
Precise integration methods to solve structural dynamic responses and the corresponding time integration formula are composed of two parts： the multiplication of an exponential matrix with a vector and the integratio... Precise integration methods to solve structural dynamic responses and the corresponding time integration formula are composed of two parts： the multiplication of an exponential matrix with a vector and the integration term. The second term can be solved by the series solution. Two hybrid granularity parallel algorithms are designed, that is, the exponential matrix and the first term are computed by the fine-grained parallel algorithra and the second term is computed by the coarse-grained parallel algorithm. Numerical examples show that these two hybrid granularity parallel algorithms obtain higher speedup and parallel efficiency than two existing parallel algorithms. 展开更多
关键词 dynamic response precise integration hybrid granularity parallel algorithm
暂未订购 下载PDF
An efficient parallel algorithm for shortest pathsin planar layered digraphs 认领 引用 被引量：1
6
作者 MISHRAP.K. 《Journal of Zhejiang University Science》 2004年第5期518-527,共10页
This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is base... This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once. 展开更多
关键词 Parallel algorithms Shortest paths Planar layered digraphs
暂未订购 下载PDF
A new parallel algorithm for image matching based on entropy 认领 引用 被引量：1
7
作者 董开坤 胡铭曾 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2001年第4期399-402,共4页
Presents a new parallel image matching algorithm based on the concept of entropy feature vector and suitable to SIMD computer, which, in comparison with other algorithms, has the following advantages:(1)The spatial in... Presents a new parallel image matching algorithm based on the concept of entropy feature vector and suitable to SIMD computer, which, in comparison with other algorithms, has the following advantages:(1)The spatial information of an image is appropriately introduced into the definition of image entropy. (2) A large number of multiplication operations are eliminated, thus the algorithm is sped up. (3) The shortcoming of having to do global calculation in the first instance is overcome, and concludes the algorithm has very good locality and is suitable for parallel processing. 展开更多
关键词 image matching entropy feature vector parallel algorithm SIMD
暂未订购 下载PDF
A Class of Parallel Algorithms of Real-TimeNumerical Simulation for Stiff Dynamic System 认领 引用 被引量：2
8
作者 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
AN ITERATIVE PARALLEL ALGORITHM OF FINITE ELEMENT METHOD 认领 引用
9
作者 胡宁 张汝清 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1992年第4期305-313,共9页
In this paper, a parallel algorithm with iterative form for solving finite element equation is presented. Based on the iterative solution of linear algebra equations, the parallel computational steps are introduced in... In this paper, a parallel algorithm with iterative form for solving finite element equation is presented. Based on the iterative solution of linear algebra equations, the parallel computational steps are introduced in this method. Also by using the weighted residual method and choosing the appropriate weighting functions, the finite element basic form of parallel algorithm is deduced. The program of this algorithm has been realized on the ELXSI-6400 parallel computer of Xi'an Jiaotong University. The computational results show the operational speed will be raised and the CPU time will be cut down effectively. So this method is one kind of effective parallel algorithm for solving the finite element equations of large-scale structures. 展开更多
关键词 parallel algorithm finite element method iterative solution weighted residual method
暂未订购 下载PDF
A FINITE ELEMENT PARALLEL ALGORITHM OF THE PARAMETRIC VARIATIONAL PRINCIPLE FOR ELASTIC CONTACT PROBLEMS 认领 引用
10
作者 胡宁 张汝清 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1992年第7期607-616,共10页
Basetl on the finite element solution of the parametric varialional principle of elastic con/del problem, a corresponding parallel algorithm has been created bv utilizing the specialities of parallel computer and the ... Basetl on the finite element solution of the parametric varialional principle of elastic con/del problem, a corresponding parallel algorithm has been created bv utilizing the specialities of parallel computer and the architecture of concurrent processing in this paper. In this algorithm. the parallelisms have heen realized in the processes of creation and assembly of stiffness matrix, of the static condensation, of the solution of stresses and in many other aspects. The programme of this algorithm has been realized on ELXSI-6400 parallel computer of Xi'an Jiaotong University. The results of computation show that the computational time can be saved efficiently and it is an effective parallel algorithm for the analyses of contact problems. 展开更多
关键词 parallel algorithm contact analysis
暂未订购 下载PDF
Optimal parallel algorithm for shortest-paths problem on interval graphs 认领 引用
11
作者 MISHRAP.K. 《Journal of Zhejiang University Science》 2004年第9期1135-1143,共9页
This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linea... This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given. 展开更多
关键词 Parallel algorithms Shortest-paths problem Interval graphs
暂未订购 下载PDF
A New Parallel Algorithm in Power Flow Calculation:Dynamic Asynchronous Parallel Algorithm 认领 引用
12
作者 刘学军 钱清泉 刘军 《Journal of Modern Transportation》 2000年第2期145-151,共7页
Based on the general methods in power flow calculation of power system and on conceptions and classifications of parallel algorithm, a new approach named Dynamic Asynchronous Parallel Algorithm that applies to the onl... Based on the general methods in power flow calculation of power system and on conceptions and classifications of parallel algorithm, a new approach named Dynamic Asynchronous Parallel Algorithm that applies to the online analysis and real-time dispatching and controlling of large-scale power network was put forward in this paper. Its performances of high speed and dynamic following have been verified on IEEE-14 bus system. 展开更多
关键词 power flow calculation parallel algorithm MAT
暂未订购 下载PDF
Accelerating Large-Scale Sorting through Parallel Algorithms 认领 引用
13
作者 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
A Practical Parallel Algorithm for All-Pair Shortest Path Based on Pipelining 认领 引用
14
作者 Hua Wang Ling Tian Chun-Hua Jiang 《Journal of Electronic Science and Technology of China》 2008年第3期329-333,共5页
On the basis of Floyd algorithm with the extended path matrix, a parallel algorithm which resolves all-pair shortest path （APSP） problem on cluster environment is analyzed and designed. Meanwhile, the parallel APSP ... On the basis of Floyd algorithm with the extended path matrix, a parallel algorithm which resolves all-pair shortest path （APSP） problem on cluster environment is analyzed and designed. Meanwhile, the parallel APSP pipelining algorithm makes full use of overlapping technique between computation and communication. Compared with broadcast operation, the parallel algorithm reduces communication cost. This algorithm has been implemented on MPI on PC-cluster. The theoretical analysis and experimental results show that the parallel algorithm is an efficient and scalable algorithm. 展开更多
关键词 All-pair shortest path Floyd algorithm pipelining parallel algorithm
暂未订购 下载PDF
The Pre-processing Parallel Algorithm of A Sparse Linear Equation Group 认领 引用
15
作者 Cao Ying 《International English Education Research》 2015年第1期96-98,共3页
The solution of linear equation group can be applied to the oil exploration, the structure vibration analysis, the computational fluid dynamics, and other fields. When we make the in-depth analysis of some large or ve... The solution of linear equation group can be applied to the oil exploration, the structure vibration analysis, the computational fluid dynamics, and other fields. When we make the in-depth analysis of some large or very large complicated structures, we must use the parallel algorithm with the aid of high-performance computers to solve complex problems. This paper introduces the implementation process having the parallel with sparse linear equations from the perspective of sparse linear equation group. 展开更多
关键词 Sparse Linear Equations Pre-processing Parallel Algorithm
暂未订购 下载PDF
Parallel Algorithm in Surface Wave Waveform Inversion 认领 引用
16
作者 Cao Xiao lin, Song Jun qiang School of Computer Science, National University of Defense Technology, Changsha 410073, China 《Wuhan University Journal of Natural Sciences》 EI CAS 2001年第Z1期574-578,共5页
In Surface wave waveform inversion, we want to reconstruct 3D shear wave velocity structure, which calculation beyond the capability of the powerful present day personal computer or even workstation. So we designed a ... In Surface wave waveform inversion, we want to reconstruct 3D shear wave velocity structure, which calculation beyond the capability of the powerful present day personal computer or even workstation. So we designed a high paralleled algorithm and carried out the inversion on Parallel computer based on the partitioned waveform inversion (PWI). It partitions the large scale optimization problem into a number of independent small scale problems and reduces the computational effort by several orders of magnitude. We adopted surface waveform inversion with a equal block(2 o×2 o) discretization. 展开更多
关键词 surface wave waveform inversion parallel algorithm partitioned waveform inversion
暂未订购 下载PDF
Design of efficient parallel algorithms on shared memory multiprocessors 认领 引用
17
作者 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 Practical Parallel Algorithm for Propositional Knowledge Base Revision 认领 引用
18
作者 SUN WEI TAO XUEHONG and MA SHAOHAO 《Wuhan University Journal of Natural Sciences》 CAS 1996年第Z1期473-477,共5页
Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a rev... Different methods for revising propositional knowledge base have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method in special case, and gives a corresponding polynomial algorithm as well as its parallel version on CREW PRAM. 展开更多
关键词 Prepositional knowledge base revision parallel algorithm satisfiability problem strongly connected component of a graph.
暂未订购 下载PDF
A Comprehensive Review of Parallel Optimization Algorithms for High-Dimensional and Incomplete Matrix Factorization 认领 引用
19
作者 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
An efficient parallel algorithm for DNS of buoyancy-driven turbulent flows 认领 引用 被引量：6
20
作者 Yi-zhao Zhang Shu-ning Xia +2 位作者 Yu-hong Dong Bo-fu Wang Quan Zhou 《Journal of Hydrodynamics》 SCIE EI CSCD 2019年第6期1159-1169,共11页
In this paper,an explicit low-storage simplified M-stage Runge-Kutta(SRK)scheme for high Reynolds-number incompressible flows is presented.In the SRK scheme,the Poisson equation is solved only once in the final substa... In this paper,an explicit low-storage simplified M-stage Runge-Kutta(SRK)scheme for high Reynolds-number incompressible flows is presented.In the SRK scheme,the Poisson equation is solved only once in the final substage of each time step.By taking advantage of the SRK scheme and the advanced hybrid MPI+MPI model,we have developed an efficient parallel solver for buoyancy-driven turbulent flow.The spatial and temporal accuracies of the solver are validated with Taylor-Green vortex flow.Both the RK and SRK schemes are implemented for the simulation of turbulent Rayleigh-Benard convection as well as Rayleigh-Taylor flow.The results show that the SRK scheme can save approximately 20%of the computation time. 展开更多
关键词 Direct numerical simulation(DNS) parallel algorithm turbulent flows
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 211 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈