三维感应测井响应计算的交错网格有限差分法

应用交错网格有限差分法计算三维复杂环境中的感应测井响应. 其中，利用Krylov子空间不变性求解离散得到的大型稀疏复对称线性方程组. 在构造Krylov子空间时使用其系数矩阵的伪逆以改善迭代的收敛性. 迭代中，使用不完全Cholesky分解共轭梯度法求解4个三维Poisson方程以得到新的Lanczos向量. 通常迭代不超过20次可得到理想结果. 另外，提出一种新的物质平均公式以计算电导率平均值，可保证电流守恒.     

积分法三维电阻率成像

二维或是三维电阻率反演成像研究,最关键的环节是在反演系数矩阵即敏感矩阵(或雅可比矩阵)的求取上.本文从微分方程的积分解出发,推导了表达式极为简单的三维雅可比系数矩阵,构造了成像方程.根据反演方程系数的稀疏特征,采用改进的降维高斯赛德尔迭代法来求解该反演方程,并通过内外迭代的结合,对大型稀疏欠定方程能很快收敛,得到可靠的解答.合成数据模型结果及实际资料的成像结果表明积分法不但实现起来极容易,成像结果的精度也相当高.     

Linearized seismic waveform inversion using a multiple re-weighted least-squares method with QR preconditioning

Linearized inversion methods such as Gauss‐Newton and multiple re‐weighted least‐squares are iterative processes in which an update in the current model is computed as a function of data misfit and the gradient of data with respect to model parameters. The main advantage of those methods is their ability to refine the model parameters although they have a high computational cost for seismic inversion. In the Gauss‐Newton method a system of equations, corresponding to the sensitivity matrix, is solved in the least‐squares sense at each iteration, while in the multiple re‐weighted least‐squares method many systems are solved using the same sensitivity matrix. The sensitivity matrix arising from these methods is usually not sparse, thus limiting the use of standard preconditioners in the solution of the linearized systems. For reduction of the computational cost of the linearized inversion methods, we propose the use of preconditioners based on a partial orthogonalization of the columns of the sensitivity matrix. The new approach collapses a band of co‐diagonals of the normal equations matrix into the main diagonal, being equivalent to computing the least‐squares solution starting from a partial solution of the linear system. The preconditioning is driven by a bandwidth L which can be interpreted as the distance for which the correlation between model parameters is relevant. To illustrate the benefit of the proposed approach to the reduction of the computational cost of the inversion we apply the multiple re‐weighted least‐squares method to the 2D acoustic seismic waveform inversion problem. We verify the reduction in the number of iterations in the conjugate'gradient algorithm as the bandwidth of the preconditioners increases. This effect reduces the total computational cost of inversion as well.     

Robust representation of dry cells in single-layer MODFLOW models

Dewatered or "dry" grid cells in the USGS ground water modeling software MODFLOW may cause nonphysical artifacts, trigger convergence failures, or interfere with parameter estimation. These difficulties can be avoided in two dimensions by modifying the spatial differencing scheme and the iterative procedure used to resolve nonlinearities. Specifically, the spatial differencing scheme is modified to use the water level on the upstream side of a pair of adjacent cells to calculate the saturated thickness and hence intercell conductance for the pair. This makes it possible to explicitly constrain the water level in a cell to be at or above the cell bottom elevation without introducing nonphysical artifacts. Thus constrained, all initially active cells will remain active throughout the simulation. It was necessary to replace MODFLOW's Picard iteration method with the Newton-Raphson method to achieve convergence in demanding applications involving many dry cells. Tests using a MODFLOW variant based on the new method produced results nearly identical to conventional MODFLOW in situations where conventional MODFLOW converges. The new method is extremely robust and converged in scenarios where conventional MODFLOW failed to converge, such as when almost all cells dewatered. An example application to the Edwards Aquifer in south-central Texas further demonstrates the utility of the new method.     

Accelerating the T‐matrix approach to seismic full‐waveform inversion by domain decomposition

