基于波数积分的水声传播建模实现方法研究

研究了基于波数积分的水声传播建模数值实现方法,利用局部系数矩阵的映射,建立了全局系数矩阵,分析了保持数值稳定性的方法。用FFP方法实现了数值积分,并讨论了实现过程中的一些细节。结合仿真实例与基于简正波的模型KrakenC和Kraken的计算结果进行了比较分析。结果表明,波数积分方法在近场计算时更为准确,同时还具有容易扩展到复数域计算衰减的问题、容易求解粘弹性介质中声场的特点。     

一种水平变化可穿透波导中声传播问题的耦合简正波方法

通过利用标准简正波程序KRAKEN计算本地简正波解及耦合矩阵, 进一步发展了求解水平变化波导中声场的全局矩阵耦合简正波方法(Luo et al., "A numerically stable coupled-mode formulation for acoustic propagation in range-dependent waveguides," Sci. China-Phys. Mech. Astron. 55, 572 (2012)), 使得该方法可以处理具有可穿透海底及随深度变化声速剖面等实际问题, 并提供声场的完全双向解. 本文还给出了双层波导中耦合矩阵的解析表达式, 并利用其验证了本方法中耦合矩阵数值算法的精度. 最后, 利用改善后的全局矩阵耦合简正波模型(DGMCM)计算了美国声学学会(ASA)提出的可穿透楔形波导标准问题, 将所得数值解与参考解比较, 结果表明DGMCM方法可以精确处理水平变化波导中声传播实际问题. 关键词： 耦合简正波理论 全局矩阵方法 可穿透楔形波导     

水平变化波导中的全局矩阵耦合简正波方法

提出了一种新的水平变化波导中声场的耦合简正波求解方法,该方法能够处理二维点源和线源问题,提供声场的双向解。该方法利用全局矩阵(DGM)一次性求解耦合模式的系数,消除了传播矩阵递推求解中存在的误差累积问题;此外,改善了现有模型中对距离函数的归一化方法,从而避免了泄露模式指数增长导致的数值溢出问题。本文还给出了绝对软海底理想波导中耦合矩阵的闭合表达式,并分析了单个阶梯下简正波耦合现象。此外,本文还计算了理想楔形波导中的声传播问题(ASA标准问题),并与解析解及COUPLE07计算结果进行了比较,结果表明该方法是一种稳定、精确的水平变化波导中的声场计算方法。      

导热问题的有限单元边界积分方程方法

一、引言 边界元计算方法是七十年代迅速发展起来的一种数值计算方法,其主要优点是:将求解区域微分方程的问题转化成求解边界积分方程的问题,因而一般都把物理问题降了一维求解,使该方法计算效率和求解精度都较高.但它用于时关问题和非线性问题时,积分方程中还含有物理量的区域积分项,该方法的优点几乎全部消失.另外,在边界积分方程离散后,代数方程的系数矩阵为满阵.如果边界单元划分很多,其效率不如具     

水平变化双层波导声传播问题的耦合简正波解

为了验证现有模型的精度,导出了全反射下边界双层波导中简正波耦合矩阵的解析表达式,并将其应用到全局矩阵耦合简正波模型(Direct Global Matrix Coupled-Mode)中,使得该模型可以提供水平变化双层波导问题的标准解。文中首先利用COUPLE的简正波及耦合矩阵数值解验证了该简正波及耦合矩阵解析表达式的正确性;其次,采用改进的DGMCM模型求解了双层波导海山声传播损失,结果表明,改进后的DGMCM模型可以非常精确地求解水平变化双层波导问题,可作为求解此类问题的标准模型使用。     

计算机控制光学抛光驻留时间求解中两类优化算法的分析

建立了基于矩阵计算的驻留时间计算模型,根据实际加工要求建立了最小二乘和最佳一致逼近最优化求解数学模型,总结了两类优化问题的求解方法。根据自研数学解法器,利用数值计算分析了这两类算法的计算特点。仿真结果显示,两种自研算法具有较高的计算精度,最小二乘逼近算法计算效率有待提高,对外界扰动和计算模型等误差不敏感,最佳一致逼近算法计算效率较高,但对误差比较敏感。实际加工时,如果面形精度已经比较高时,建议多采用最小二乘逼近算法。     

