16,365 research outputs found

    A recursive-faulting model of distributed damage in confined brittle materials

    Get PDF
    We develop a model of distributed damage in brittle materials deforming in triaxial compression based on the explicit construction of special microstructures obtained by recursive faulting. The model aims to predict the effective or macroscopic behavior of the material from its elastic and fracture properties; and to predict the microstructures underlying the microscopic behavior. The model accounts for the elasticity of the matrix, fault nucleation and the cohesive and frictional behavior of the faults. We analyze the resulting quasistatic boundary value problem and determine the relaxation of the potential energy, which describes the macroscopic material behavior averaged over all possible fine-scale structures. Finally, we present numerical calculations of the dynamic multi-axial compression experiments on sintered aluminum nitride of Chen and Ravichandran [1994. Dynamic compressive behavior of ceramics under lateral confinement. J. Phys. IV 4, 177–182; 1996a. Static and dynamic compressive behavior of aluminum nitride under moderate confinement. J. Am. Soc. Ceramics 79(3), 579–584; 1996b. An experimental technique for imposing dynamic multiaxial compression with mechanical confinement. Exp. Mech. 36(2), 155–158; 2000. Failure mode transition in ceramics under dynamic multiaxial compression. Int. J. Fracture 101, 141–159]. The model correctly predicts the general trends regarding the observed damage patterns; and the brittle-to-ductile transition resulting under increasing confinement

    Concurrent Multiscale Computing of Deformation Microstructure by Relaxation and Local Enrichment with Application to Single-Crystal Plasticity

    Get PDF
    This paper is concerned with the effective modeling of deformation microstructures within a concurrent multiscale computing framework. We present a rigorous formulation of concurrent multiscale computing based on relaxation; we establish the connection between concurrent multiscale computing and enhanced-strain elements; and we illustrate the approach in an important area of application, namely, single-crystal plasticity, for which the explicit relaxation of the problem is derived analytically. This example demonstrates the vast effect of microstructure formation on the macroscopic behavior of the sample, e.g., on the force/travel curve of a rigid indentor. Thus, whereas the unrelaxed model results in an overly stiff response, the relaxed model exhibits a proper limit load, as expected. Our numerical examples additionally illustrate that ad hoc element enhancements, e.g., based on polynomial, trigonometric, or similar representations, are unlikely to result in any significant relaxation in general

    Measurements design and phenomena discrimination

    Get PDF
    The construction of measurements suitable for discriminating signal components produced by phenomena of different types is considered. The required measurements should be capable of cancelling out those signal components which are to be ignored when focusing on a phenomenon of interest. Under the hypothesis that the subspaces hosting the signal components produced by each phenomenon are complementary, their discrimination is accomplished by measurements giving rise to the appropriate oblique projector operator. The subspace onto which the operator should project is selected by nonlinear techniques in line with adaptive pursuit strategies

    Optimal posting price of limit orders: learning by trading

    Get PDF
    Considering that a trader or a trading algorithm interacting with markets during continuous auctions can be modeled by an iterating procedure adjusting the price at which he posts orders at a given rhythm, this paper proposes a procedure minimizing his costs. We prove the a.s. convergence of the algorithm under assumptions on the cost function and give some practical criteria on model parameters to ensure that the conditions to use the algorithm are fulfilled (using notably the co-monotony principle). We illustrate our results with numerical experiments on both simulated data and using a financial market dataset

    Efficient spatial modelling using the SPDE approach with bivariate splines

    Get PDF
    Gaussian fields (GFs) are frequently used in spatial statistics for their versatility. The associated computational cost can be a bottleneck, especially in realistic applications. It has been shown that computational efficiency can be gained by doing the computations using Gaussian Markov random fields (GMRFs) as the GFs can be seen as weak solutions to corresponding stochastic partial differential equations (SPDEs) using piecewise linear finite elements. We introduce a new class of representations of GFs with bivariate splines instead of finite elements. This allows an easier implementation of piecewise polynomial representations of various degrees. It leads to GMRFs that can be inferred efficiently and can be easily extended to non-stationary fields. The solutions approximated with higher order bivariate splines converge faster, hence the computational cost can be alleviated. Numerical simulations using both real and simulated data also demonstrate that our framework increases the flexibility and efficiency.Comment: 26 pages, 7 figures and 3 table

    Optimal Discrete Uniform Generation from Coin Flips, and Applications

    Full text link
    This article introduces an algorithm to draw random discrete uniform variables within a given range of size n from a source of random bits. The algorithm aims to be simple to implement and optimal both with regards to the amount of random bits consumed, and from a computational perspective---allowing for faster and more efficient Monte-Carlo simulations in computational physics and biology. I also provide a detailed analysis of the number of bits that are spent per variate, and offer some extensions and applications, in particular to the optimal random generation of permutations.Comment: first draft, 22 pages, 5 figures, C code implementation of algorith
    corecore