A seismic variant of the distorted Born iterative inversion method, which is commonly used in electromagnetic and acoustic (medical) imaging, has been recently developed on the basis of the T‐matrix approach of multiple scattering theory. The distorted Born iterative method is consistent with the Gauss–Newton method, but its implementation is different, and there are potentially significant computational advantages of using the T‐matrix approach in this context. It has been shown that the computational cost associated with the updating of the background medium Green functions after each iteration can be reduced via the use of various linearisation or quasi‐linearisation techniques. However, these techniques for reducing the computational cost may not work well in the presence of strong contrasts. To deal with this, we have now developed a domain decomposition method, which allows one to decompose the seismic velocity model into an arbitrary number of heterogeneous domains that can be treated separately and in parallel. The new domain decomposition method is based on the concept of a scattering‐path matrix, which is well known in solid‐state physics. If the seismic model consists of different domains that are well separated (e.g., different reservoirs within a sedimentary basin), then the scattering‐path matrix formulation can be used to derive approximations that are sufficiently accurate but far more speedy and much less memory demanding because they ignore the interaction between different domains. However, we show here that one can also use the scattering‐path matrix formulation to calculate the overall T‐matrix for a large model exactly without any approximations at a computational cost that is significantly smaller than the cost associated with an exact formal matrix inversion solution. This is because we have derived exact analytical results for the special case of two interacting domains and combined them with Strassen's formulas for fast recursive matrix inversion. To illustrate the fact that we have accelerated the T‐matrix approach to full‐waveform inversion by domain decomposition, we perform a series of numerical experiments based on synthetic data associated with a complex salt model and a simpler two‐dimensional model that can be naturally decomposed into separate upper and lower domains. If the domain decomposition method is combined with an additional layer of multi‐scale regularisation (based on spatial smoothing of the sensitivity matrix and the data residual vector along the receiver line) beyond standard sequential frequency inversion, then one apparently can also obtain stable inversion results in the absence of ultra‐low frequencies and reduced computation times.     

An iterative algorithm for magnetic induction modulus inversion

An iterative algorithm is proposed for magnetic induction modulus inversion. The iterative process is based on a recurrence relation for the squared induction modulus, which can be represented at each iteration step by a system of linear algebraic equations for components of the magnetization vector. Formulas for the calculation of matrix elements of this system and the determination of the magnetization at the next iteration step are given. Model and practical examples illustrating the reconstruction of magnetization and anomalous field components are presented.     

预条件共轭梯度法在地震数据重建方法中的应用

基于最小平方的Fourier地震数据重建方法最终转化为求解一个线性方程组, 其系数矩阵是Toeplitz矩阵,可以用共轭梯度法求解该线性方程组.共轭梯度法的迭代次数受系数矩阵病态程度的影响,地震数据的非规则采样程度越高,所形成的系数矩阵病态程度越高,就越难收敛和得到合理的计算结果.本文研究了基于Toeplitz矩阵的不同预条件的构造方法,以及对共轭梯度法收敛性的影响.通过预条件的使用,加快了共轭梯度法的迭代速度, 改进了共轭梯度算法的收敛性,提高了计算的效率.数值算例和实际地震数据重建试验证明了预条件共轭梯度法对计算效率有很大的提高.     

位场向下延拓的波数域迭代法及其收敛性

提出了位场向下延拓的波数域迭代法. 对水平面上的位场观测值进行Fourier变换,得到其波谱. 根据第一类Fredholm积分方程的空间域迭代解法,推导出计算向下延拓水平面上位场波谱的波数域迭代公式. 在波数域中进行迭代,一直进行到相继两次迭代近似解的差值最大绝对值小于给定的精度,或迭代达到给定的最大迭代次数. 对这种迭代近似解进行Fourier逆变换,得到向下延拓的位场. 数值计算结果表明：与空间域迭代法比较,这种波数域迭代法简单、快速,并有同样好的向下延拓效果. 本文还证明了这种迭代法是收敛的,并给出了它的收敛特性和滤波特性.     

