Boundary element method with exterior collocation in two-dimensional elastodynamic problems

In the present paper, the boundary element method with exterior collocation was applied to two-dimensional elastodynamic problems. The stability of the numerical solution was discussed and the collocation rule of source points outside the region being studied was investigated in the frequency domain by means of the computed error in the boundary displacement and the condition number of the coefficient matrix for two typical wave propagation problems. The achieved results are helpful to the practical application of this method to earthquake ground motion analysis.     

1D and 2D Cole-Cole-inversion of time-domain induced-polarization data

A new method for the 2D inversion of induced polarization (IP) data in the time domain has been developed. The entire IP transients were observed and inverted into 2D Cole-Cole earth models, including resistivity, chargeability, relaxation time and the frequency constant. Firstly, a modified 1D time-domain electromagnetic algorithm was used to calculate the response of a layered polarizable ground. The transient signals were then inverted using the Marquardt method to derive the Cole-Cole parameters of each layer. However, model calculations showed that the EM effects could be neglected for the time range (>1 ms) and for the transmitter–receiver distances (<50 m) used in this study. Therefore, the induction effects were not considered for the solution of the 2D inverse problem and a DC solution was applied. An approximative forward algorithm was introduced in order to calculate the IP transients directly in the time domain and in order to speed up the inverse procedure. The approximation is highly accurate, and this is demonstrated by comparing the approximations with their exact solutions up to 3D. The inverse algorithm presented consists of two steps. The transient voltages of an array data set were inverted separately into a two-dimensional resistivity model for each time channel. The time-dependent resistivity of each cell was then interpreted as the response of a homogeneous half-space. In the 2D inversion algorithm, a 3D DC algorithm was used as a forward operator. The method only requires a standard 2D DC inversion and a homogenous half-space Cole-Cole inversion. The developed algorithm has been successfully applied to synthetic data sets and to a field data set obtained from a waste site situated close to Düren in Germany.     

地震静校正全局最优化问题的求解

针对地震静校正存在的非线性和多参数性等问题，本文提出了一种全局优化的剩余静校正方法.在模型更新规则上，把模拟退火方法和均匀优化设计方法结合在一起，使模型的更新更为合理，从而加快了搜寻全局最优解的速度.同时提出了模型的不同分量的温度参数和退火过程的选取方式，把温度参数的选取与地震剖面的能量联系起来，使温度参数的选取具有自适应的特点.该方法克服了常规模拟退火方法所具有的寻优空间不均匀以及退火参数需通过多次试验选取的缺陷.通过实际地震资料的计算证明，本文提出的方法对地震静校正问题合理而有效.     

Application of the patient rule induction method to detect hydrologic model behavioural parameters and quantify uncertainty

Finding an operational parameter vector is always challenging in the application of hydrologic models, with over‐parameterization and limited information from observations leading to uncertainty about the best parameter vectors. Thus, it is beneficial to find every possible behavioural parameter vector. This paper presents a new methodology, called the patient rule induction method for parameter estimation (PRIM‐PE), to define where the behavioural parameter vectors are located in the parameter space. The PRIM‐PE was used to discover all regions of the parameter space containing an acceptable model behaviour. This algorithm consists of an initial sampling procedure to generate a parameter sample that sufficiently represents the response surface with a uniform distribution within the “good‐enough” region (i.e., performance better than a predefined threshold) and a rule induction component (PRIM), which is then used to define regions in the parameter space in which the acceptable parameter vectors are located. To investigate its ability in different situations, the methodology is evaluated using four test problems. The PRIM‐PE sampling procedure was also compared against a Markov chain Monte Carlo sampler known as the differential evolution adaptive Metropolis (DREAM_ZS) algorithm. Finally, a spatially distributed hydrological model calibration problem with two settings (a three‐parameter calibration problem and a 23‐parameter calibration problem) was solved using the PRIM‐PE algorithm. The results show that the PRIM‐PE method captured the good‐enough region in the parameter space successfully using 8 and 107 boxes for the three‐parameter and 23‐parameter problems, respectively. This good‐enough region can be used in a global sensitivity analysis to provide a broad range of parameter vectors that produce acceptable model performance. Moreover, for a specific objective function and model structure, the size of the boxes can be used as a measure of equifinality.     

