Validation of MODIS and Deep Blue aerosol optical depth retrievals in an arid/semi-arid region of northwest China

The global aerosol optical depth (AOD or τ) has been retrieved using the Dark Target algorithm (the C004 and C005 products) and the Deep Blue algorithm (DB product). Few validations have thus far been performed in arid/semi-arid regions, especially in northwest China. The ground-based remote sensing of AOD from sun photometers at four sites in Xinjiang during the years 2002–2003 is used to validate aerosol products, including C004, C005 and DB of the Moderate Resolution Imaging Spectroradiometer (MODIS). The results show substantial improvement in the C005 aerosol product over the C004 product. The average correlation coefficient of regression with ground measurements increased from 0.59 to 0.69, and the average offset decreased from 0.28 to 0.13. The slopes of the linear regressions tended to be close to unity. The percentage of AODs falling within the retrieval errors of 30% (or △τ = ±0.1 ± 0.2τ) increased from 16.1% to 45.6%. The best retrievals are obtained over an oasis region, whereas the worst are obtained over urban areas. Both the MODIS C004 and C005 products overestimate AOD, which is likely related to improper assumptions of the aerosol model and of the estimation of surface reflectance. An encouraging result has been derived with regard to validation of the DB AOD. Overall, the average offset, slope and correlation coefficient of regression with sun-photometer measurements are ?0.04, 0.88 and 0.85, respectively. Approximately 73% of the DB AOD retrievals fall within the expected error of 30%. Underestimation of the AOD by the DB products is observed. The aerosol model and estimations of surface reflectance in this region require further improvements.     

有限元子结构并行算法的性能分析

 对有限元子结构并行算法的主要步骤进行了归纳，比较准确地 计算了算法的计算量和通信量. 并在此基础上分析了算法的性能和可 扩展性，最后指出了影响算法并行效率的关键因素，并给出了算法优 化方向和改进建议.     

利用高阶分区并行算法实现直接数值模拟

在基于MPI环境的分布式内存机群上,结合高阶WENO-RF格式的特点,实现了5阶WENO-RF格式的分区并行计算方法,计算精度不受分区和节点数量影响。使用该分区并行算法以三维可压缩时间发展混合层为例进行了直接数值模拟,验证了并行算法的准确性,表明机群并行运算可以显著扩展微机的计算能力,并行效率高,减少了计算的墙上时间,适合在小型高速局域网内进行大规模数值模拟计算。     

Object‐oriented parallel algorithms for computing three‐dimensional isopycnal flow

In this paper, we derive an object‐oriented parallel algorithm for three‐dimensional isopycnal flow simulations. The matrix formulation is central to the algorithm. It enables us to apply an efficient preconditioned conjugate gradient linear solver for the global system of equations, and leads naturally to an object‐oriented data structure design and parallel implementation. We discuss as well, in less detail, a similar algorithm based on the reduced system, suitable also for parallel computation. Favorable performances are observed on test problems. Copyright © 2002 John Wiley & Sons, Ltd.     

二维自适应非结构网格DSMC并行算法研究

研究了二维自适应非结构网格DSMC并行算法实现的过程.首先提出了一类非结构网格自适应策略,有效降低了网格尺度对计算结果的影响,提高了流场的分辨率;然后基于PC-CLUSTER群机并行体系结构与消息传递库MPI并行环境,利用分区并行思想,设计了非结构网格DSMC并行算法,节约了计算时间.利用For-tran90的动态分配内存技术编制了通用计算程序;最后对过渡流域高超声绕流进行了数值模拟,计算结果初步验证了算法的可行性与有效性.     

A new tracking algorithm of PIV and removal of spurious vectors using Delaunay tessellation

 A new algorithm of Delaunay Tessellation Particle Tracking Velocimetry (DT-PTV in abbreviation) is proposed for tracking particles in images of a PIV system by making use of the Delaunay tessellation (DT). The algorithm is tested by using numerically simulated particle images. The calculation results based on DT are compared with those obtained by a conventional algorithm of Binary Image Cross-correlation method (BICC). The new algorithm shows higher performance of obtaining more identical particles in two consecutive images correctly with shorter computation time even if the images contain many particles. A further application of DT to elimination of spurious vectors is also discussed. Received: 24 November 1997/Accepted: 7 August 1998     

