期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
APPLICATIONS OF THE PACK & UNPACK TECHNIQUE IN VECTOR COMPUTATION
1
作者 HUANG QINGNAN and XU MIN(Southwest computation Center, P. O.BOX 532-101,Chengdu 610003, P.R.CHINA) 《Wuhan University Journal of Natural Sciences》 CAS 1996年第Z1期321-324,共4页
This article describes the pack & unpack performance of the vector using YH-1 supercomputer as its platform, with its emphasis on the pack & unpack technique's unique application to vector computation, in ... This article describes the pack & unpack performance of the vector using YH-1 supercomputer as its platform, with its emphasis on the pack & unpack technique's unique application to vector computation, in the light of vector computer's characteristics and some practical cases. The practical numerical experiment proves that the pack & unpack techniques is a key method to the depth parallel development and vectorization research of large scale scientific computation project, and which is a highly effective method to vectorizing application programs. 展开更多
关键词 parallel algorithm pack & unpack technique vector logical ruler vector program design vector computation.
下载PDF
AN EFFICIENT METHOD FOR MULTIOBJECTIVE OPTIMAL CONTROL AND OPTIMAL CONTROL SUBJECT TO INTEGRAL CONSTRAINTS
2
作者 Ajeet Kumar Alexander Vladimirsky 《Journal of Computational Mathematics》 SCIE CSCD 2010年第4期517-551,共35页
We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include infor... We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a "budget" remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian "marching" method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced "weighted sum" based algorithm for the same problem [25]. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers. 展开更多
关键词 Optimal control Multiobjective optimization Pareto front Vector dynamic programming Hamilton-Jacobi equation Discontinuous viscosity solution Semi-Lagrangian discretization.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部