One Solution of the Forward Problem of DC Resistivity Well Logging by the Method of Volume Integral Equations with Allowance for Induced Polarization

For theoretically studying the intensity of the influence exerted by the polarization of the rocks on the results of direct current (DC) well logging, a solution is suggested for the direct inner problem of the DC electric logging in the polarizable model of plane-layered medium containing a heterogeneity by the example of the three-layer model of the hosting medium. Initially, the solution is presented in the form of a traditional vector volume-integral equation of the second kind (IE2) for the electric current density vector. The vector IE2 is solved by the modified iteration–dissipation method. By the transformations, the initial IE2 is reduced to the equation with the contraction integral operator for an axisymmetric model of electrical well-logging of the three-layer polarizable medium intersected by an infinitely long circular cylinder. The latter simulates the borehole with a zone of penetration where the sought vector consists of the radial J_r and J_z axial (relative to the cylinder’s axis) components. The decomposition of the obtained vector IE2 into scalar components and the discretization in the coordinates r and z lead to a heterogeneous system of linear algebraic equations with a block matrix of the coefficients representing 2x2 matrices whose elements are the triple integrals of the mixed derivatives of the second-order Green’s function with respect to the parameters r, z, r', and z'. With the use of the analytical transformations and standard integrals, the integrals over the areas of the partition cells and azimuthal coordinate are reduced to single integrals (with respect to the variable t = cos ? on the interval [?1, 1]) calculated by the Gauss method for numerical integration. For estimating the effective coefficient of polarization of the complex medium, it is suggested to use the Siegel–Komarov formula.     

Preconditioned non‐linear conjugate gradient method for frequency domain full‐waveform seismic inversion

We present preconditioned non‐linear conjugate gradient algorithms as alternatives to the Gauss‐Newton method for frequency domain full‐waveform seismic inversion. We designed two preconditioning operators. For the first preconditioner, we introduce the inverse of an approximate sparse Hessian matrix. The approximate Hessian matrix, which is highly sparse, is constructed by judiciously truncating the Gauss‐Newton Hessian matrix based on examining the auto‐correlation and cross‐correlation of the Jacobian matrix. As the second preconditioner, we employ the approximation of the inverse of the Gauss‐Newton Hessian matrix. This preconditioner is constructed by terminating the iteration process of the conjugate gradient least‐squares method, which is used for inverting the Hessian matrix before it converges. In our preconditioned non‐linear conjugate gradient algorithms, the step‐length along the search direction, which is a crucial factor for the convergence, is carefully chosen to maximize the reduction of the cost function after each iteration. The numerical simulation results show that by including a very limited number of non‐zero elements in the approximate Hessian, the first preconditioned non‐linear conjugate gradient algorithm is able to yield comparable inversion results to the Gauss‐Newton method while maintaining the efficiency of the un‐preconditioned non‐linear conjugate gradient method. The only extra cost is the computation of the inverse of the approximate sparse Hessian matrix, which is less expensive than the computation of a forward simulation of one source at one frequency of operation. The second preconditioned non‐linear conjugate gradient algorithm also significantly saves the computational expense in comparison with the Gauss‐Newton method while maintaining the Gauss‐Newton reconstruction quality. However, this second preconditioned non‐linear conjugate gradient algorithm is more expensive than the first one.     

曲线箱梁桥地震反应的频域精细传递矩阵法

本文将高精度的精细积分法和力学概念清晰的传递矩阵法结合起来,以微分方程和矩阵分析理论为基础,提出了一种新的精细传递矩阵形式,在频域内对曲线箱梁桥地震反应进行分析. 与传统的传递矩阵法相比,无需对微分方程进行求解,只需按照迭代公式进行计算,就可以得到所需要的传递矩阵.这种方法公式简单,理论上可实现任意精度要求,而且计算效率较高.能够快速、高精度地进行曲线梁桥的地震反应分析.算例显示了精细传递矩阵法的有效性..     

