222,866 research outputs found

    Spectral-element simulations of long-term fault slip: Effect of low-rigidity layers on earthquake-cycle dynamics

    Get PDF
    We develop a spectral element method for the simulation of long-term histories of spontaneous seismic and aseismic slip on faults subjected to tectonic loading. Our approach reproduces all stages of earthquake cycles: nucleation and propagation of earthquake rupture, postseismic slip and interseismic creep. We apply the developed methodology to study the effects of low-rigidity layers on the dynamics of the earthquake cycle in 2-D. We consider two cases: small (M ~ 1) earthquakes on a fault surrounded by a damaged fault zone and large (M ~ 7) earthquakes on a vertical strike-slip fault that cuts through shallow low-rigidity layers. Our results indicate how the source properties of repeating earthquakes are affected by the presence of a damaged fault zone with low rigidity. Compared to faults in homogeneous media, we find (1) reduction in the earthquake nucleation size, (2) amplification of slip rates during dynamic rupture propagation, (3) larger recurrence interval, and (4) smaller amount of aseismic slip. Based on linear stability analysis, we derive a theoretical estimate of the nucleation size as a function of the width and rigidity reduction of the fault zone layer, which is in good agreement with simulated nucleation sizes. We further examine the effects of vertically-stratified layers (e.g., sedimentary basins) on the nature of shallow coseismic slip deficit. Our results suggest that low-rigidity shallow layers alone do not lead to coseismic slip deficit. While the low-rigidity layers result in lower interseismic stress accumulation, they also cause dynamic amplification of slip rates, with the net effect on slip being nearly zero

    Principal manifolds and graphs in practice: from molecular biology to dynamical systems

    Full text link
    We present several applications of non-linear data modeling, using principal manifolds and principal graphs constructed using the metaphor of elasticity (elastic principal graph approach). These approaches are generalizations of the Kohonen's self-organizing maps, a class of artificial neural networks. On several examples we show advantages of using non-linear objects for data approximation in comparison to the linear ones. We propose four numerical criteria for comparing linear and non-linear mappings of datasets into the spaces of lower dimension. The examples are taken from comparative political science, from analysis of high-throughput data in molecular biology, from analysis of dynamical systems.Comment: 12 pages, 9 figure

    Error estimates for a tree structure algorithm solving finite horizon control problems

    Full text link
    In the Dynamic Programming approach to optimal control problems a crucial role is played by the value function that is characterized as the unique viscosity solution of a Hamilton-Jacobi-Bellman (HJB) equation. It is well known that this approach suffers of the "curse of dimensionality" and this limitation has reduced its practical in real world applications. Here we analyze a dynamic programming algorithm based on a tree structure. The tree is built by the time discrete dynamics avoiding in this way the use of a fixed space grid which is the bottleneck for high-dimensional problems, this also drops the projection on the grid in the approximation of the value function. We present some error estimates for a first order approximation based on the tree-structure algorithm. Moreover, we analyze a pruning technique for the tree to reduce the complexity and minimize the computational effort. Finally, we present some numerical tests
    corecore