基于改进布谷鸟算法识别瞬态热传导问题的导热系数

基于改进布谷鸟算法反演瞬态热传导问题随温度变化的导热系数.采用Kirchhoff变换将非线性热传导问题转换为线性热传导问题,使用边界元法求解瞬态热传导正问题.将导热系数的反演转化为函数表达式中未知参数的反演,使用改进布谷鸟算法求解未知参数.与共轭梯度法相比,改进布谷鸟算法对迭代初值不敏感;与布谷鸟算法相比,改进布谷鸟算法迭代次数大大减少.数值算例表明对改进布谷鸟算法,增加测点数量迭代次数增加;增加鸟巢数量迭代次数减少;减小测量误差计算结果更精确,同时迭代次数更少.数值算例验证了改进布谷鸟算法反演导热系数的准确性和有效性.     

超声回波参数估计的初值选取方法

针对超声回波参数估计中,初值随机选取带来的收敛速度慢,搜索效率低,易受噪声影响等问题,对回波参数估计的初值选取进行了探讨。理论上研究了超声回波信号的包络和能量与信号参数的关系,阐明了从信号自身选取参数初值的可行性。在此基础上,利用希尔伯特变换和傅里叶变换提取有效信息,为回波参数估计提供合适的初值,从而减少估计过程的迭代次数、提高参数估计速度。实验结果表明,与传统参数估计方法相比,该方法在不同信噪比情况下都可获得较高的估计精度,而且参数估计的收敛速度较快。      

高对比度目标的电磁逆散射超分辨成像

提出了一种适用于高对比度目标的超分辨成像方法,通过结合对比度源反演方法与基于轨道角动量的超分辨技术,实现对高对比度目标的超分辨成像.首先采用基于轨道角动量的成像方法求解出对比度函数,将其作为对比度源反演方法的迭代初值,虽然初值结果与实际目标相差较大,但是由于初值中已经包含了关于目标的倏逝波信息,再利用这个初值开始迭代便可以得到超分辨重建结果,这种方法具有一定的抗噪声能力.本文研究表明,为了实现超分辨成像,一方面需要将目标对应的倏逝波信息转化到测量数据中,另一方面还要保证成像算法能够充分利用这些信息.本文所引申出的关于超分辨信息的概念对于逆散射超分辨成像的研究具有一定的借鉴意义.     

段能量平衡方程组主变量修正法及与其他几种算法的比较

详细介绍主变量修正法的原理及求解过程,采用典型算例,从初值要求、迭代次数等方面比较其优越性,进一步证明主变量修正法在求解段能量平衡方程组方面的实用性和优越性.     

高斯回波模型在超声回波模拟中的应用及其迭代算法的讨论

本文将超声回波模拟成被高斯白噪声污染的高斯回波，并建立关于一系列估计参数的非线性模型，如回波的频带宽度，到达时间，中心频率，相位及回波幅度。这些参数对于超声无损检测中材料检测、目标探测、目标分类、及速率测量等密切相关。运用高斯-牛顿算法进行迭代计算，该算法能以较少的迭代次数计算出较为精确的参数向量，但该算法对到达时间T的初值设置较为敏感。     

X射线双能CT投影分解优化迭代方法

双能CT投影分解是双能CT预处理重建算法的关键步骤。采用迭代算法求解双能积分方程组时,迭代初值的选择对迭代的收敛性影响很大。基于此本文提出了一种优化迭代算法,在计算双能基材料投影查找表、进行系统标定时,依据高低能投影数据的数值范围,设定一定的步长,按照高低能投影值的大小顺序依次求解对应的基材料投影,且上次的收敛结果作为下一次迭代的初值,可以有效提高迭代的收敛性,实际的实验结果验证了优化迭代算法的有效性。     

中子输运方程源项反演的瑞利商迭代算法

中子输运方程源项反演问题中,有效倍增因子的求解经过球谐函数展开和差分离散后,转化为求解大型矩阵的特征值问题.针对矩阵的特点,利用Gerschgorin圆盘定理,给出反幂法迭代初值的选取方法,并进行相应的扰动分析.针对有效倍增因子是矩阵最大特征值的特点,采用瑞利商迭代算法进行求解.理论和算例表明,该方法不需选取特定初值,达到三阶收敛速度.     

基于FOA-LM算法的超声回波信号参数估计

在超声回波参数估计中,搜索莱文伯格一马夸特(Levenberg-Marquard,LM)算法的最优解会受到迭代初值与参数向量真实解接近程度的影响。针对LM算法对迭代初值敏感的问题,提出了果蝇优化算法(Fruit fly optimization algorithm,FOA)算法和LM算法结合的参数估计方法。该方法充分利用FOA算法善于进行全局搜索和LM算法善于进行局部快速搜索的优点,首先使用FOA算法求出超声回波信号的参数初值,然后利用这组初值进行LM法迭代搜索。仿真结果表明,基于FOA和LM算法相结合的方法,具有收敛速度快,精度高的特点。     