结构地震反应的频域精细传递矩阵法

传统的传递矩阵法需要对控制微分方程进行求解,获得相应的传递矩阵。公式繁琐、复杂。文中提出将传递矩阵法与精细积分法中的指数矩阵运算技巧结合起来,在频域内对结构进行动力分析。与传统的传递矩阵法相比,无需对微分方程进行求解,只需按照迭代公式进行计算,就可以得到所需要的传递矩阵。这种方法公式简单,理论上可实现任意精度,而且计算效率较高,能够快速、高精度的进行结构的地震反应分析。算例显示了精细传递矩阵法的有效性。     

Parallel iterative solution for h and p approximations of the shallow water equations

A p finite element scheme and parallel iterative solver are introduced for a modified form of the shallow water equations. The governing equations are the three-dimensional shallow water equations. After a harmonic decomposition in time and rearrangement, the resulting equations are a complex Helmholz problem for surface elevation, and a complex momentum equation for the horizontal velocity. Both equations are nonlinear and the resulting system is solved using the Picard iteration combined with a preconditioned biconjugate gradient (PBCG) method for the linearized subproblems. A subdomain-based parallel preconditioner is developed which uses incomplete LU factorization with thresholding (ILUT) methods within subdomains, overlapping ILUT factorizations for subdomain boundaries and under-relaxed iteration for the resulting block system. The method builds on techniques successfully applied to linear elements by introducing ordering and condensation techniques to handle uniform p refinement. The combined methods show good performance for a range of p (element order), h (element size), and N (number of processors). Performance and scalability results are presented for a field scale problem where up to 512 processors are used.     

Increasing numerical efficiency of iterative solution for total least-squares in datum transformations

Cartesian coordinate transformation between two erroneous coordinate systems is considered within the Errors-In-Variables (EIV) model. The adjustment of this model is usually called the total Least-Squares (LS). There are many iterative algorithms given in geodetic literature for this adjustment. They give equivalent results for the same example and for the same user-defined convergence error tolerance. However, their convergence speed and stability are affected adversely if the coefficient matrix of the normal equations in the iterative solution is ill-conditioned. The well-known numerical techniques, such as regularization, shifting-scaling of the variables in the model, etc., for fixing this problem are not applied easily to the complicated equations of these algorithms. The EIV model for coordinate transformations can be considered as the nonlinear Gauss-Helmert (GH) model. The (weighted) standard LS adjustment of the iteratively linearized GH model yields the (weighted) total LS solution. It is uncomplicated to use the above-mentioned numerical techniques in this LS adjustment procedure. In this contribution, it is shown how properly diminished coordinate systems can be used in the iterative solution of this adjustment. Although its equations are mainly studied herein for 3D similarity transformation with differential rotations, they can be derived for other kinds of coordinate transformations as shown in the study. The convergence properties of the algorithms established based on the LS adjustment of the GH model are studied considering numerical examples. These examples show that using the diminished coordinates for both systems increases the numerical efficiency of the iterative solution for total LS in geodetic datum transformation: the corresponding algorithm working with the diminished coordinates converges much faster with an error of at least 10^-5 times smaller than the one working with the original coordinates.     

Dynamic analysis of structures using lanczos co-ordinates

A procedure for deriving the Lanczos vectors is explained and their use in structural dynamics analysis as an alternative to modal co-ordinates is discussed. The vectors are obtained by an inverse iteration procedure in which orthogonality is imposed between the vectors resulting from successive iteration cycles. Using these Lanczos vectors the equations of motion are transformed to tridiagonal form, which provides for a very efficient time-stepping solution. The effectiveness of the method is demonstrated by a numerical example.     

On regularized time varying gravity field models based on grace data and their comparison with hydrological models

