动力反应分析的显式积分方法及其稳定性

Newm ark-更新精细积分法是动力方程求解的隐式的时域逐步积分法,其稳定性条件非常容易满足。与隐式方法相比较,显式积分方法不需要求解耦联的方程组,可以有效地减少内存占用和机时耗费。因此,根据显式积分方法的特点和优点,基于Newm ark-更新精细积分法的基本思想,提出其显式积分格式。对显式积分方法的精度与稳定性进行了初步的分析,指出该显式积分方法具有极好的稳定性,其精度比隐式积分方法的精度稍低。随着时间步长的增加,其精度优于传统的方法。     

一种显隐式积分方法及其应用

在实际工程结构动力反应分析中,往往由于结构型式十分复杂,常用的两种直接积分方法,即显式积分方法和隐式积分方法,在使用中都存在着一定的局限性,如何将这两种积分方法合理有效地结合起来,是一个十分有意义的研究课题。针对实际工程问题中整体结构计算时间步长的选择往往受局部区域的材料特性、尺寸大小等因素影响的这一现象,提出了一种对结构局部区域进行隐式积分、对其余区域进行显式积分的显隐式积分方法,这种积分格式相对于显式积分格式而言,能显著提高整体结构的计算速度。最后采用两个数值计算实例对这一方法进行验证。     

逆冲断层应力场的数值模拟

采用二维显式有限差分法与三维隐式有限单元法,分别计算了模型剖面上断层逆冲运动和三维断层逆冲运动伴随的断层邻域应力场。结果表明：（１）逆冲断层上盘下端部发育张应力场,下盘下端部发育压应力场;（２）对复杂的三维构造,在一定限定条件下,可以转化成二维问题进行计算;（３）显式差分法与隐式有限单元,都能较好地用接触模型模拟活动断层的应力场特征     

A fully implicit model for simulating dynamo action in a Cartesian domain

We present a fully implicit numerical method to solve the incompressible MHD equations in a strongly rotating Cartesian domain. The equations are solved in a primitive variable formulation using a finite volume discretization. In order to use massively parallel computers, we applied a domain decomposition approach in space. The performance of this model is compared with an earlier model, which treated the convective terms of the equations in an explicit manner. Our results indicate that although the fully implicit method needs about three times the memory of the implicit–explicit method, it is superior in terms of computational efficiency. As an application of this model, we investigated the influence of the Prandtl number in the range of 0.01–1000 on the dynamics of the dynamo.     

The ρ-family of algorithms for time-step integration with improved numerical dissipation

The dynamic analysis of complex non-linear structural systems by the finite element approach requires the use of time-step algorithms for solving the equations of motion in the time domain. Both an implicit and an explicit version of such a time-step algorithm, called the ρ-method, the parameter ρ being used for controlling numerical damping in the higher modes, are presented in this paper. For the implicit family of algorithms unconditional stability, consistency, convergence, accuracy and overshoot properties are first discussed and proved. On the basis of the algorithmic damping ratio (dissipation) and period elongation (dispersion) the ρ-method is then compared with the well-known implicit algorithms of Hilber, Newmark, Wilson, Park and Houbolt. An explicit version of the algorithm is also derived and briefly discussed. This shows numerical properties similar to the central difference method. Both versions of the algorithm have been implemented in a general purpose computer program which has been often used for both numerical tests and practical applications.     

Discussion of “development of a family of unconditionally stable explicit direct integration algorithms with controllable numerical energy dissipation” by Chinmoy Kolay and James M. Ricles

The time integration method proposed by Kolay and Ricles, which was claimed to be both explicit and unconditionally stable, is shown to be implicit in the sense of requiring the factorization of an effective stiffness matrix where an explicit method needs no solver. Its original derivation procedure employed discrete control theory concepts, which are in fact, equivalent to conventional recurrence relation concepts aiming to match its spectral properties with those of the three-parameter optimal/generalized-α method, thus giving rise to an implicit method within the class of linear multistep methods. It is shown that the resulting method possesses several added computational drawbacks due to its derivation procedure, such as additional effective stiffness inversions and a degraded order of accuracy in general.     

Operator‐splitting method for real‐time substructure testing

