基于MLFIPWA的复杂目标电磁散射分析

在积分方程法求解电磁散射中,用迭代方法计算的计算量为O(N2).快速非均匀平面渡算法(FIPWA)加速了矩矢相乘,使数值计算量减小到O(N3/4),而用多层快速非均匀平面波算法(MLFIPWA)则可减小到O(NlnN).可见,多层快速非均匀平面波算法(MLFIPWA)特别适合处理电大尺寸复杂目标的电磁散射分析.因此,就对这一算法的原理、数值实现及复杂度进行了详尽的研究,并给出了多层快速非均匀平面波算法(MLFIPWA)的计算实例验证了该方法的正确性及高效性.     

具有有限深度环缝的导电屏上单极天线的辐射特性

单极天线安装在理想导电平面屏上,屏上刻有有限深度的环形缝。将单极天线上电流及缝和自由空间交界处的等效磁流作为未知函数,建立了一对耦合积分方程。从方程得到电流和磁流的数值解。从这些电流和磁流计算了输入阻抗和辐射方向图。     

时域磁场积分方程迭代求解

利用时间步进算法(MOT)求解时域电场积分方程解决导体目标瞬态散射问题时,其计算结果不稳定,会发生后期震荡现象。通过对时域磁场积分方程显式和隐式方案的分析,推导出一种隐式的迭代方案,它不但易于实现,而且数值结果表明这种时域磁场积分方程MOT迭代方案比时域电场积分方程MOT具有更好的稳定性,延缓了后期震荡效应。     

三维介质体的时域散射分析

用时间递推(marching-on in-time,MOT)方法求解了电磁场时域耦合积分方程,计算了均匀介质体的表面等效电流和表面等效磁流,得到时域散射远场并给出了详细推导过程。举例比较了将时域散射用Fourier变化后在频域的RCS和频域直接求得的RCS,以说明该算法的正确性。     

水下平板结构声振耦合分析的等效源法研究

水下航行体在水下辐射的噪声是水下目标探测的主要信息来源，快速精确地计算其辐射噪声特征参数对于结构的声辐射预报与控制具有十分重要意义。不同于空气中结构声辐射的预报，重流体介质如水中结构的噪声计算，由于结构振动和声场之间存在的耦合作用以及边界面上计算中存在的奇异积分问题，导致传统的边界元方法在计算效率和精度上受到一定限制。为此，利用波叠加原理，通过在结构内部分布点声源等效模拟振动产生的结构外声场，并根据结构与介质的边界连续性条件和体积速度匹配原则，构建了声振耦合动力学方程，以求解相应的等效源强度，进一步计算了声功率等声学参数。以水下置于无限大障板上的矩形板为案例，采用所提方法计算其声功率，并与解析解进行对比，证明了该等效源法的有效性。     

结合多层快速多极和ILUT预处理算法分析复杂目标的电磁特性

分层快速多极算法(MLFMM)和ILUT预处理算法被结合来分析电大尺寸目标的电磁散射和辐射特性。采用矩量法求解电磁场积分方程,最终须要求解一线性方程组。分层快速多极算法被用来加速用迭代法求解线性方程组时的矩阵向量乘积的运算。ILUT预处理算法被用来降低方程组系数矩阵的条件数,加快迭代法的收敛速度。计算实例表明了该方法的通用性和高效性。     

涡流检测线圈非对称工作态等效电感计算

提出了一种电涡流传感器检测线圈非对称工作态等效电感的计算方法,并建立了电涡流传感器检测线圈与被测导体的非对称模型。针对该模型,首先利用理论分析和有限元分析相结合的方法,推导出了非轴对称条件下线圈电感的计算公式,该公式描述了线圈等效电感随导体的径向、轴向位移,线圈与导体几何参数与电磁参数的变化规律;然后,选取一个典型的平面线圈样品进行了仿真与实验对比,对比结果表明:该公式的计算结果与仿真、实验结果具有较高的一致性,且相比于利用有限元分析,该公式能够快速、准确地计算出非轴对称工作态涡流线圈的等效电感。     

