CFD程序验证的虚构解方法及其边界精度匹配问题

采用网格收敛分析和虚构解理论对程序验证进行了理论探索与数值实验研究,并发展完善了该方法.给出了虚构解程序验证中一种比较简单的源项处理方案;给出了虚构解程序验证中气动方程组一种通用的虚构解系数选取方法,最后用虚构解方法对二维结构网格Euler流动计算程序ARC2D进行了验证,并发现了该程序边界条件实现精度与流场内部精度不相匹配问题,并给予了修正,数值实践证明虚构解方法是一种严格稳健有效的程序验证方法,用它完成的程序验证具有较高的可信度.     

物理质团法关于可压流计算的程序验证

为了评估无网格物理质团法(PECM)对可压流计算的可信性,结合物理认识对该方法的设计思想和数值格式进行了先验分析,基于9个一维模型数值解与参照解的对比信息,通过后验分析方法对PECM进行了程序验证,参照解包括无网格再生核粒子法(RKPM)的数值解以及精确解。验证结果表明:各种物理参数以及状态方程的强烈间断会导致RKPM严重的失稳或失真,而PECM在包括极大密度比在内的各种强间断条件下仍保持稳定和收敛并具有较高的准确度。      

制导误差分离中环境函数矩阵的精确计算方法

主要讨论了制导工具误差分离中环境函数矩阵的精确计算问题。环境函数矩阵的计算精度对制导工具误差分离精度有重要影响。提出了2种精确计算环境函数矩阵的方法,用六自由度弹道仿真程序验证了2种方法的有效性。     

CFD空间精度分析方法及4种典型畸形网格中WCNS格式精度测试

计算流体力学中的精度阶数体现的是数值解随着网格加密向精确解收敛的速度,计算格式、网格质量和边界处理等都会影响计算精度。5阶非线性加权紧致格式(WCNS-E-5)是一种具有较高的精度和分辨率的有限差分格式,对强激波和复杂网格的适应性强。但是,格式的模板自适应选择器和网格的复杂性等都会对最终计算精度造成影响。为了分析精度,首先给出了两种通过数值解反推计算格式精度的方法:一种方法适合已知精确解的情况,另一种方法适合未知精确解的情况。然后在斜交网格、拉伸网格、拐折网格和扭曲网格等4种典型畸形网格中考察了WCNS-E-5格式的精度,考察算例涉及线性波动问题、等熵涡传播问题和超声速边界层问题等。计算结果表明WCNS-E-5在这四种网格中都体现出高阶精度。     

序列响应面法及其在飞机结构可靠性分析中的应用

响应面法是当前求解大型结构可靠性问题最有希望的方法之一。本文阐述了响应面法的基本思想，提出了一种与重要取样法相结合的序列响应面法，并介绍了基于这种方法的飞机结构可靠性分析程序RSM。文中给出了用RSM对一系列结构问题（包括著名的AGARD机翼模型）进行可靠性分析的结果，并通过与精确解及随机有限元计算结果的对比，指出了本文所述方法与程序的实用性。     

一类轴流叶轮机转/静干扰问题的 3D Euler 数值研究方法

本文将作者发展的定常N-S解程序,改编成时间精确Euler解程序,用于研究转/静干扰问题。对一台高负荷风扇级无粘流场进行时间精确模拟的结果表明,该方法可被应用于轴流叶轮机内非定常流动机理研究。      

用有限差分法解薛定谔方程

针对量子力学中大多数量子体系的哈密顿算符都比较复杂，薛定谔方程均不能得到严格解或分析解的问题，提出了用数学中的有限差分法来解决计算量子力学中薛定额方程的本征问题。对普通的径向薛定谔方程和含时的薛定谔方程进行了有限差分法的分析，给出了两种薛定谔方程的有限差分法的离散方程。并以线性谐振子为例，进行了计算机编程推算。结果表明，该方法在研究量子力学问题中具有广泛的应用前景。     

基于非精确计算的空间探测相控阵雷达任务规划算法

针对空间探测相控阵雷达系统，提出了一种新的基于非精确计算模型的观测任务规划算法。首先，建立了目标观测的实时任务模型，并分析了观测任务所占用传感器的资源；其次，基于非精确计算模型，提出一种多任务并行的实时容错调度算法来解决观测任务规划问题，该算法综合考虑相控阵雷达的搜索任务与跟踪任务，来进行系统资源的分配。对于跟踪任务，算法结合目标的过境时间以及当前系统的负载情况，以此来确定雷达对该目标的观测时间段；最后给出了算法的评估方法。利用2886个低轨空间目标进行仿真验证，结果表明，基于非精确计算模型的任务规划算法，可显著提高系统调度成功率以及时间资源利用率．比传统方法更稳健。     