It has been shown that the operator‐splitting method (OSM) provides explicit and unconditionally stable solutions for quasi‐static pseudo‐dynamic substructure testing. However, the OSM provides only an explicit target displacement but not an explicit target velocity, so that it is essentially an implicit method for real‐time substructure testing (RST) when the velocity‐dependent restoring force is considered. This paper proposes a target velocity formulation based on the forward difference of the predicted displacements so as to render the OSM explicit for RST. The stability and accuracy of the resulting OSM‐RST algorithm are investigated. It is shown that the OSM‐RST is unconditionally stable so long as the non‐linear stiffness and damping are of the softening type (i.e. the tangent stiffness and damping never exceed the initial values). The stability of the OSM‐RST for structures with infinite tangent damping coefficient or stiffness is also proved, and the stability of the method for MDOF structures with a non‐classical damping matrix is demonstrated by an energy criterion. The effects of actuator delay and compensation are analysed based on the bilinear approximation of the actuator step response. Experiments on damped SDOF and MDOF structures verify that the stability of the OSM‐RST is preserved when the experimental substructure generates velocity‐dependent reaction forces, whereas the stability of real‐time substructure tests based on the central difference method is worsened by the damping of the specimen. Copyright © 2005 John Wiley & Sons, Ltd.     

Evaluation of numerical time‐integration schemes for real‐time hybrid testing

We present a comparison of methods for the analysis of the numerical substructure in a real‐time hybrid test. A multi‐tasking strategy is described, which satisfies the various control and numerical requirements. Within this strategy a variety of explicit and implicit time‐integration algorithms have been evaluated. Fully implicit schemes can be used in fast hybrid testing via a digital sub‐step feedback technique, but it is shown that this approach requires a large amount of computation at each sub‐step, making real‐time execution difficult for all but the simplest models. In cases where the numerical substructure poses no harsh stability condition, it is shown that the Newmark explicit method offers advantages of speed and accuracy. Where the stability limit of an explicit method cannot be met, one of the several alternatives may be used, such as Chang's modified Newmark scheme or the α‐operator splitting method. Appropriate methods of actuator delay compensation are also discussed. Copyright © 2008 John Wiley & Sons, Ltd.     

The three-dimensional dynamic displacement discontinuity method: Theory and applications

A boundary element technique has been developed for solving three-dimensional elastodynamic problems in rock mechanics, such as joint slip and the sudden advance of excavations. Both implicit and explicit versions of the technique have been implemented. Comparisons of accuracy and computational efficiency are made for a simple verification problem. Examples in which the technique has been used to investigate the dynamic response of supported and unsupported excavations in tabular orebodies are presented.     

Estimating the uncertainty of video-based flow velocity and discharge measurements due to the conversion of field to image coordinates

Video-based hydrometry continues to develop for contactless discharge measurements, automated flood gauging stations and the use of crowd-sourced flood videos for discharge reconstruction. Irrespective of the velocimetry algorithm used (LSPIV, STIV, PTV…), orthorectification of the images is necessary beforehand, so that each pixel has the same known physical size. Most times, the orthorectification transformation is a plane-to-plane projection from the water surface to the camera sensor. Two approaches are typically used to compute the coefficients of this transformation: their calibration from ground reference points (GRPs) with known image and real-world coordinates (“implicit calibration”) or their calculation from the values of the intrinsic (focal length, sensor size) and extrinsic (position, angles) parameters of the camera (“explicit calibration”). In this paper, we develop a Bayesian method which makes it possible to combine the implicit and explicit approaches in a probabilistic framework. The Bayesian approach can be used from situations suitable for the implicit approach (plenty of GRPs) to situations propitious to the explicit approach (well-known camera parameters). The method is illustrated using synthetic views of a typical streamgauging scene with known true values of the parameters and GRP coordinates. We show that combining observational and prior information is generally beneficial to get precise estimates. Further tests carried out with a real scene of the Arc River at Randens, France, in flood conditions illustrate the impact of the number, uncertainty and spatial distribution of GRPs on the final uncertainty of flow velocity and discharge.     

Calculating actual crop evapotranspiration under soil water stress conditions with appropriate numerical methods and time step

