The implementation of an aeronautical CFD flow code onto distributed memory parallel systems

The parallelization of an industrially important in‐house computational fluid dynamics (CFD) code for calculating the airflow over complex aircraft configurations using the Euler or Navier–Stokes equations is presented. The code discussed is the flow solver module of the SAUNA CFD suite. This suite uses a novel grid system that may include block‐structured hexahedral or pyramidal grids, unstructured tetrahedral grids or a hybrid combination of both. To assist in the rapid convergence to a solution, a number of convergence acceleration techniques are employed including implicit residual smoothing and a multigrid full approximation storage scheme (FAS). Key features of the parallelization approach are the use of domain decomposition and encapsulated message passing to enable the execution in parallel using a single programme multiple data (SPMD) paradigm. In the case where a hybrid grid is used, a unified grid partitioning scheme is employed to define the decomposition of the mesh. The parallel code has been tested using both structured and hybrid grids on a number of different distributed memory parallel systems and is now routinely used to perform industrial scale aeronautical simulations. Copyright © 2000 John Wiley & Sons, Ltd.     

Pyrrole-Based Fully Non-fused Acceptor for Efficient and Stable Organic Solar Cells

Organic solar cells (OSCs) are still suffering from the low light utilization and unstable under ultraviolet irradiation. To tackle these challenges, we design and synthesize a non-fused acceptor based on 1-(2-butyloctyl)-1H-pyrrole as π-bridge unit, denoted as GS70, which serves as active layer in the front-cell for constructing tandem OSCs with a parallel configuration. Benefiting from the well-complementary absorption spectra with the rear-cell, GS70-based parallel tandem OSCs exhibit an improved photoelectron response over the range between 600–700 nm, yielding a high short-circuit current density of 28.4 mA cm⁻². The improvement in light utilization translates to a power conversion efficiency of 19.4 %, the highest value among all parallel tandem OSCs. Notably, owing to the intrinsic stability of GS70, the manufactured parallel tandem OSCs retain 84.9 % of their initial PCE after continuous illumination for 1000 hours. Overall, this work offers novel insight into the molecular design of low-cost and stability non-fused acceptors, emphasizing the importance of adopting a parallel tandem configuration for achieving efficient light harvesting and improved photostability in OSCs.     

Falkner–Skan Flow with Stream-Wise Pressure Gradient and Transfer of Mass over a Dynamic Wall

In this work, an important model in fluid dynamics is analyzed by a new hybrid neurocomputing algorithm. We have considered the Falkner–Skan (FS) with the stream-wise pressure gradient transfer of mass over a dynamic wall. To analyze the boundary flow of the FS model, we have utilized the global search characteristic of a recently developed heuristic, the Sine Cosine Algorithm (SCA), and the local search characteristic of Sequential Quadratic Programming (SQP). Artificial neural network (ANN) architecture is utilized to construct a series solution of the mathematical model. We have called our technique the ANN-SCA-SQP algorithm. The dynamic of the FS system is observed by varying stream-wise pressure gradient mass transfer and dynamic wall. To validate the effectiveness of ANN-SCA-SQP algorithm, our solutions are compared with state-of-the-art reference solutions. We have repeated a hundred experiments to establish the robustness of our approach. Our experimental outcome validates the superiority of the ANN-SCA-SQP algorithm.     

Exact Recursive Calculation of Circulant Permanents: A Band of Different Diagonals inside a Uniform Matrix

We present a finite-order system of recurrence relations for the permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k=1,2 and 3) and the method for deriving such recurrence relations, which is based on the permanents of the matrices with defects. The proposed system of linear recurrence equations with variable coefficients provides a powerful tool for the analysis of the circulant permanents, their fast, linear-time computing; and finding their asymptotics in a large-matrix-size limit. The latter problem is an open fundamental problem. Its solution would be tremendously important for a unified analysis of a wide range of the nature’s ♯P-hard problems, including problems in the physics of many-body systems, critical phenomena, quantum computing, quantum field theory, theory of chaos, fractals, theory of graphs, number theory, combinatorics, cryptography, etc.     

Study of Nonlinear Models of Oscillatory Systems by Applying an Intelligent Computational Technique

In this paper, we have analyzed the mathematical model of various nonlinear oscillators arising in different fields of engineering. Further, approximate solutions for different variations in oscillators are studied by using feedforward neural networks (NNs) based on the backpropagated Levenberg–Marquardt algorithm (BLMA). A data set for different problem scenarios for the supervised learning of BLMA has been generated by the Runge–Kutta method of order 4 (RK-4) with the “NDSolve” package in Mathematica. The worth of the approximate solution by NN-BLMA is attained by employing the processing of testing, training, and validation of the reference data set. For each model, convergence analysis, error histograms, regression analysis, and curve fitting are considered to study the robustness and accuracy of the design scheme.     