严格耦合波法计算闪耀光栅衍射效率

针对一般标量近似算法精度不高的问题,提出采用S矩阵的严格耦合波的方法计算光栅衍射效率.通过建立完整的闪耀光栅理论模型,对各分层电磁场进行傅里叶级数展开,采用散射矩阵方法求解各谐波系数,完成衍射效率计算.该方法已应用到红外光栅TE和TM 2种模式衍射效率的计算.分析了散射矩阵解决数值运算不稳定的原因,通过与标量近似计算方法进行比较,说明红外光栅衍射偏振特性.     

一种三维矩阵的奇异值分解算法

提出了一种三维矩阵的奇异值分解算法,该法适合处理具有三维矩阵数据的模式识别和分类模型等领域实际问题,该算法与二维矩阵奇异值分解算法类似,通过求解约束条件极值问题获得,该算法与已有的三线性分解算法比较,相对简单,计算速度快,适合处理数据量大的实际问题,该算法也很容易推广到更高维阵列的光谱数据。     

基于直线段对应的相机位姿估计直接最小二乘法

为了实现高精度的基于直线段对应的相机位姿估计,提出一种直接最小二乘法。通过提出并利用一种直线段之间的距离测度,将原问题转化为最小化一个姿态旋转矩阵的二次目标函数,该距离测度综合考虑了线段的端点距离、中点距离、夹角和线段的长度,通过旋转矩阵的CGR参数表达获得一个修正的目标函数,此修正目标函数的最优解条件组成了一个三元三次方程组,利用代数多项式方法在不需要迭代的情况下直接求解这个方程组,从而得到了旋转矩阵的全局最优解。该算法的计算复杂度为O(n)。仿真和真实实验验证了该方法的有效性和高精度。     

基于平面问题的位移压力混合配点法

引入压力变量,将弹性力学控制方程表达为位移和压力的耦合偏微分方程组,采用重心插值近似未知量,利用重心插值微分矩阵得到平面问题控制方程的矩阵形式离散表达式.采用重心插值离散位移和应力边界条件,采用附加法施加边界条件,得到求解平面弹性问题的过约束线性代数方程组,采用最小二乘法求解过约束方程组,得到平面问题位移数值解.数值算例验证了所提方法的有效性和计算精度.     

A Schur complement formulation for solving free-boundary,Stefan problems of phase change

A Schur complement formulation that utilizes a linear iterative solver is derived to solve a free-boundary, Stefan problem describing steady-state phase change via the Isotherm–Newton approach, which employs Newton’s method to simultaneously and efficiently solve for both interface and field equations. This formulation is tested alongside more traditional solution strategies that employ direct or iterative linear solvers on the entire Jacobian matrix for a two-dimensional sample problem that discretizes the field equations using a Galerkin finite-element method and employs a deforming-grid approach to represent the melt–solid interface. All methods demonstrate quadratic convergence for sufficiently accurate Newton solves, but the two approaches utilizing linear iterative solvers show better scaling of computational effort with problem size. Of these two approaches, the Schur formulation proves to be more robust, converging with significantly smaller Krylov subspaces than those required to solve the global system of equations. Further improvement of performance are made through approximations and preconditioning of the Schur complement problem. Hence, the new Schur formulation shows promise as an affordable, robust, and scalable method to solve free-boundary, Stefan problems. Such models are employed to study a wide array of applications, including casting, welding, glass forming, planetary mantle and glacier dynamics, thermal energy storage, food processing, cryosurgery, metallurgical solidification, and crystal growth.     

An accurate and efficient method for the incompressible Navier–Stokes equations using the projection method as a preconditioner

The projection method is a widely used fractional-step algorithm for solving the incompressible Navier–Stokes equations. Despite numerous improvements to the methodology, however, imposing physical boundary conditions with projection-based fluid solvers remains difficult, and obtaining high-order accuracy may not be possible for some choices of boundary conditions. In this work, we present an unsplit, linearly-implicit discretization of the incompressible Navier–Stokes equations on a staggered grid along with an efficient solution method for the resulting system of linear equations. Since our scheme is not a fractional-step algorithm, it is straightforward to specify general physical boundary conditions accurately; however, this capability comes at the price of having to solve the time-dependent incompressible Stokes equations at each timestep. To solve this linear system efficiently, we employ a Krylov subspace method preconditioned by the projection method. In our implementation, the subdomain solvers required by the projection preconditioner employ the conjugate gradient method with geometric multigrid preconditioning. The accuracy of the scheme is demonstrated for several problems, including forced and unforced analytic test cases and lid-driven cavity flows. These tests consider a variety of physical boundary conditions with Reynolds numbers ranging from 1 to 30000. The effectiveness of the projection preconditioner is compared to an alternative preconditioning strategy based on an approximation to the Schur complement for the time-dependent incompressible Stokes operator. The projection method is found to be a more efficient preconditioner in most cases considered in the present work.     

