We develop a new 3D ambient noise tomography (3D ANT) method for geotechnical site characterization. It requires recording ambient noise fields using a 2D surface array of geophones, from which experimental crosscorrelation functions (CCFs) are then extracted and directly inverted to obtain an S-wave velocity ([Formula: see text]) structure. The method consists of a forward simulation using 3D P-SV elastic wave equations to compute the synthetic CCF and an adjoint-state inversion to match the synthetic CCFs to the experimental CCFs for extraction of [Formula: see text]. The main advantage of the presented method, as compared with conventional passive-source seismic methods using characteristics of Green’s function (GF), is that it does not require equal energy on both sides of each receiver pair or far-field wavefields to retrieve the true GF. Instead, the source power spectrum density is inverted during the analysis and incorporated into the forward simulation of the synthetic CCFs to account for source energy distribution. After testing on synthetic data, the 3D ANT method is applied to 3 h of ambient noise recordings at the Garner Valley Downhole Array (GVDA) site in California, using a surface array of 196 geophones placed on a 14 × 14 grid with 5 m spacing. The inverted 3D [Formula: see text] model is found to be consistent with previous invasive and noninvasive geotechnical characterization efforts at the GVDA site. 
                        more » 
                        « less   
                    
                            
                            Identification of the 3D crystallographic orientation using 2D deformations
                        
                    
    
            Polycrystalline materials consist of grains (crystals) oriented at different angles resulting in a heterogeneous and anisotropic mechanical behavior at that micro-length scale. In this study, a novel method is proposed for the first time to determine the [Formula: see text] crystal orientations of grains in a [Formula: see text] domain, using solely [Formula: see text] deformation fields. The grain boundaries are assumed to be unknown and delineated from the reconstructed changes in the crystallographic orientation. Further, the constitutive equations that describe the mechanical behavior of the domain in [Formula: see text] under plane stress conditions are derived, assuming that the material is transversely isotropic in 3D. Finite element based algorithms are utilized to discretize the inverse problem. The in-house written inverse problem solver is coupled with Matlab-based optimization scripts to solve for the mechanical property distributions. The performance of this method is tested at different noise levels with synthetic displacements that were used as measured data. The reconstructions deteriorate as the noise level is increased. This work presents a first milestone in the verification of this novel technology with synthetic data. 
        more » 
        « less   
        
    
                            - Award ID(s):
- 1663435
- PAR ID:
- 10540608
- Publisher / Repository:
- SAGE Publications
- Date Published:
- Journal Name:
- The Journal of Strain Analysis for Engineering Design
- Volume:
- 57
- Issue:
- 6
- ISSN:
- 0309-3247
- Format(s):
- Medium: X Size: p. 445-458
- Size(s):
- p. 445-458
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            
- 
            When rheological models of polymer blends are used for inverse modeling, they can characterize polymer mixtures from rheological observations. This requires repeated evaluation of potentially expensive rheological models. We explored surrogate models based on Gaussian processes (GP-SM) as a cheaper alternative for describing the rheology of polydisperse binary blends. We used the time-dependent diffusion double reptation (TDD-DR) model as the true model; it takes a 5-dimensional input vector specifying the binary blend as input and yields a function called the relaxation spectrum as output. We used the TDD-DR model to generate training data of different sizes [Formula: see text], via Latin hypercube sampling. The optimal values of the GP-SM hyper-parameters, assuming a separable covariance kernel, were obtained by maximum likelihood estimation. The GP-SM interpolates the training data by design and offers reasonable predictions of relaxation spectra with uncertainty estimates. In general, the accuracy of GP-SMs improves as the size of the training data [Formula: see text] increases, as does the cost for training and prediction. The optimal hyper-parameters were found to be relatively insensitive to [Formula: see text]. Finally, we considered the inverse problem of inferring the structure of the polymer blend from a synthetic dataset generated using the true model. Surprisingly, the solution to the inverse problem obtained using GP-SMs and TDD-DR was qualitatively similar. GP-SMs can be several orders of magnitude cheaper than expensive rheological models, which provides a proof-of-concept validation for using GP-SMs for inverse problems in polymer rheology.more » « less
- 
            We consider a [Formula: see text] system of hyperbolic balance laws that is the converted form under inverse Hopf–Cole transformation of a Keller–Segel type chemotaxis model. We study Cauchy problem when Cauchy data connect two different end-states as [Formula: see text]. The background wave is a diffusive contact wave of the reduced system. We establish global existence of solution and study the time asymptotic behavior. In the special case where the cellular population initially approaches its stable equilibrium value as [Formula: see text], we obtain nonlinear stability of the diffusive contact wave under smallness assumption. In the general case where the population initially does not approach to its stable equilibrium value at least at one of the far fields, we use a correction function in the time asymptotic ansatz, and show that the population approaches logistically to its stable equilibrium value. Our result shows two significant differences when comparing to Euler equations with damping. The first one is the existence of a secondary wave in the time asymptotic ansatz. This implies that our solutions converge to the diffusive contact wave slower than those of Euler equations with damping. The second one is that the correction function logistically grows rather than exponentially decays.more » « less
- 
            We obtain regularity results in weighted Sobolev spaces for the solution of the obstacle problem for the integral fractional Laplacian [Formula: see text] in a Lipschitz bounded domain [Formula: see text] satisfying the exterior ball condition. The weight is a power of the distance to the boundary [Formula: see text] of [Formula: see text] that accounts for the singular boundary behavior of the solution for any [Formula: see text]. These bounds then serve us as a guide in the design and analysis of a finite element scheme over graded meshes for any dimension [Formula: see text], which is optimal for [Formula: see text].more » « less
- 
            We study the problem of covering barrier points by mobile sensors. Each sensor is represented by a point in the plane with the same covering range [Formula: see text] so that any point within distance [Formula: see text] from the sensor can be covered by the sensor. Given a set [Formula: see text] of [Formula: see text] points (called “barrier points”) and a set [Formula: see text] of [Formula: see text] points (representing the “sensors”) in the plane, the problem is to move the sensors so that each barrier point is covered by at least one sensor and the maximum movement of all sensors is minimized. The problem is NP-hard. In this paper, we consider two line-constrained variations of the problem and present efficient algorithms that improve the previous work. In the first problem, all sensors are given on a line [Formula: see text] and are required to move on [Formula: see text] only while the barrier points can be anywhere in the plane. We propose an [Formula: see text] time algorithm for the problem. We also consider the weighted case where each sensor has a weight; we give an [Formula: see text] time algorithm for this case. In the second problem, all barrier points are on [Formula: see text] while all sensors are in the plane but are required to move onto [Formula: see text] to cover all barrier points. We also solve the weighted case in [Formula: see text] time.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