Development of a continuous soil moisture accounting procedure for curve number methodology and its behaviour with different evapotranspiration methods

The curve number (CN) method is widely used for rainfall–runoff modelling in continuous hydrologic simulation models. A sound continuous soil moisture accounting procedure is necessary for models using the CN method. For shallow soils and soils with low storage, the existing methods have limitations in their ability to reproduce the observed runoff. Therefore, a simple one‐parameter model based on the Soil Conservation Society CN procedure is developed for use in continuous hydrologic simulation. The sensitivity of the model parameter to runoff predictions was also analysed. In addition, the behaviour of the procedure developed and the existing continuous soil moisture accounting procedure used in hydrologic models, in combination with Penman–Monteith and Hargreaves evapotranspiration (ET) methods was also analysed. The new CN methodology, its behaviour and the sensitivity of the depletion coefficient (model parameter) were tested in four United States Geological Survey defined eight‐digit watersheds in different water resources regions of the USA using the SWAT model. In addition to easy parameterization for calibration, the one‐parameter model developed performed adequately in predicting runoff. When tested for shallow soils, the parameter is found to be very sensitive to surface runoff and subsurface flow and less sensitive to ET. Copyright © 2007 John Wiley & Sons, Ltd.     

Anti-plane （SH） waves diffraction by cavity： analytical an underground semi-circular solution

Diffraction of a two-dimensional (2D) semi-circular cavity in a half-space under incident SH-waves is studied using the classic wave function expansion method with a new de-coupling technique. This so-called “improved cosine halfrange expansion” algorithm exhibits an excellent performance in reducing displacement residual errors at two rim points of concern. The governing equations are developed in a manner that minimizes the residues of the boundary conditions. Detailed derivation and analysis procedures as well as truncation of infinite linear governing equations are presented. The semi-circular cavity model presented in this paper, due to its simple profile, is expected to be used in seismic wave propagation studies as a benchmark for examining the accuracies of various analytical or numerical methods for mixed-boundary wave propagation problems.     

Impedance functions for three-dimensional foundations supported on an infinitely-long canyon of uniform cross-section in a homogeneous half-space

A direct boundary element procedure is presented to determine the impedance matrix for a three-dimensional foundation supported on an infinitely-long canyon of uniform cross-section cut in a homogeneous half-space. The uniform cross-section of the canyon permits analytical integration along the canyon axis leading to a series of two-dimensional boundary problems involving Fourier transforms of the full-space Green's functions. Solution of these two-dimensional boundary problems leads to a dynamic flexibility influence matrix which is inverted to determine the impedance matrix. The accuracy of the procedure is demonstrated by comparison with previous solutions for a surface-supported, square foundation and results obtained by a three-dimensional boundary element method (BEM) for a foundation of finite-width supported on an infinitely-long canyon. Compared with the three-dimensional BEM, the present method requires less computer storage and is more accurate and efficient. The foundation impedance matrix determined by this procedure can be incorporated in a substructure method for earthquake analysis of arch dams.     

The Wilson–Burg method of spectral factorization with application to helical filtering

Spectral factorization is a computational procedure for constructing minimum-phase (stable inverse) filters required for recursive inverse filtering. We present a novel method of spectral factorization. The method iteratively constructs an approximation of the minimum-phase filter with the given autocorrelation by repeated forward and inverse filtering and rearranging of the terms. This procedure is especially efficient in the multidimensional case, where the inverse recursive filtering is enabled by the helix transform. To exemplify a practical application of the proposed method, we consider the problem of smooth two-dimensional data regularization. Splines in tension are smooth interpolation surfaces whose behaviour in unconstrained regions is controlled by the tension parameter. We show that such surfaces can be efficiently constructed with recursive filter preconditioning and we introduce a family of corresponding two-dimensional minimum-phase filters. The filters are created by spectral factorization on a helix.     