Implementation and efficiency analysis of parallel computation using OpenACC: a case study using flow field simulations

The Open Accelerator (OpenACC) application programming interface is a relatively new parallel computing standard. In this paper, particle-based flow field simulations are examined as a case study of OpenACC parallel computation. The parallel conversion process of the OpenACC standard is explained, and further, the performance of the flow field parallel model is analysed using different directive configurations and grid schemes. With careful implementation and optimisation of the data transportation in the parallel algorithm, a speedup factor of 18.26× is possible. In contrast, a speedup factor of just 11.77× was achieved with the conventional Open Multi-Processing (OpenMP) parallel mode on a 20-kernel computer. These results demonstrate that optimised feature settings greatly influence the degree of speedup, and models involving larger numbers of calculations exhibit greater efficiency and higher speedup factors. In addition, the OpenACC parallel mode is found to have good portability, making it easy to implement parallel computation from the original serial model.     

Parallel computing of discrete element method on multi-core processors

This paper describes parallel simulation techniques for the discrete element method (DEM) on multi-core processors. Recently, multi-core CPU and GPU processors have attracted much attention in accelerating computer simulations in various fields. We propose a new algorithm for multi-thread parallel computation of DEM, which makes effective use of the available memory and accelerates the computation. This study shows that memory usage is drastically reduced by using this algorithm. To show the practical use of DEM in industry, a large-scale powder system is simulated with a complicated drive unit. We compared the performance of the simulation between the latest GPU and CPU processors with optimized programs for each processor. The results show that the difference in performance is not substantial when using either GPUs or CPUs with a multi-thread parallel algorithm. In addition, DEM algorithm is shown to have high scalability in a multi-thread parallel computation on a CPU.     

Modeling nitrate aerosol distributions and its direct radiative forcing in East Asia with RAMS-CMAQ

The geographical and seasonal characteristics in nitrate aerosol and its direct radiative forcing over East Asia are analyzed by using the air quality modeling system RAMS-CMAQ coupled with an aerosol optical properties/radiative transfer module. For evaluating the model performance, nitrate ion concentration in precipitation, and mixing ratios of PM₁₀, and some gas precursors of aerosol during the whole year of 2007 are compared against surface observations at 17 stations located in Japan, Korea, and China, and the satellite retrieved NO₂ columns. The comparison shows that the simulated values are generally in good agreement with the observed ones. Simulated monthly averaged values are mostly within a factor of 2 of the measurements at the observation stations. The distribution patterns of NO₂ from simulation and satellite measurement are also similar with each other. Analysis of the distribution features of monthly and yearly averaged mass concentration and direct radiative forcing (DRF) of nitrate indicates that the nitrate aerosol could reach about 25–30% of the total aerosol mass concentration and DRF in Sichuan Basin, Southeast China, and East China where the high mass burden of all major aerosols concentrated. The highest mass concentration and strongest DRF of nitrate could exceed 40 μg/m³ and ?5 W/m², respectively. It also indicates that other aerosol species, such as carbonaceous and mineral particles, could obviously influence the nitrate DRF for they are often internally mixed with each other.     

A first parallel programming approach in basins of attraction computation

The paper focuses on the development of a numerical code for the computation of basins of attraction by using the parallel programming. Two different approaches based on the massage passing interface (MPI) standard are presented; the performance analysis presented encourages us to use a massive communication between nodes only for a few-cores architecture. The critical issues arising from the study of a generic dynamical system are discussed while the computation of basins is performed on a benchmark system described by Duffing׳s equation. We paid attention at the optimization of the computing time as well as the work time load on each node in order to develop a performing and portable code. For the presented codes, both the scalability with an implementation on a professional cluster and the capabilities of the parallelism in the elaborations of basins with a large set of initial conditions have been tested.     

An Efficient Parallel ADI Algorithm for Turbomachinery Flows