Calculation of actual crop evapotranspiration under soil water stress conditions is crucial for hydrological modeling and irrigation water management. Results of actual evapotranspiration depend on the estimation of water stress coefficient from soil water storage in the root zone, which varies with numerical methods and time step used. During soil water depletion periods without irrigation or precipitation, the actual crop evapotranspiration can be calculated by an analytical method and various numerical methods. We compared the results from several commonly used numerical methods, including the explicit, implicit and modified Euler methods, the midpoint method, and the Heun's third‐order method, with results of the analytical method as the bench mark. Results indicate that relative errors of actual crop evapotranspiration calculated with numerical methods in one time step are independent of the initial soil water storage in the range of soil water stress. Absolute values of relative error decrease with the order of numerical methods. They also decrease with the number of time step, which can ensure the numerical stability of successive simulation of soil water balance. Considering the calculation complexity and calculation errors caused by numerical approximation for different time step and maximum crop evapotranspiration, the explicit Euler method is recommended for the time step of 1 day (d) or 2 d for maximum crop evapotranspiration less than 5 mm/d, the midpoint method or the modified Euler method for the time step of up to one week or 10 d for maximum crop evapotranspiration less than 5 mm/d, and the Heun's third‐order method for the time step of up to 15 d. Copyright © 2011 John Wiley & Sons, Ltd.     

A comparison of a semi-implicit with an explicit scheme in a three-dimensional hydrodynamic model

As the capacity of computers increases, the size and resolution of numerical models can be increased. In tidal models, however, using an explicit scheme together with high spatial resolution results in an unreasonably small time-step demanded by the CFL condition for stability. This condition is usually the most restrictive and applies to the propagation of the gravity wave.A fully nonlinear three-dimensional model has been developed, using the Galerkin method in the vertical dimension, in which the gravity wave terms are treated by an alternating-direction implicit scheme, while the friction, viscous and advective terms are treated explicitly. This permits a stable solution with a longer time-step than that required in an equivalent explicit scheme, while not needing as much computational effort as a fully implicit scheme. This semi-implicit model is compared with an explicit model in terms of efficiency, accuracy, and stability. Tidal and wind-driven flows and free oscillations in a rectangular sea model are examined, using various boundary conditions. The semi-implicit scheme takes approximately 1.1 times as long to run (per time-step) on the CRAY-1 computer as the explicit scheme.     

An application of Karmarkar's interior-point linear programming algorithm for multi-reservoir operations optimization

Optimization of multi-reservoir systems operations is typically a very large scale optimization problem. The following are the three types of optimization problems solved using linear programming (LP): (i) deterministic optimization for multiple periods involving fine stage intervals, for example, from an hour to a week (ii) implicit stochastic optimization using multiple years of inflow data, and (iii) explicit stochastic optimization using probability distributions of inflow data. Until recently, the revised simplex method has been the most efficient solution method available for solving large scale LP problems. In this paper, we show that an implementation of the Karmarkar's interior-point LP algorithm with a newly developed stopping criterion solves optimization problems of large multi-reservoir operations more efficiently than the simplex method. For example, using a Micro VAX II minicomputer, a 40 year, monthly stage, two-reservoir system optimization problem is solved 7.8 times faster than the advanced simplex code in MINOS 5.0. The advantage of this method is expected to be greater as the size of the problem grows from two reservoirs to multiples of reservoirs. This paper presents the details of the implementation and testing and in addition, some other features of the Karmarkar's algorithm which makes it a valuable optimization tool are illuminated.     

An application of Karmarkar's interior-point linear programming algorithm for multi-reservoir operations optimization

Optimization of multi-reservoir systems operations is typically a very large scale optimization problem. The following are the three types of optimization problems solved using linear programming (LP): (i) deterministic optimization for multiple periods involving fine stage intervals, for example, from an hour to a week (ii) implicit stochastic optimization using multiple years of inflow data, and (iii) explicit stochastic optimization using probability distributions of inflow data. Until recently, the revised simplex method has been the most efficient solution method available for solving large scale LP problems. In this paper, we show that an implementation of the Karmarkar's interior-point LP algorithm with a newly developed stopping criterion solves optimization problems of large multi-reservoir operations more efficiently than the simplex method. For example, using a Micro VAX II minicomputer, a 40 year, monthly stage, two-reservoir system optimization problem is solved 7.8 times faster than the advanced simplex code in MINOS 5.0. The advantage of this method is expected to be greater as the size of the problem grows from two reservoirs to multiples of reservoirs. This paper presents the details of the implementation and testing and in addition, some other features of the Karmarkar's algorithm which makes it a valuable optimization tool are illuminated.     

三维时间域航空电磁有理Krylov正演研究