Incremental time—space finite strip method for non-linear structural vibrations

Based on an incremental Hamilton's principle a versatile and systematic computer method for analysing non-linear structural vibrations is developed in this paper. The essence of the proposed method can be regarded as an incremental harmonic balance method associated with a finite strip procedure in the time-space domain. Only linearized equations in terms of frequency increment, amplitude increments, etc. have to be formulated and solved in each incremental step. This method is applicable to highly non-linear problems and may be generalized to related non-linear periodic structural motions such as dynamic stability, flutter and some motions of a rotating body, etc. To show the effectiveness and versatility of this method, a typical time-space finite strip for beam problems is worked out and examples for a wide variety of vibration problems including free and forced vibrations, super- and sub-harmonic resonances, and complicated phenomena such as internal resonance are computed. Comparisons with previous results are also made.     

带有多道相关的抛物线Radon变换法分离P-P、P-SV波

因为多波多分量地震勘探中P-P波和P-SV波通常混杂在一起,所以较好地分离P-P波和P-SV波能够提高数据处理和解释的质量.抛物线Radon变换法在分离P-P波和P-SV波时取得了一定效果,但是在离散叠加的计算过程中会带来假频,这些假频会干扰波场分离.本文针对这一问题,将多道相关算法引入抛物线Radon变换,发展了带有多道相关的抛物线Radon变换法.该方法利用叠加信号具有相似性的特点,依据多道相关中衡量多道信号相似性的能量比标准,对叠加过程加以控制,压制变换中出现的假频.本文用该方法对合成地震记录进行了波场分离,取得了较好的效果.     

Improving the efficiency of ant algorithms using adaptive refinement: Application to storm water network design

The ant algorithm is a new evolutionary optimization method proposed for the solution of discrete combinatorial optimization problems. Many engineering optimization problems involve decision variables of continuous nature. Application of the ant algorithm to the optimization of these continuous problems requires discretization of the continuous search space, thereby reducing the underlying continuous problem to a discrete optimization problem. The level of discretization of the continuous search space, however, could present some problems. Generally, coarse discretization of the continuous design variables could adversely affect the quality of the final solution while finer discretization would enlarge the scale of the problem leading to higher computation cost and, occasionally, to low quality solutions. An adaptive refinement procedure is introduced in this paper as a remedy for the problem just outlined. The method is based on the idea of limiting the originally wide search space to a smaller one once a locally converged solution is obtained. The smaller search space is designed to contain the locally optimum solution at its center. The resulting search space is discretized and a completely new search is conducted to find a better solution. The procedure is continued until no improvement can be made by further refinement. The method is applied to a benchmark problem in storm water network design discipline and the results are compared with those of existing methods. The method is shown to be very effective and efficient regarding the optimality of the solution, and the convergence characteristics of the resulting ant algorithm. Furthermore, the method proves itself capable of finding an optimal, or near-optimal solution, independent of the discretization level and the size of the colony used.     

A coupled local–global upscaling approach for simulating flow in highly heterogeneous formations

A new technique for generating coarse scale models of highly heterogeneous subsurface formations is developed and applied. The method uses generic global coarse scale simulations to determine the boundary conditions for the local calculation of upscaled properties (permeability or transmissibility). An iteration procedure assures consistency between the local and global calculations. Transport processes are simulated using a subgrid velocity reconstruction technique applied in conjunction with the local–global upscaling procedure. For highly heterogeneous (e.g., channelized) systems, the new method is shown to provide considerably more accurate coarse scale models for flow and transport, relative to reference fine scale results, than do existing local (and extended local) upscaling techniques. The applicability of the upscaled models for different global boundary conditions is also considered.     

A seismic interpolation and denoising method with curvelet transform matching filter