X射线双能计算机层析成像投影分解的优化迭代方法

双能计算机层析成像(CT)投影分解是双能CT预处理重建算法的关键步骤,在采用迭代算法求解双能投影积分方程组时,迭代初值的选择对迭代的收敛性影响很大。为了解决双能投影积分方程组迭代求解的初值选择问题,提出一种优化迭代算法。该算法在计算双能基材料投影查找表以及进行系统标定时,依据高低能投影数据的数值范围,设置一定的步长,按照高低能投影值的大小依次求解对应的基材料投影,并以上次的收敛结果作为下次迭代的初值。结果表明,该优化迭代算法有效改善了迭代的收敛性,提高了双能CT系统标定的效率,验证了算法的有效性。     

混沌伪随机序列的谱熵复杂性分析

为了准确分析混沌伪随机序列的结构复杂性,采用谱熵算法对Logistic映射、Gaussian映射和TD-ERCS系统产生的混沌伪随机序列复杂度进行了分析.谱熵算法具有参数少、对序列长度N(惟一参数)和伪随机进制数K鲁棒性好的特点.采用窗口滑动法分析了混沌伪随机序列的复杂度演变特性,计算了离散混沌系统不同初值和不同系统参数条件下的复杂度.研究表明,谱熵算法能有效地分析混沌伪随机序列的结构复杂度;在这三个混沌系统中,TD-ERCS系统为广域高复杂度混沌系统,复杂度性能最好;不同窗口和不同初值条件下的混沌系统复杂度在较小范围内波动.为混沌序列在信息安全中的应用提供了理论和实验依据.     

Acceleration of the iterative solver in the discrete dipole approximation: Application to the orientation variation of irregularly shaped particles

We have applied a method of reducing the number of iterations required to solve a system of linear equations in the discrete dipole approximation. This method obtains an initial guess of dipole polarization from those with similar particle characteristics (e.g., the size parameter and refractive index) calculated a priori. If the initial guess is closer to the solution, the number of iterations of the linear equation solution becomes smaller than that calculated with an arbitrary initial value.

This method was applied to various particle orientations using spline interpolation of the initial guess of dipole polarization from orientations calculated a priori.

We studied three types of particle model: an aggregate, a deformed sphere with moderate surface roughness, and a particle with a large number of edges. For the particle with a large number of edges, we propose a new model called the overlapping mixture of multiple tetrahedra (OMMT).

The proposed method is most advantageous for particles with moderate surface roughness (e.g., a deformed sphere), for which the calculation time was reduced to 20–40% of the original calculation time. For OMMT and an aggregate, the computation time was reduced to 30–60% and 40–90%, respectively. The differences in the scattering coefficient, absorption coefficient, intensity and polarization introduced by our method were less than 0.008%, 0.03%, 0.1%, and 0.08%, respectively.

If the light scattering properties vary slowly with the orientation variation, interpolation of the results is more efficient than the proposed method and produces only a small difference in the results. However, the interpolation of the results fails for particles such as BCCA64, for which our proposed method produces more accurate results.     

三维预处理技术初探

本文应用高阶近似LU分解法对三维椭圆型方程的正规七点差分矩阵给出了预处理阵,并对典型问题给出了预处理共轭梯度法的计算结果。文中所采用的分阶方论以及阶矩阵等概念,适用于一般的非奇异对角优势稀疏矩阵。对不同网格点数的计算结果表明,三维预处理共轭梯度法仍具有超线性的收敛速率,在高阶情形下超线性的特征尤为突出,由于非零对角线数增长过快,高阶的三维预处理方法不宜采用,零阶方法和一阶方法是值得推荐的。     

复代数方程组几种迭代法的比较

本文从二维非线性Schrödinger方程出发,推导出五对角的复代数方程组,并应用高斯-赛德尔迭代法、SOR迭代法、复双共轭梯度法以及预处理复双共轭梯度法等对求解的计算量进行了比较。同时,又将复代数方程组化成七对角的实代数方程组,用高斯-赛德尔迭代法、SOR迭代法以及PCG法(预处理共轭梯度法)等进行了比较。结果表明,PCG法在上述几种方法中是最有效的。本文还对SOR松弛因子的选择进行了讨论。     

Kalman filter based initial guess estimation for digital image correlation