The paper describes a domain decomposition strategy which allows high efficiency parallel simulations of turbomachinery flows. The implicit ADI parallel solver is based on the scalar approximate factorisation. The Navier-Stokes (NS) and turbulence model equations are discretised by centred finite differences. The results prove that the parallel calculations with domain decomposition, in which each sub-domain explicitly communicates with the adjacent ones at the end of each implicit iteration, may suffer from a considerable deterioration of the convergence rate. A simple sub-iterative domain recoupling strategy allows recovering the convergence rate of a single processor computation. The strategy is carefully analysed and optimised in terms of inter-processor data communication rate and algorithm memory requirements. The span-wise domain decomposition is particularly suited for turbomachinery flows and is applied to a radial impeller and to an axial turbine stator and stage to prove the validity and the accuracy of the proposed approach. The results indicate that the parallel recoupled algorithm usually reach efficiencies of 0.8, with peaks over 0.9 with up to 16 processors, thereby allowing a considerable speed-up of design and verification calculations.     

A finite element parallel algorithm of the parametric variational principle for elastic contact problems

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.     

可扩展的冲击—接触并行计算研究

冲击—接触计算模型在汽车碰撞、金属成型等的模拟计算中有着广泛的应用，鉴于冲击—接触计算过程复杂和计算量大，本文在分布式可扩展的并行计算平台上，设计并实现了冲击—接触的并行计算。算例证明，计算平台稳定可靠，算法简单实用，且具有较好的并行效率和可扩展性。     

A dimension split method for the incompressible Navier–Stokes equations in three dimensions

In this paper, we describe a new method for the three‐dimensional steady incompressible Navier–Stokes equations, which is called the dimension split method (DSM). The basic idea of DSM is that the three‐dimensional space is split up into a cluster of two‐dimensional manifolds and then the three‐dimensional solution is approximated by the solutions on these two‐dimensional manifolds. Through introducing some technologies, such as SUPG stabilization, multigrid method, and such, we firstly make DSM feasible in the computation of real flow. Because of split property of DSM, all computation is carried out on these two‐dimensional manifolds, namely, a series of two‐dimensional problems only need to be solved in the computation of three‐dimensional problem, which greatly reduces the difficulty and the computational cost in the mesh generation. Moreover, these two‐dimensional problems can be computed simultaneously and a coarse‐grained parallel algorithm would be constructed, whereas the two‐dimensional manifold is considered as the computation unit. In the last, we explore the behavior and the accuracy of the proposed method in two numerical examples. Firstly, error estimates, performance of multigrid method, and parallel algorithm are well‐demonstrated by the known analytical solution case. Secondly, the computations of three‐dimensional lid‐driven cavity flows with different Reynolds numbers are compared with other numerical simulations. Results show that the present implementation is able to exhibit good stability and accuracy properties for real flows. Copyright © 2013 John Wiley & Sons, Ltd.     

Comparison of aerosol characteristics during haze periods over two urban agglomerations in China using CALIPSO observations

Using CALIPSO (cloud-aerosol lidar and infrared pathfinder satellite observation) vertical observation data during haze periods from January 2007 to December 2008, we analyzed differences in aerosol characteristics near the surface, as well as in the middle troposphere between the Beijing–Tianjin–Hebei metropolitan region (Area A) and the Yangtze River Delta region (Area B) in China. One significant difference was that haze pollution in Area A was related to local and non-local aerosols, while in Area B it was related to local anthropogenic sources. In all seasons apart from autumn, aerosol pollution in Area A was more severe than in Area B, both near the surface and at higher altitudes. In Area A, non-spherical aerosols were dominant from 0 to 4 km in spring, summer, and winter; while in autumn, there were considerably high numbers of non-spherical aerosols below 0.5 km, and near-spherical aerosols from 0.5 to 4 km. In Area B, both near-spherical and non-spherical aerosols were common in all seasons. Moreover, aerosols with attenuated color ratios of 0–0.2 were more common in all seasons in Area A than in Area B, indicating that fine particle pollution in Area A was more serious than in Area B. Finally, relatively large aerosols linked to gravity settling appeared more frequently near the surface in Area A than in Area B.     

A parallel unstructured dynamic mesh adaptation algorithm for 3‐D unsteady flows