A new seismic interpolation and denoising method with a curvelet transform matching filter, employing the fast iterative shrinkage thresholding algorithm (FISTA), is proposed. The approach treats the matching filter, seismic interpolation, and denoising all as the same inverse problem using an inversion iteration algorithm. The curvelet transform has a high sparseness and is useful for separating signal from noise, meaning that it can accurately solve the matching problem using FISTA. When applying the new method to a synthetic noisy data sets and a data sets with missing traces, the optimum matching result is obtained, noise is greatly suppressed, missing seismic data are filled by interpolation, and the waveform is highly consistent. We then verified the method by applying it to real data, yielding satisfactory results. The results show that the method can reconstruct missing traces in the case of low SNR (signal-to-noise ratio). The above three problems can be simultaneously solved via FISTA algorithm, and it will not only increase the processing efficiency but also improve SNR of the seismic data.     

基于初至波走时层析成像的Tikhonov正则化与梯度优化算法

初至波走时层析成像是利用地震初至波走时和其传播的射线路径来反演地下介质速度的技术.该问题本质上是一个不适定问题,需要使用正则化方法并辅之以适当的最优化技巧.本文从数值优化的角度介绍了初至波走时层析成像的反演原理,建立了Tikhonov正则化层析成像反演模型并提出求解极小化问题的加权修正步长的梯度下降算法.该方法可以从速度模型的可行域中迭代找到一个最优解.数值试验表明,该方法是可行和有应用前景的.     

Comparison of an algebraic multigrid algorithm to two iterative solvers used for modeling ground water flow and transport

Numerical solution of large-scale ground water flow and transport problems is often constrained by the convergence behavior of the iterative solvers used to solve the resulting systems of equations. We demonstrate the ability of an algebraic multigrid algorithm (AMG) to efficiently solve the large, sparse systems of equations that result from computational models of ground water flow and transport in large and complex domains. Unlike geometric multigrid methods, this algorithm is applicable to problems in complex flow geometries, such as those encountered in pore-scale modeling of two-phase flow and transport. We integrated AMG into MODFLOW 2000 to compare two- and three-dimensional flow simulations using AMG to simulations using PCG2, a preconditioned conjugate gradient solver that uses the modified incomplete Cholesky preconditioner and is included with MODFLOW 2000. CPU times required for convergence with AMG were up to 140 times faster than those for PCG2. The cost of this increased speed was up to a nine-fold increase in required random access memory (RAM) for the three-dimensional problems and up to a four-fold increase in required RAM for the two-dimensional problems. We also compared two-dimensional numerical simulations of steady-state transport using AMG and the generalized minimum residual method with an incomplete LU-decomposition preconditioner. For these transport simulations, AMG yielded increased speeds of up to 17 times with only a 20% increase in required RAM. The ability of AMG to solve flow and transport problems in large, complex flow systems and its ready availability make it an ideal solver for use in both field-scale and pore-scale modeling.     

An algorithmic approach to the total least-squares problem with linear and quadratic constraints

Proper incorporation of linear and quadratic constraints is critical in estimating parameters from a system of equations. These constraints may be used to avoid a trivial solution, to mitigate biases, to guarantee the stability of the estimation, to impose a certain “natural” structure on the system involved, and to incorporate prior knowledge about the system. The Total Least-Squares (TLS) approach as applied to the Errors-In-Variables (EIV) model is the proper method to treat problems where all the data are affected by random errors. A set of efficient algorithms has been developed previously to solve the TLS problem, and a few procedures have been proposed to treat TLS problems with linear constraints and TLS problems with a quadratic constraint. In this contribution, a new algorithm is presented to solve TLS problems with both linear and quadratic constraints. The new algorithm is developed using the Euler-Lagrange theorem while following an optimization process that minimizes a target function. Two numerical examples are employed to demonstrate the use of the new approach in a geodetic setting.     

A method of reconstructing complex stratigraphic surfaces with multitype fault constraints