In applications digital image correlation based algorithms often present a basis for analysis of movement/deformation of bodies. The sequence of the obtained images is analyzed for this purpose. Especially, in cases when the body׳s movement/deformation between two successive images is significant, the initial guess can have a major influence on the execution speed of the algorithm. In the worst case it can even cause the divergence of the algorithm. This was the inspiration to develop a new and unique approach for an accurate and reliable determination of an initial guess for each image pixel. Kalman filter has been used for this purpose. It uses past measurements of observed variable(s) for calculations. Beside that it also incorporates state space model of the actual system. This is one of the most important advantages provided by Kalman filter. The determined initial guess by the proposed method is actually close to the true one and it enables fast convergence. Even more important property of this approach is the fact that it is not path-dependant because each image pixel, which is defined in ROI, is tracked through the sequence of images based on its own past measurements and general state space model. Consequently, the proposed method can be used to analyze tasks where discontinuities between image pixels are present. The applied method can be used to predict an initial guess where reference and deformed subsets are related by translational and rotational motion. The advantages mentioned above are verified with numerical and real experiments. The experimental validations are performed by NR (Newton–Raphson) approach which is the most widely used. Beside NR method the presented algorithm is applicable for other registration methods as well. It is used as an addition for calculation of initial guesses in a sequence of deformed images.     

关于PCG迭代矩阵特征值近似计算

对于预处理共轭梯度法,本文给出其迭代矩阵AM^-1与三对角阵B_s之间的关系,并对B_s的特征值分布作了分析,进而得到关于AM^-1特征值的一些性质。通过算例对两者的特征值及条件数进行了探讨。     

The inverse problem of bimorph mirror tuning on a beamline

One of the challenges of tuning bimorph mirrors with many electrodes is that the calculated focusing voltages can be different by more than the safety limit (such as 500 V for the mirrors used at 17‐ID at the Advanced Photon Source) between adjacent electrodes. A study of this problem at 17‐ID revealed that the inverse problem of the tuning in situ, using X‐rays, became ill‐conditioned when the number of electrodes was large and the calculated focusing voltages were contaminated with measurement errors. Increasing the number of beamlets during the tuning could reduce the matrix condition number in the problem, but obtaining voltages with variation below the safety limit was still not always guaranteed and multiple iterations of tuning were often required. Applying Tikhonov regularization and using the L‐curve criterion for the determination of the regularization parameter made it straightforward to obtain focusing voltages with well behaved variations. Some characteristics of the tuning results obtained using Tikhonov regularization are given in this paper.     

Retrieval of transverse relaxation time distribution from spin-echo data by recurrent neural network

Inversion of transverse relaxation time decay curve from spin-echo experiments was carried out using Hopfield neural network, to obtain the transverse relaxation time distribution. The performance of this approach was tested against simulated and experimental data. The initial guess, necessary for the integration procedure, was established as the analytical Laplace inversion. Together with errors in the simulated data, inversion was also carried out with errors in this initial guess. The probability density function, calculated by the neural network, is used in multiple sclerosis diagnostics.     

Path-independent digital image correlation with high accuracy,speed and robustness

The initial guess transferring mechanism is widely used in iterative DIC algorithms and leads to path-dependence. Using the known deformation at a processed point to estimate the initial guess at its neighboring points could save considerable computation time, and a cogitatively-selected processing path contributes to the improved robustness. In this work, our experimental study demonstrates that a path-independent DIC method is capable to achieve high accuracy, efficiency and robustness in full-field measurement of deformation, by combining an inverse compositional Gauss–Newton (IC-GN) algorithm for sub-pixel registration with a fast Fourier transform-based cross correlation (FFT-CC) algorithm to estimate the initial guess. In the proposed DIC method, the determination of initial guess accelerated by well developed software library can be a negligible burden of computation. The path-independence also endows the DIC method with the ability to handle the images containing large discontinuity of deformation without manual intervention. Furthermore, the possible performance of the proposed path-independent DIC method on parallel computing device is estimated, which shows the feasibility of the development of real-time DIC with high-accuracy.     

出气边形状对叶栅中凝结流动影响机理的数值研究

湿蒸汽两相凝结流中凝结过程对流场参数的变化敏感。本文对一个叶型五种出气边形状对应的凝结流动进行了比较,以初步揭示几何参数影响凝结流动的机理。结果显示,出气边形状的改变影响凝结流中水滴状态、熵增、湿度、出口气流角的分布。在本文计算条件下,当出气边为平行于切向的平面时,流动中熵增最小,叶栅出口处湿度也最小,其原因在于这种出气边形状造成的流场参数改变使叶栅中蒸汽凝结过程受到抑制,叶栅出口蒸汽仍然维持了较高的非平衡程度。     

A search-and-track algorithm for controlling the number of guided modes of planar optical waveguides with arbitrary refractive index profiles

A search-and-track algorithm is proposed for controlling the number of guided modes of planar optical waveguides with arbitrary refractive index profiles. The algorithm starts with an initial guess point in the parameter space that supports a specific number of guided modes. Then, it searches for, and tracks, the boundaries of this space or another space supporting different number of modes. It does so by monitoring the sign of a unified cutoff dispersion function. The algorithm is applied to both symmetric and asymmetric silicon-based parabolic-index waveguides. It shows that unlike asymmetric waveguides, the single-mode condition of symmetric waveguides is controlled by TM-, as opposed to TE-, polarization. This abnormal polarization control is strongest for high index contrast waveguides of sub-micrometer core sizes. The results are verified by full-vectorial beam propagation method.