An unstructured dynamic mesh adaptation and load balancing algorithm has been developed for the efficient simulation of three‐dimensional unsteady inviscid flows on parallel machines. The numerical scheme was based on a cell‐centred finite‐volume method and the Roe's flux‐difference splitting. Second‐order accuracy was achieved in time by using an implicit Jacobi/Gauss–Seidel iteration. The resolution of time‐dependent solutions was enhanced by adopting an h‐refinement/coarsening algorithm. Parallelization and load balancing were concurrently achieved on the adaptive dynamic meshes for computational speed‐up and efficient memory redistribution. A new tree data structure for boundary faces was developed for the continuous transfer of the communication data across the parallel subdomain boundary. The parallel efficiency was validated by applying the present method to an unsteady shock‐tube problem. The flows around oscillating NACA0012 wing and F‐5 wing were also calculated for the numerical verification of the present dynamic mesh adaptation and load balancing algorithm. Copyright © 2005 John Wiley & Sons, Ltd.     

用多色染色理论实现有限元刚度矩阵并行组集

根据多色染色理论，在同一节点有任意多个单元邻接的情况下，对有限元的单元进行了分类；在刚度矩阵组集时，同类单元可以并行计算，从而提高了组集效率．该并行算法在PVM(并行虚拟机器)并行平台上进行了具体实现，取得了较好的并行效率．     

Parallel finite element computation of unsteady incompressible flows

A parallel semi-explicit iterative finite element computational procedure for modelling unsteady incompressible fluid flows is presented. During the procedure, element flux vectors are calculated in parallel and then assembled into global flux vectors. Equilibrium iterations which introduce some ‘local implicitness’ are performed at each time step. The number of equilibrium iterations is governed by an implicitness parameter. The present technique retains the advantages of purely explicit schemes, namely (i) the parallel speed-up is equal to the number of parallel processors if the small communication overhead associated with purely explicit schemes is ignored and (ii) the computation time as well as the core memory required is linearly proportional to the number of elements. The incompressibility condition is imposed by using the artificial compressibility technique. A pressure-averaging technique which allows the use of equal-order interpolations for both velocity and pressure, this simplifying the formulation, is employed. Using a standard Galerkin approximation, three benchmark steady and unsteady problems are solved to demonstrate the accuracy of the procedure. In all calculations the Reynolds number is less than 500. At these Reynolds numbers it was found that the physical dissipation is sufficient to stabilize the convective term with no need for additional upwind-type dissipation. © 1998 John Wiley & Sons, Ltd.     

Aerosols dispersion modelling using probabilistic particle tracking

A method is proposed which can facilitate parallel computations of particle transport in complex environments, such as urban landscapes. A two stage‐approach is used, where in the first stage, physical simulations of various aerosol release scenarios are conducted on a high‐performance distributed computing facility, such as a Beowulf cluster or a computing grid, and stored in a database as a set of transfer probabilities. In this stage, the method provides a partially decoupled parallel implementation of a tightly coupled physical system. In the second stage, various aerosol release scenarios can be analysed in a timely manner, using obtained probability distributions and a simpler stochastic simulator, which can be executed on a commodity computer, such as a workstation or a laptop. The method presents a possibility of solving the inverse problem of determining the release source from the available deposition data. Using the proposed approach and developed graphical tools, a case of aerosol dispersion in a typical urban landscape has been studied. A considerable speedup of analysis time for different aerosol dispersion scenarios has been demonstrated. The method is appropriate for the development of express risk analysis systems. Copyright © 2006 John Wiley & Sons, Ltd.     

大型结构特征值问题的Lanczos子结构并行算法

本文利用子结构和Lanczos方法,提出了大型结构固有频率与模态的并行解法。该方法在Lanczos方法的求解过程中,仅利用子结构刚度阵和质量阵并行进行凝聚,进而求得新的迭代矢量,最终求得三对角阵对应的特征值和特征向量。该算法在西安交通大学ELXSI-6400并行计算机上程序实现,计算结果表明能有效地节省计算时间和计算机的内存,为一种有效的大型工程结构动力问题的求解方法。