An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

Sensitivity improvement of aluminum-based far-ultraviolet nearly guided-wave surface plasmon resonance sensor

An aluminum (Al) based nearly guided-wave surface plasmon resonance (NGWSPR) sensor is investigated in the far-ultraviolet (FUV) region. By simultaneously optimizing the thickness of Al and dielectric films, the sensitivity of the optimized Al-based FUV-NGWSPR sensor increases from 183°/RIU to 309°/RIU, and its figure of merit rises from 26.47 RIU^-1 to 32.59 RIU^-1 when the refractive index of dielectric increases from 2 to 5. Compared with a traditional FUV-SPR sensor without dielectric, the optimized FUV-NGWSPR sensor can realize simultaneous improvement of sensitivity and figure of merit. In addition, the FUV-NGWSPR sensor with realistic materials (diamond, Ta₂O₅, and GaN) is also investigated, and 137.84%, 52.70%, and 41.89% sensitivity improvements are achieved respectively. This work proposes a method for performance improvement of FUV-SPR sensors by exciting nearly guided-wave, and could be helpful for the high-performance SPR sensor in the short-wavelength region.     

光寻址电位传感器的正交相位检波检测方法

光寻址电位传感器的幅度检测方法易受噪声干扰,灵敏度差,信噪比和精度低,且受调制光源的影响较大,影响检测结果的准确性.为此提出了一种基于正交相位检波的光寻址电位传感器检测方法.该方法是将光寻址电位传感器的输出光电流信号分别与两路正交信号相乘,通过低通滤波提取直流分量并相除,即可得到光寻址电位传感器的输出信号相位信息.与已有的光寻址电位传感器相位检测方法相比,该方法具有算法复杂度低、实时性高的优点.实验研究了调制光源光强对光寻址电位传感器幅度检测和相位检测的影响,对比分析了光寻址电位传感器的传统幅度检测方法与正交相位检波检测方法对pH检测的灵敏度、线性度及信噪比.结果表明,相比于幅度检测方法,调制光源光强对光寻址电位传感器的相位检测影响更小,在频率为10 kHz,pH的范围为1.68~10.01的情况下,相位检测方法比幅度检测方法测得的灵敏度增加了7 mV/pH,精度提高了14.9 mpH,非线性误差减小了0.003%,均方差减少了0.1051×10^-5,信噪比增加了8.2827 dB.该方法特别适用于弱光下的光寻址电位传感器检测.     

航空导管弯曲试验的疲劳裂纹萌生寿命

飞行器液压导管受接头和卡箍等约束，在使用的振动环境中，会因弯曲应力而导致破裂，影响到飞行安全．本文对飞行器液压系统通用的不锈钢导管的裂纹萌生寿命进行了试验研究．首先在对8 mm、12 mm 无缺陷导管和含U 型缺口8 mm 导管的疲劳试验和有限元分析的基础上，得到了导管的最大拉应变-裂纹萌生寿命数据．然后采用基于强度极限和弹性模量估算法的Manson-Coffin 公式来预测导管裂纹萌生寿命．最后引入加载类型修正系数、表面质量修正系数、试样尺寸修正系数、应力集中敏感系数和有效应力集中系数，使修正后的公式对三种类型的导管均有较好的裂纹萌生寿命预测精度．     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

固体力学有限元体系的结构拓扑变化理论

本文是文[1]的继续.文[1]提出了杆件系统的结构拓扑变化理论和拓扑变化法本文将这一理论和方法推进到连续体有限元体系;且在此基础上揭示出有限元体系的一个新性质,称为基本位移之梯度的正交性定理,从而给出一套设计敏度的显式表达式,可直接用于计算.     

一类含参广义集值拟变分包含组的解的灵敏性分析

本文引入了一类新的含参广义集值拟变分包含组,应用隐预解算子技巧,建立了该类变分包含组与一类不动点问题的等价性,在适当的条件下,分析了含参广义集值拟变分包含组的解的灵敏性,所得结果推广改进了最新文献中的许多结果．     

Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

Several promising approaches for hexahedral mesh generation work as follows: Given a prescribed quadrilateral surface mesh they first build the combinatorial dual of the hexahedral mesh. This dual mesh is converted into the primal hexahedral mesh, and finally embedded and smoothed into the given domain. Two such approaches, the modified whisker weaving algorithm by Folwell and Mitchell, as well as a method proposed by the author, rely on an iterative elimination of certain dual cycles in the surface mesh. An intuitive interpretation of the latter method is that cycle eliminations correspond to complete sheets of hexahedra in the volume mesh.

Although these methods can be shown to work in principle, the quality of the generated meshes heavily relies on the dual cycle structure of the given surface mesh. In particular, it seems that difficulties in the hexahedral meshing process and poor mesh qualities are often due to self-intersecting dual cycles. Unfortunately, all previous work on quadrilateral surface mesh generation has focused on quality issues of the surface mesh alone but has disregarded its suitability for a high-quality extension to a three-dimensional mesh.

In this paper, we develop a new method to generate quadrilateral surface meshes without self-intersecting dual cycles. This method reuses previous b-matching problem formulations of the quadrilateral mesh refinement problem. The key insight is that the b-matching solution can be decomposed into a collection of simple cycles and paths of multiplicity two, and that these cycles and paths can be consistently embedded into the dual surface mesh.

A second tool uses recursive splitting of components into simpler subcomponents by insertion of internal two-manifolds. We show that such a two-manifold can be meshed with quadrilaterals such that the induced dual cycle structure of each subcomponent is free of self-intersections if the original component satisfies this property. Experiments show that we can achieve hexahedral meshes with a good quality.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.