一种随机结构可靠度分析方法

 对利用确定性有限元和一次二阶矩计算结构可靠度的方法进行了研究,并编制了相应的计算程序。该方法计算量小,简便实用,在结构随机参数分散性不大的情况下可以给出满足工程精度要求的解。     

基于失效模式框图的机载设备安全性评估研究

为了解决故障树方法割集遗漏问题和FMEA方法信息遗漏问题,提出一种新型的基于FMEA的安全性分析建模与数值解算方法——失效模式框图法(FMBD).通过FMEA分析得出相应设备的失效模式,根据设备工作机理及其各部分的相互关系,建立失效模式框图,推导失效率解算表达式.与通过FTA方法进行失效率计算相比,不但简化了安全性分析过程,而且克服了FTA方法可能导致的割集遗漏问题;提高了失效率估算精度.将该方法应用于飞机发电机过压保护器(OPU)的安全性分析,通过对OPU主要功能的安全性指标研究,提出了硬件设计修改意见,改进后OPU主要功能的安全性得到了很大提高,使得该设备满足预分配的研制等级要求;验证了该方法的可行性和准确性.该方法可用于飞机系统各级别的失效率分析解算,为飞机安全性分析提供了新途径.     

发动机故障诊断的MONTE CARLO通解算法

给出了发动机故障诊断的 Monte Carlo通解算法,该算法可以有效地解决发动机故障诊断算法中由于故障方程存在多重共线性所引起的误诊、漏诊与多解问题。首先给出求解故障方程的 Monte Carlo算法,该算法能够保证得到满足故障方程的全部合理解;能够简单地用于各种故障相关性准则 (例如各种残差向量范数准则 )以及亚定故障方程的求解问题;并且算法简单易行,无需为每个特定情况专门编制计算程序。其次提出了基本解与通解的概念,并且给出了利用主成分分析与利用主因子模型求基本解的两种有效算法。利用基本解与通解算法可以将由于多重共线性引起的复杂故障诊断结果表示为简单明了的形式,有利于对诊断结果作出正确决策。用计算机模拟方法对算法的有效性进行了分析,对于 JT9D发动机气路方面的 2 4个实际故障样本,所给出的算法的确诊率为 86%～ 92 %     

小推力深空探测轨道全局优化设计

 针对小推力深空探测四维轨道优化设计,给出了一种组合优化算法,采用该算法基于二体模型进行了深空探测四维轨道全局优化。该组合优化算法由动态规划算法、静态参数优化算法与共轭梯度算法组成。动态规划算法和静态参数优化算法用以选择最优的发射窗口、返回窗口及相应的近似飞行轨道;基于该近似轨道方案,采用共轭梯度算法（解决两点边值问题）求解精确的最优轨道。通过大量的数值仿真计算,得到了航天器的全局最优飞行轨道,及相应的最优发射窗口与返回窗口。数值仿真结果表明,该组合优化算法对深空探测轨道优化具有良好的通用性和工程运用价值。     

ARI_OPT气动优化软件研究进展及应用综述

针对飞行器气动外形精细化设计需求,为提高设计效率和设计质量,基于数值优化设计技术发展了气动优化设计工具ARI_OPT。ARI_OPT包含气动外形参数化、网格自动变形、高逼真度数值模拟、代理模型、高效优化算法等模块,分别简要介绍了各个模块基本的基本原理和方法及单个模块的验证结果。给出了ARI_OPT针对数值函数算例的功能验证结果和宽速域翼型、多段翼型和飞翼布局机翼等典型单目标和多目标气动外形优化问题的应用算例,表明了其可靠性和适用性。     

基于混合并行多目标禁忌搜索算法的飞机总体优化设计研究(英文)

基于飞机总体设计中的多目标优化问题,采用了一种全新的混合并行多目标禁忌搜索算法。文章首先提出了一种创新的多目标禁忌搜索(MOTS)算法,该算法在传统的MOTS的基础上,增加了TS算法与"Pareto解"的融合机制、优秀解保留机制、"多方向搜索"策略等新的元素。随后又将该算法作了改进,创立了并行多目标禁忌搜索算法。最后在此基础上将并行多目标禁忌搜索与基于向量排序的多目标遗传算法相结合,提出了一种新的混合算法—混合并行多目标禁忌搜索算法。通过对以上各种算法运行结果的比较,得出如下结论:与改进前的多目标禁忌搜索算法相比,并行的MOTS运行结果更优,而混合的MOTS的结果又比前两者更胜一筹。     

Analytical solution methods for eigenbuckling of symmetric cross-ply composite laminates