Mathematical Analysis of Reaction–Diffusion Equations Modeling the Michaelis–Menten Kinetics in a Micro-Disk Biosensor

In this study, we have investigated the mathematical model of an immobilized enzyme system that follows the Michaelis–Menten (MM) kinetics for a micro-disk biosensor. The film reaction model under steady state conditions is transformed into a couple differential equations which are based on dimensionless concentration of hydrogen peroxide with enzyme reaction (H) and substrate (S) within the biosensor. The model is based on a reaction–diffusion equation which contains highly non-linear terms related to MM kinetics of the enzymatic reaction. Further, to calculate the effect of variations in parameters on the dimensionless concentration of substrate and hydrogen peroxide, we have strengthened the computational ability of neural network (NN) architecture by using a backpropagated Levenberg–Marquardt training (LMT) algorithm. NNs–LMT algorithm is a supervised machine learning for which the initial data set is generated by using MATLAB built in function known as “pdex4”. Furthermore, the data set is validated by the processing of the NNs–LMT algorithm to find the approximate solutions for different scenarios and cases of mathematical model of micro-disk biosensors. Absolute errors, curve fitting, error histograms, regression and complexity analysis further validate the accuracy and robustness of the technique.     

连续音素的改进深信度网络的识别算法*

为提高连续语音识别中的音素识别率,提出一种基于改进并行回火训练的受限波尔兹曼机的音素识别算法。首先,利用经过等能量划分后的改进并行回火算法来训练受限玻尔兹曼机,接着将受限玻尔兹曼机堆叠组成一个深信度网络,从而作为深度神经网络预训练的基础模型,然后通过softmax层输出,得到用于音素状态后验概率检测的深度神经网络。接着,利用少量的标签数据,根据反向传播算法对网络权重进行微调。最后,将所得后验概率作为隐马尔科夫的发射概率,然后利用Viterbi解码器实现音素识别。在TIMIT语料库上的实验表明,识别率相比于传统的对比散度类算法提高了约4.5%,在不增加计算量的情况下比原始并行回火算法提高约1%。     

ʵʱ����ƽ�ⷴ�ݳ�����EAST PCS�еļ���

为提高等离子体实时平衡反演过程的精度和效率,开发了基于图形处理器(GPU)的P-EFIT程序.简要概括EAST PCS软硬件架构后,描述了并行实时平衡反演程序P-EFIT在EAST PCS中的集成工作.为了验证集成系统的正确性与可用性,用历史实验数据作了性能测试,满足实时控制的要求.目前P-EFIT已集成在EAST中并用于等离子体控制,EAST实验证明控制性能良好.     

大规模声学边界元法的GPU并行计算

提出一种大规模声学边界元法的高效率、高精度GPU并行计算方法.基于Burton-Miller边界积分方程,推导适于GPU的并行计算格式并实现了传统边界元法的GPU加速算法.为提高原型算法的效率,研究GPU数据缓存优化方法.由于GPU的双精度浮点运算能力较低,为了降低数值误差,研究基于单精度浮点运算实现的doublesingle精度算法.数值算例表明,改进的算法实现了最高89.8%的GPU使用效率,且数值精度与直接使用双精度数相当,而计算时间仅为其1/28,显存消耗也仅为其一半.该方法可在普通PC机(8GB内存,NVIDIA Ge Force 660 Ti显卡)上快速完成自由度超过300万的大规模声学边界元分析,计算速度和内存消耗均优于快速边界元法.     

基于格子Boltzmann方法的多孔介质流动模拟GPU加速

利用NVIDIA CUDA平台,在GPU上结合稀疏存贮算法实现基于格子Boltzmann方法的孔隙尺度多孔介质流动模拟加速,测试该算法相对基本算法的性能.比较该算法在不同GPU上使用LBGK和MRT两种碰撞模型及单、双精度计算时的性能差异.测试结果表明在GPU环境下采用稀疏存贮算法相对基本算法能大幅提高计算速度并节省显存,相对于串行CPU程序加速比达到两个量级.使用较新构架的GPU时,MRT和LBGK碰撞模型在单、双浮点数精度下计算速度相同.而在较上一代的GPU上,计算精度对MRT碰撞模型计算速度影响较大.