电大尺寸组合目标RCS的MOM-PO混合算法分析

给出了一种用于电大尺寸组合目标雷达散射界面的建模与计算方法给出一种类似飞机的组合目标RCS的计算实例,通过与FMM(快速多极子方法)的计算结果比较表明,说明该方法能快速有效地解决电大尺寸组合目标的电磁散射问题,证明该混合算法的有效性.     

用动网格法计算理想平板的颤振导数

提出了一种数值模拟振动的理想平板绕流场 ,并提取其气动导数的方法。时间相关的不可压N S方程采用Projetion 2格式解耦 ,关于中间速度的动量方程的时间和空间离散采用二阶半隐格式 ,压力Possion方程迭代用多层网格法加速收敛。分别计算平板作竖向强迫振动或扭转强迫振动的气动力 ,用动网格法考虑平板和气流的耦合作用。由计算得到的气动力用最小二乘法确定 8个气动导数。计算结果和理想平板的Theodorsen理论值有较好的一致性     

非定常Euler方程数值计算中高精度格式应用

采用五阶精度加权紧致非线性格式(WCNS)和非定常“双时间步”方法求解非定常Euler方程,模拟NACA0012翼型强迫俯仰振动流场,研究了高精度格式应用到非定常计算时“双时间步”方法物理时间步长、子迭代收敛判据、子迭代步数以及物理时间导数离散方法对计算精度和计算效率的影响.     

二维 DFT 和 DCT 的 Systolic 阵列

超级计算中一个活跃的研究领域是将某些有限和,如离散富里叶变换(DFT)、离散余弦变换(DCT),映射到多处理机阵列上。本文首先通过二维DFT的行列分解算法流程图,给出了计算二维DFT的二种Systolic阵列:一种是由N_1个处理器组成的线性阵列,所花时间步为O(N_1N_2)(设二维DFT为N_1×N_2长的),与行列分解算法在单处理机上顺序执行所花时间相比,加速比为O(N)(设N_1=N_2=N)。这一结果无论是在时间消耗,还是在PE数量上都是目前最优的。另一种是由N_1×N_2个处理器组成的矩形阵列,所需时间为O(N_1+N_2),与行列算法在单处理机上顺序运行所花时间相比,加速比为O(N~2)(这里仍假定N_1=N_2=N)。本文还给出了二维DCT的与二维DFT相似的Systoilc阵列结构。不难将上述阵列推广到多维的情况。     

Pursuit around a hole

The solution of isaacs¹ problem of optimal pursuit in a plane with a circular disk removed, given constant speeds, zero turning radius, and perfect visibility for both players is presented herein. The hole has three effects: the trivial effect that shortest paths are not straight, the trapping effect to turn the evader from running into the hole, and the screening effect causing an evader retreating behind the hole not to retreat across a line through its center.     

对高温超导层状特性的解释

基于高温超导材料结构的准二维性,建立了高温超导的层状理论,得到了高温超导材料的临界温度Tc与Cu-O面数l间的关系,指出高物质密度N_i~0和高电子密度N_e~0的超导材料可能有更高的Tc。     

On computing the expected discounted return in a markov chain

The discounted return associated with a finite state Markov chain X₁, X₂… is given by g(X₁)+ αg(X₂) + α²g(X₃) + …, where g(x) represents the immediate return from state x. Knowing the transition matrix of the chain, it is desired to compute the expected discounted return (present worth) given the initial state. This type of problem arises in inventory theory, dynamic programming, and elsewhere. Usually the solution is approximated by solving the system of linear equations characterizing the expected return. These equations can be solved by a variety of well-known methods. This paper describes yet another method, which is a slight modification of the classical iterative scheme. The method gives sequences of upper and lower bounds which converge mono-tonely to the solution. Hence, the method is relatively free of error control problems. Computational experiments were conducted which suggest that for problems with a large number of states, the method is quite efficient. The amount of computation required to obtain the solution increases much slower with an increase in the number of states, N, than with the conventional methods. In fact, computational time is more nearly proportional to N², than to N³.     