Based on the first-order shear deformation theory, this paper explores the analytical methods for eigenbuckling of symmetric cross-ply rectangular composite laminates with a pair of parallel edges simply supported and the remaining two edges arbitrarily constrained. The main con-tribution of present paper lies in two aspects: one is to present a simple and effective analytical method, namely, the separation-of-variables method, which can generate the closed-form buckling solutions without any computational difficulty;the other is to incorporate the accurate computation method of exponential matrix into the state space technique to avoid the inevitable numerically ill-conditioned problems reported in several literatures. The results obtained via both analytical meth-ods are identical, and a good agreement with their counterparts in literature is observed. The separation-of-variables method can generate exact solutions within 1 s, which is impossible if the state space method is employed. Besides, the combination of the accurate computation method of exponential matrix and the state space method greatly improves the computational efficiency and gives correct results compared with the straightforward use of state space method.     

A new method of single celestial-body sun positioning based on theory of mechanisms

Considering defects of current single celestial-body positioning methods such as discon-tinuity and long period, a new sun positioning algorithm is herein put forward. Instead of tradi-tional astronomical spherical trigonometry and celestial coordinate system, the proposed new positioning algorithm is built by theory of mechanisms. Based on previously derived solar vector equations (from a C1R2P2 series mechanism), a further global positioning method is developed by inverse kinematics. The longitude and latitude coordinates expressed by Greenwich mean time (GMT) and solar vector in local coordinate system are formulated. Meanwhile, elimination method of multiple solutions, errors of longitude and latitude calculation are given. In addition, this algo-rithm has been integrated successfully into a mobile phone application to visualize sun positioning process. Results of theoretical verification and smart phone’s test demonstrate the validity of pre-sented coordinate’s expressions. Precision is shown as equivalent to current works and is acceptable to civil aviation requirement. This new method solves long-period problem in sun sight running fix-ing and improves applicability of sun positioning. Its methodology can inspire development of new sun positioning device. It would be more applicable to be combined with inertial navigation systems for overcoming discontinuity of celestial navigation systems and accumulative errors of inertial nav-igation systems.     

Optimizing Murty's ranked assignment method

We describe an implementation of an algorithm due to Murty for determining a ranked set of solutions to assignment problems. The intended use of the algorithm is in the context of multitarget tracking, where it has been shown that real-time multitarget tracking is feasible for some problems, but many other uses of the algorithm are also possible. The following three optimizations are discussed: (1) inheriting dual variables and partial solutions during partitioning, (2) sorting subproblems by lower cost bounds before solving, and (3) partitioning in an optimized order. When used to find the 100 best solutions to random 100/spl times/100 assignment problems, these optimizations produce a speedup of over a factor of 20, finding all 100 solutions in about 0.6 s. For a random cost matrix, the average time complexity for finding k solutions to random N/spl times/N problems appears to be nearly linear in both k and N, for sufficiently large k.     

Closed-form posterior Cramer-Rao bounds for bearings-only tracking

We address the classical bearings-only tracking problem (BOT) for a single object, which belongs to the general class of nonlinear filtering problems. Recently, algorithms based on sequential Monte-Carlo methods (particle filtering) have been proposed. As far as performance analysis is concerned, the posterior Cramer-Rao bound (PCRB) provides a lower bound on the mean square error. Classically, under a technical assumption named "asymptotic unbiasedness assumption", the PCRB is given by the inverse Fisher information matrix (FIM). The latter is computed using Tichavsky's recursive formula via Monte-Carlo methods. Two major problems are studied here. First, we show that the asymptotic unbiasedness assumption can be replaced by an assumption which is more meaningful. Second, an exact algorithm to compute the PCRB is derived via Tichavsky's recursive formula without using Monte-Carlo methods. This result is based on a new coordinate system named logarithmic polar coordinate (LPC) system. Simulation results illustrate that PCRB can now be computed accurately and quickly, making it suitable for sensor management applications     

Formal verification and legacy redesign

Sustaining weapons system hardware and software represents a significant and ever-increasing portion of total system cost. Hardware components are becoming obsolete much sooner while weapons system lifetimes are increasing, We must identify more cost-effective solutions to engineering and reengineering these subsystems. Verifying and validating weapons systems are two of the most costly parts of either engineering process. Traditionally, hardware validation and verification is done by simulation and testing, In the past few years, math- and logic-based formal methods tools have begun to scale up to and be applied successfully to real-world problems. Incorporating formal verification methods into engineering and reengineering processes will cost-effectively and significantly improve the level of trust and the quality of our weapons systems. Formal methods are especially well suited for redesigning current weapon systems which have become unsupportable due to component obsolescence because they help minimize the astronomical costs of rigorously reverifying the reengineered components. We believe that formal methods are an important tool for effective engineering of future weapon systems