Determination of spherical harmonic coefficients of the Earth’s gravity field is often an ill-posed problem and leads to solving an ill-conditioned system of equations. Inversion of such a system is critical, as small errors of data will yield large variations in the result. Regularization is a method to solve such an unstable system of equations. In this study, direct methods of Tikhonov, truncated and damped singular value decomposition and iterative methods of ν, algebraic reconstruction technique, range restricted generalized minimum residual and conjugate gradient are used to solve the normal equations constructed based on range rate data of the gravity field and climate experiment (GRACE) for specific periods. Numerical studies show that the Tikhonov regularization and damped singular value decomposition methods for which the regularization parameter is estimated using quasioptimal criterion deliver the smoothest solutions. Each regularized solution is compared to the global land data assimilation system (GLDAS) hydrological model. The Tikhonov regularization with L-curve delivers a solution with high correlation with this model and a relatively small standard deviation over oceans. Among iterative methods, conjugate gradient is the most suited one for the same reasons and it has the shortest computation time.     

三维三分量CSAMT法有限元正演模拟研究初探

首先从麦克斯韦方程出发,用伽里金方法推导了三维三分量CSAMT法的有限元方程.在研究过程中,认识到加入散度条件的必要性,在公式中强加了散度条件,提高了解的完备性.其次将成功应用于二维线源频率域电磁法有限元模拟中的两种技术推广到三维中,一是边界条件统一采用一阶吸收边界,使线源产生的电磁波在边界上按波的传播规律被吸收,以降低平面波假设造成的影响;二是总体系数矩阵的存储,用两个二维数组分别记录总体系数矩阵的非零元素及其在总体结点编号中所处的位置,使总体系数矩阵的存储量达到最小的同时,物理意义明确,迭代求解时迅速简便.最后用均匀半空间模型进行了验证.     

An implicit wave equation model for the shallow water equations

An implicit solution procedure for the wave equation form of the shallow water equations is presented. Efficiency is achieved through a Taylor expansion procedure applied to a time-varying matrix. This procedure allows matrix decompositions to be replaced by back substitutions. Isoparametric quadratic Lagrangian finite elements are employed for the spatial discretization. The Taylor expansion method is compared to different implicit and explicit solution procedures in an application to the southern part of the North Sea.     

无矩阵迭代法在膜结构风振耦合分析中的应用

提出在采用浸入物体法（IOM）对膜结构和空气流体建模时,可以采用带有预定条件的无矩阵Newton-Krylov迭代算法求解浸入物体法,并引入了预定条件矩阵。将提出的无矩阵迭代方法应用于一双坡型膜结构的风振耦合分析中,得出了结构的风压和风速分布,并对带有预定条件和不带预定条件的无矩阵迭代算法进行了对比。结果表明,将带有预定条件的无矩阵迭代算法应用于膜结构风振的耦合分析中,可以得到准确结果,并使计算效率大大提高。     

Iterative implicit integration procedure for hybrid simulation of large nonlinear structures

A fully implicit iterative integration procedure is presented for local and geographically distributed hybrid simulation of the seismic response of complex structural systems with distributed nonlinear behavior. The purpose of this procedure is to seamlessly incorporate experimental elements in simulations using existing fully implicit integration algorithms designed for pure numerical simulations. The difficulties of implementing implicit integrators in a hybrid simulation are addressed at the element level by introducing a safe iteration strategy and using an efficient procedure for online estimation of the experimental tangent stiffness matrix. In order to avoid physical application of iterative displacements, the required experimental restoring force at each iteration is estimated from polynomial curve fitting of recent experimental measurements. The experimental tangent stiffness matrix is estimated by using readily available experimental measurements and by a classical diagonalization approach that reduces the number of unknowns in the matrix. Numerical and hybrid simulations are used to demonstrate that the proposed procedure provides an efficient method for implementation of fully implicit numerical integration in hybrid simulations of complex nonlinear structures. The hybrid simulations presented include distributed nonlinear behavior in both the numerical and experimental substructures. Copyright © 2010 John Wiley & Sons, Ltd.