Steady-state analysis of load balancing with Coxian-2 distributed service times

This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b ? 1, and can have at most one job in service and b ? 1 jobs in the buffer. The service time of a job follows the Coxian-2 distribution. We focus on steady-state performance of load balancing policies in the heavy traffic regime such that the normalized load of system is λ = 1 ? N^?α for 0 < α < 0.5. We identify a set of policies that achieve asymptotic zero waiting. The set of policies include several classical policies such as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) and power-of-d-choices (Po d) with d = O(N^α log N). The proof of the main result is based on Stein's method and state space collapse. A key technical contribution of this paper is the iterative state space collapse approach that leads to a simple generator approximation when applying Stein's method.     

Optimal dispatching strategies for vehicles having exponentially distributed trip times

A transportation system has N vehicles with no capacity constraint which take passengers from a depot to various destinations and return to the depot. The trip times are considered to be independent and identically distributed random variables. The dispatch strategy at the depot is to dispatch immediately, or to hold any returning vehicles with the objective of minimizing the average wait per passenger at the depot, if passengers arrive at a uniform rate. Optimal control strategies and resulting waits are determined in the special case of exponentially distributed trip time for various N up to N = 15. For N ? 1, the nature of the solution is always to keep a reservoir of vehicles in the depot, and to decrease (increase) the time headway between dispatches as the size of the reservoir gets larger (smaller). For sufficiently large N, one can approximate the number of vehicles in the reservoir by a continuum and obtain analytic experession for the optimal dispatch rate as a function of the number of vehicles in the reservoir. For the optimal strategy, it is shown that the average number of vehicles in the depot is of order N^1/3. These limit properties are expected to be quite insensitive to the actual trip time distribution, but the convergence of the exact properties to the continuum approximation as N → ∞ is very slow.     

A family of games on 1,∞)2 with payoff a function of y/x

A two-parameter class of games on 1,∞)² is studied. The games may be regarded as analogs of Silverman games, having continuous payoff function in place of a step function of y/x. This change is motivated by a desire to move toward a model for competitive situations where the penalty for overspending increases with the amount of overspending. There are some similarities to games with bell-shaped kernel. For most of the region considered in the plane of the two parameters there are solutions of finite type, which are obtained explicitly. There are, however, pockets in this plane where no optimal strategies have been found and possibly where none of finite type exist.     

Studies on the flame propagation characteristic and thermal hazard of the premixed N2O/fuel mixtures

An experimental study was carried out to investigate the flame propagation and thermal hazard of the premixed N₂O/fuel mixtures, including NH₃, C₃H₈ and C₂H₄. The study provided the high speed video images and data about the flame locations, propagation patterns, overpressures and the quenching diameters during the course of combustion in different channels to elucidate the dynamics of various combustion processes. The onset decomposition temperature was determined using high-performance adiabatic calorimetry. It was shown that the order of the flame acceleration rate and thermal hazard was N₂O/C₂H₄>N₂O/C₃H₈>N₂O/NH₃.     

A bivariate optimal replacement policy for a cold standby repairable system with repair priority

In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Reliability of a 2‐dimensional k‐within‐consecutive‐r × s‐out‐of‐m × n:F system

A 2‐dimensional rectangular (cylindrical) k‐within‐consecutive‐r × s‐out‐of‐m × n:F system is the rectangular (cylindrical) m × n‐system if the system fails whenever k components in a r × s‐submatrix fail. This paper proposes a recursive algorithm for the reliability of the 2‐dimensional k‐within‐consecutive‐r × s‐out‐m × n:F system, in the rectangular case and the cylindrical case. This algorithm requires min ( O (mk^r(n?s)), O (nk^s(m?r))), and O (mk^rn) computing time in the rectangular case and the cylindrical case, respectively. The proposed algorithm will be demonstrated and some numerical examples will be shown. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 625–637, 2001.