Calculation of Jacobians for inverse radiative transfer: An efficient hybrid method

We present an accurate and numerically efficient procedure of calculating Jacobians by finite difference that consists of two components: (1) a method employing the saving of atmospheric layers that accelerates the solution to the equation of radiative transfer for solvers that use the Discrete Space formulation and (2) a method of perturbing the eigenmatrix spectrum associated with a reduced attenuation matrix. The procedure eliminates the need to call the eigenmatrix package, here, LAPACK a second time and provides insights into the fundamental properties of the attenuation matrix, useful for characterizing the accuracy of the derivatives calculated by finite difference methods. The computational complexity of the perturbation method is 8n³+22n², where n is one half the number of streams in the radiance field as opposed to 16n³ using LAPACK. The method is not limited to the calculation of base state radiances I(ω) and those associated with an ‘infinitesimal’ perturbation I(ω+δω) (from which the numerical derivative of I(ω+δω) with respect to δω may be approximated), but is also useful in the calculation of radiances associated with a ‘finite’ perturbation I(ω+Δω) from which a sensitivity can be calculated.     

海洋可控源三维电磁响应显式灵敏度矩阵的快速算法

借助电场耦合势三维有限体积法与直接求解技术,研究建立了一套海洋可控源三维电磁响应显式灵敏度矩阵(或称为Fréchet导数)高效算法.首先,利用Yee氏交错网格和有限体积法对电场混合势Helmholtz方程进行离散处理,建立与移动源电磁场正演模拟相对应的大型代数方程组,再应用直接法得到的逆矩阵和三维线性插值技术事先确定插值算子和投影算子,并利用投影算子与各个发射源离散向量的乘积计算多发射源电磁响应,极大地提高了多发射源电磁场正演模拟效率.在此基础上,根据块状模型和像素模型中异常体电导率分片常数分布特征,将电导率摄动产生的一次散射电流场表示成Yee氏剖分网格上散射电流元的叠加,由投影算子与散射电流元的离散向量的乘积快速计算出电场强度与磁场强度的显式灵敏度矩阵.最后,通过数值计算检验算法的有效性,并通过块状模型与像素模型分别研究海洋可控源电磁响应特征.     

A spectral FC solver for the compressible Navier–Stokes equations in general domains I: Explicit time-stepping

We present a Fourier continuation (FC) algorithm for the solution of the fully nonlinear compressible Navier–Stokes equations in general spatial domains. The new scheme is based on the recently introduced accelerated FC method, which enables use of highly accurate Fourier expansions as the main building block of general-domain PDE solvers. Previous FC-based PDE solvers are restricted to linear scalar equations with constant coefficients. The FC methodology presented in this text thus constitutes a significant generalization of the previous FC schemes, as it yields general-domain FC solvers for nonlinear systems of PDEs. While not restricted to periodic boundary conditions and therefore applicable to general boundary value problems on arbitrary domains, the proposed algorithm inherits many of the highly desirable properties arising from rapidly convergent Fourier expansions, including high-order convergence, essentially spectrally accurate dispersion relations, and much milder CFL constraints than those imposed by polynomial-based spectral methods—since, for example, the spectral radius of the FC first derivative grows linearly with the number of spatial discretization points. We demonstrate the accuracy and optimal parallel efficiency of the algorithm in a variety of scientific and engineering contexts relevant to fluid-dynamics and nonlinear acoustics.     

基于求解Riemann问题的界面处理方法