The construction of complex stratigraphic surfaces is widely employed in many fields, such as petroleum exploration, geological modeling, and geological structure analysis. It also serves as an important foundation for data visualization and visual analysis in these fields. The existing surface construction methods have several deficiencies and face various difficulties, such as the presence of multitype faults and roughness of resulting surfaces. In this paper, a surface modeling method that uses geometric partial differential equations (PDEs) is introduced for the construction of stratigraphic surfaces. It effectively solves the problem of surface roughness caused by the irregularity of stratigraphic data distribution. To cope with the presence of multitype complex faults, a two-way projection algorithm between threedimensional space and a two-dimensional plane is proposed. Using this algorithm, a unified method based on geometric PDEs is developed for dealing with multitype faults. Moreover, the corresponding geometric PDE is derived, and an algorithm based on an evolutionary solution is developed. The algorithm proposed for constructing spatial surfaces with real data verifies its computational efficiency and its ability to handle irregular data distribution. In particular, it can reconstruct faulty surfaces, especially those with overthrust faults.     

日本兵库县南部大震灾对太原市防震减灾工作的启示

对日本阪神地区和太原市的活动断层、地震活动、城市工程地质环境、建筑物的抗震设防、老旧城区、生命线工程、次生灾害、震灾预测、防震意识等９个方面进行了对比分析，从中得到有益的启示，提出太原市在防震减灾中应引以为鉴的几项工作。     

Multi-resolution adaptive modeling of groundwater flow and transport problems

Many groundwater flow and transport problems, especially those with sharp fronts, narrow transition zones, layers and fingers, require extensive computational resources. In this paper, we present a novel multi-resolution adaptive Fup approach to solve the above mentioned problems. Our numerical procedure is the Adaptive Fup Collocation Method (AFCM), based on Fup basis functions and designed through a method of lines (MOL). Fup basis functions are localized and infinitely differentiable functions with compact support and are related to more standard choices such as splines or wavelets. This method enables the adaptive multi-resolution approach to solve problems with different spatial and temporal scales with a desired level of accuracy using the entire family of Fup basis functions. In addition, the utilized collocation algorithm enables the mesh free approach with consistent velocity approximation and flux continuity due to properties of the Fup basis functions. The introduced numerical procedure was tested and verified by a few characteristic groundwater flow and transport problems, the Buckley–Leverett multiphase flow problem, the 1-D vertical density driven problem and the standard 2-D seawater intrusion benchmark–Henry problem. The results demonstrate that the method is robust and efficient particularly when describing sharp fronts and narrow transition zones changing in space and time.     

Seismic Event Location: Nonlinear Inversion Using a Neighbourhood Algorithm

—?A recently developed direct search method for inversion, known as a neighbourhood algorithm (NA), is applied to the hypocentre location problem. Like some previous methods the algorithm uses randomised, or stochastic, sampling of a four-dimensional hypocentral parameter space, to search for solutions with acceptable data fit. Considerable flexibility is allowed in the choice of misfit measure.¶At each stage the hypocentral parameter space is partitioned into a series of convex polygons called Voronoi cells. Each cell surrounds a previously generated hypocentre for which the fit to the data has been determined. As the algorithm proceeds new hypocentres are randomly generated in the neighbourhood of those hypocentres with smaller data misfit. In this way all previous hypocentres guide the search, and the more promising regions of parameter space are preferentially sampled.¶The NA procedure makes use of just two tuning parameters. It is possible to choose their values so that the behaviour of the algorithm is similar to that of a contracting irregular grid in 4-D. This is the feature of the algorithm that we exploit for hypocentre location. In experiments with different events and data sources, the NA approach is able to achieve comparable or better levels of data fit than a range of alternative methods; linearised least-squares, genetic algorithms, simulated annealing and a contracting grid scheme. Moreover, convergence was achieved with a substantially reduced number of travel-time/slowness calculations compared with other nonlinear inversion techniques. Even when initial parameter bounds are very loose, the NA procedure produced robust convergence with acceptable levels of data fit.