常规的三维时间域航空电磁模拟通常采用隐式步长方法进行时间离散,需要几次矩阵分解和上百次右端源项回带,计算效率较低.为了提高正演计算效率,本文提出使用有理Krylov方法求解时间域电场扩散方程.首先使用非结构四面体网格进行空间离散,采用Nédélec矢量基函数近似四面体单元内的电场;然后基于有限元离散给出矩阵指数和矢量乘积表示的电场显式解;最后采用有理Arnoldi算法构造Krylov子空间内的正交基函数并进一步求解矩阵指数与矢量的乘积,直接得到任意时刻的电场解向量,避免步长离散过程.此外,本文还提出一种指数加权偏移参数优化方法,使得有理Arnoldi近似在瞬变衰减晚期具备更高的精度,从而降低Krylov子空间阶数并提高计算效率.通过和层状模型解析解的对比验证了有理Krylov方法的精度.针对三维异常体模型使用全局网格和局部网格剖分并和其他数值方法比较,进一步说明了有理Krylov方法的有效性.     

基于螺旋线上谱因式分解的地震波场隐式辛算法

均匀介质、复杂各向同性介质和各向异性介质中的地震波传播过程,可用统一形式的标量声波方程描述.考虑到在无损耗条件下,地震波方程描述了地震波场这一个无穷维的哈密顿体系随时间的演化过程,该过程为一个单参数连续辛变换,因而可以在其哈密顿形式表述下导出其辛格式.与显式辛算法相比,隐式辛格式对应的隐式辛几何算法具有无条件稳定的特点,可以允许较大的计算步长.但是由于隐式算法不可避免地面临高阶矩阵的求逆,其每一步的计算速度较慢.为实现矩阵快速求逆,文中采用了螺旋边界条件下谱因式分解的方法.在螺旋边界条件下,需要求逆的矩阵化为带状矩阵,而且其各列非零元素的位置和大小具有非常好的相似性,因而可以采用谱因式分解的方法实现快速LU分解.文中采用二阶精度的隐式蛙跳辛格式和谱因式分解方法,计算了常速度、层状介质和Marmousi模型中的波场.计算表明,隐式辛算法不失为波场计算的一种好方法.     

An improved implicit-explicit time integration method for structural dynamics

An explicit predictor-corrector algorithm is derived from the implicit α-method. This explicit algorithm is shown to have better stability and accuracy properties than its Newmark-based predecessor. This algorithm is then combined with the implicit α-method, resulting in an implicit-explicit α-method which can be effectively utilized for linear and non-linear structural dynamics calculations.     

基于条分模式的边坡可靠度近似计算方法

通过对边坡稳定分析方法中的条分理论和响应面法的研究,针对边坡可靠性计算往往没有明确的解析表达式,以及稳定性系数计算方法和响应面法（RSM）的特点,将响应面法中的有限元数值模拟以条分模式中的稳定性系数隐式方程的迭代计算方法代替,建立了条分模式下的边坡可靠性计算的极限状态方程,从而形成了一种新的边坡稳定可靠性响应面分析方法。本文提出的改进的响应面法原理简单,计算效率较高并具有一定的精度,适用于对边坡可靠度的近似计算。     

Digital computer solutions of groundwater flow

This paper examines critically the use of the alternating direction implicit method for solving groundwater flow problems. Comparisons with alternative solutions show that inaccuracies can arise if the time increments are too large. A method is suggested whereby the computer chooses an optimum time increment. The representation of recharge, infiltration and wells is considered and a detailed example compares the alternating direction implicit, the explicit and the resistance-capacitance network methods.     

地震波传播的哈密顿表述及辛几何算法

地震波传播过程本质上是能量在传播过程中逐步损耗直至殆尽的过程，而在实际应用中，常在无能量损耗假设下，用弹性波动方程或标量波动方程描述它.在哈密顿(Hamilton)体系表述下，地震波传播过程即为一个无限维的哈密顿系统随时间的演化过程.若不计能量损耗，波场演化过程实质上为一个单参数连续的辛变换，因而对应的数值算法应为辛几何算法.本文首先从地震波标量方程出发，给出哈密顿体系下地震波传播的表述，即任意两个时刻的波场是通过辛变换联系起来的.随后，把波场在时间和相空间离散化后，给出了用于波场计算的一些辛格式，如显式辛格式、隐式辛格式和蛙跳辛格式.并进一步讨论了有限差分格式和辛格式的异同.然后，应用显式辛格式和同阶的有限差分方法给出了同一理论速度模型下的波场和Marmousi速度模型下的单炮记录.数值结果表明，辛算法是一类可行的波场模拟的数值算法.在时间步长较小时，有限差分方法是辛算法的一个很好近似.文中的理论和方法，为地震波传播理论及实际应用研究提供了新的途径.