通过在界面处构造Riemann问题,根据流体的法向速度和压力在界面(接触间断)处连续的特性,利用Riemann问题的解不仅定义了ghost流体的值,而且对真实流体中邻近界面的点值进行了更新,使得在界面处的流体的状态满足接触间断的性质,给出了更加精确的界面边界条件,守恒误差分析表明该方法在界面计算过程中引入较小的误差.数值试验表明该方法能准确地捕捉界面和激波的位置.     

Approximation of the inductionless MHD problem using a stabilized finite element method

In this work, we present a stabilized formulation to solve the inductionless magnetohydrodynamic (MHD) problem using the finite element (FE) method. The MHD problem couples the Navier–Stokes equations and a Darcy-type system for the electric potential via Lorentz’s force in the momentum equation of the Navier–Stokes equations and the currents generated by the moving fluid in Ohm’s law. The key feature of the FE formulation resides in the design of the stabilization terms, which serve several purposes. First, the formulation is suitable for convection dominated flows. Second, there is no need to use interpolation spaces constrained to a compatibility condition in both sub-problems and therefore, equal-order interpolation spaces can be used for all the unknowns. Finally, this formulation leads to a coupled linear system; this monolithic approach is effective, since the coupling can be dealt by effective preconditioning and iterative solvers that allows to deal with high Hartmann numbers.     

High-order compact schemes for incompressible flows: A simple and efficient method with quasi-spectral accuracy

In this paper, a finite difference code for Direct and Large Eddy Simulation (DNS/LES) of incompressible flows is presented. This code is an intermediate tool between fully spectral Navier–Stokes solvers (limited to academic geometry through Fourier or Chebyshev representation) and more versatile codes based on standard numerical schemes (typically only second-order accurate). The interest of high-order schemes is discussed in terms of implementation easiness, computational efficiency and accuracy improvement considered through simplified benchmark problems and practical calculations. The equivalence rules between operations in physical and spectral spaces are efficiently used to solve the Poisson equation introduced by the projection method. It is shown that for the pressure treatment, an accurate Fourier representation can be used for more flexible boundary conditions than periodicity or free-slip. Using the concept of the modified wave number, the incompressibility can be enforced up to the machine accuracy. The benefit offered by this alternative method is found to be very satisfactory, even when a formal second-order error is introduced locally by boundary conditions that are neither periodic nor symmetric. The usefulness of high-order schemes combined with an immersed boundary method (IBM) is also demonstrated despite the second-order accuracy introduced by this wall modelling strategy. In particular, the interest of a partially staggered mesh is exhibited in this specific context. Three-dimensional calculations of transitional and turbulent channel flows emphasize the ability of present high-order schemes to reduce the computational cost for a given accuracy. The main conclusion of this paper is that finite difference schemes with quasi-spectral accuracy can be very efficient for DNS/LES of incompressible flows, while allowing flexibility for the boundary conditions and easiness in the code development. Therefore, this compromise fits particularly well for very high-resolution simulations of turbulent flows with relatively complex geometries without requiring heavy numerical developments.     

A Correction Function Method for Poisson problems with interface jump conditions

In this paper we present a method to treat interface jump conditions for constant coefficients Poisson problems that allows the use of standard “black box” solvers, without compromising accuracy. The basic idea of the new approach is similar to the Ghost Fluid Method (GFM). The GFM relies on corrections applied on nodes located across the interface for discretization stencils that straddle the interface. If the corrections are solution-independent, they can be moved to the right-hand-side (RHS) of the equations, producing a problem with the same linear system as if there were no jumps, only with a different RHS. However, achieving high accuracy is very hard (if not impossible) with the “standard” approaches used to compute the GFM correction terms.     

Three-dimensional elliptic solvers for interface problems and applications

Second-order accurate elliptic solvers using Cartesian grids are presented for three-dimensional interface problems in which the coefficients, the source term, the solution and its normal flux may be discontinuous across an interface. One of our methods is designed for general interface problems with variable but discontinuous coefficient. The scheme preserves the discrete maximum principle using constrained optimization techniques. An algebraic multigrid solver is applied to solve the discrete system. The second method is designed for interface problems with piecewise constant coefficient. The method is based on the fast immersed interface method and a fast 3D Poisson solver. The second method has been modified to solve Helmholtz/Poisson equations on irregular domains. An application of our method to an inverse interface problem of shape identification is also presented. In this application, the level set method is applied to find the unknown surface iteratively.