210 research outputs found

    A multiple-time-step integration algorithm for particle-resolved simulation with physical collision time

    Full text link
    In this paper, we present a multiple-time-step integration algorithm (MTSA) for particle collisions in particle-resolved simulations. Since the time step required for resolving a collision process is much smaller than that for a fluid flow, the computational cost of the traditional soft-sphere model by reducing the time step is quite high in particle-resolved simulations. In one state-of-the-art methodology, collision time is stretched to several times the flow solver time step for the fluid to adapt to the sudden change in particle motion. However, the stretched collision time is not physical, the hydrodynamic force may be severely underestimated during a stretched collision, and the simulation of sediment transport may be sensitive to the stretched collision time. The proposed MTSA adopts different time steps to resolve fluid flow, fluid-particle interaction, and particle collision. We assessed the MTSA for particle-wall collisions as well as particle-particle collisions, determined the optimal iteration number in the algorithm, and obtained excellent agreements with experimental measurements and reference simulations. The computational cost of the MTSA can be reduced to about one order of magnitude less than that using the traditional soft-sphere model with almost the same accuracy. The MTSA was then implemented in a particle-resolved simulation of sediment transport with thousands of particles. {By comparing the results obtained using the MTSA and a version of the stretching collision time algorithm similar to Costa et al.(2015), we found that stretching the collision time reduced particle stiffness, weakened particle entrainment, and affected some turbulence and particle statistics

    Hybrid of memory andprediction strategies for dynamic multiobjective optimization

    Get PDF
    The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Dynamic multiobjective optimization problems (DMOPs) are characterized by a time-variant Pareto optimal front (PF) and/or Pareto optimal set (PS). To handle DMOPs, an algorithm should be able to track the movement of the PF/PS over time efficiently. In this paper, a novel dynamic multiobjective evolutionary algorithm (DMOEA) is proposed for solving DMOPs, which includes a hybrid of memory and prediction strategies (HMPS) and the multiobjective evolutionary algorithm based on decomposition (MOEA/D). In particular, the resultant algorithm (MOEA/D-HMPS) detects environmental changes and identifies the similarity of a change to the historical changes, based on which two different response strategies are applied. If a detected change is dissimilar to any historical changes, a differential prediction based on the previous two consecutive population centers is utilized to relocate the population individuals in the new environment; otherwise, a memory-based technique devised to predict the new locations of the population members is applied. Both response mechanisms mix a portion of existing solutions with randomly generated solutions to alleviate the effect of prediction errors caused by sharp or irregular changes. MOEA/D-HMPS was tested on 14 benchmark problems and compared with state-of-the-art DMOEAs. The experimental results demonstrate the efficiency of MOEA/D-HMPS in solving various DMOPs

    A dynamic multi-objective evolutionary algorithm based on decision variable classification

    Get PDF
    The file attached to this record is the author's final peer reviewed version.In recent years, dynamic multi-objective optimization problems (DMOPs) have drawn increasing interest. Many dynamic multi-objective evolutionary algorithms (DMOEAs) have been put forward to solve DMOPs mainly by incorporating diversity introduction or prediction approaches with conventional multi-objective evolutionary algorithms. Maintaining good balance of population diversity and convergence is critical to the performance of DMOEAs. To address the above issue, a dynamic multi-objective evolutionary algorithm based on decision variable classification (DMOEA-DVC) is proposed in this study. DMOEA-DVC divides the decision variables into two and three different groups in static optimization and change response stages, respectively. In static optimization, two different crossover operators are used for the two decision variable groups to accelerate the convergence while maintaining good diversity. In change response, DMOEA-DVC reinitializes the three decision variable groups by maintenance, prediction, and diversity introduction strategies, respectively. DMOEA-DVC is compared with the other six state-of-the-art DMOEAs on 33 benchmark DMOPs. Experimental results demonstrate that the overall performance of the DMOEA-DVC is superior or comparable to that of the compared algorithms

    Kawasaki-type Dynamics: Diffusion in the kinetic Gaussian model

    Full text link
    In this article, we retain the basic idea and at the same time generalize Kawasaki's dynamics, spin-pair exchange mechanism, to spin-pair redistribution mechanism, and present a normalized redistribution probability. This serves to unite various order-parameter-conserved processes in microscopic, place them under the control of a universal mechanism and provide the basis for further treatment. As an example of the applications, we treated the kinetic Gaussian model and obtained exact diffusion equation. We observed critical slowing down near the critical point and found that, the critical dynamic exponent z=1/nu=2 is independent of space dimensionality and the assumed mechanism, whether Glauber-type or Kawasaki-type.Comment: accepted for publication in PR

    Quantitative Prediction of Coalbed Gas Content Based on Seismic Multiple-Attribute Analyses

    Get PDF
    Accurate prediction of gas planar distribution is crucial to selection and development of new CBM exploration areas. Based on seismic attributes, well logging and testing data we found that seismic absorption attenuation, after eliminating the effects of burial depth, shows an evident correlation with CBM gas content; (positive) structure curvature has a negative correlation with gas content; and density has a negative correlation with gas content. It is feasible to use the hydrocarbon index (P*G) and pseudo-Poisson ratio attributes for detection of gas enrichment zones. Based on seismic multiple-attribute analyses, a multiple linear regression equation was established between the seismic attributes and gas content at the drilling wells. Application of this equation to the seismic attributes at locations other than the drilling wells yielded a quantitative prediction of planar gas distribution. Prediction calculations were performed for two different models, one using pre-stack inversion and the other one disregarding pre-stack inversion. A comparison of the results indicates that both models predicted a similar trend for gas content distribution, except that the model using pre-stack inversion yielded a prediction result with considerably higher precision than the other model

    Multiple solutions for a nonhomogeneous Schr\"odinger-Maxwell system in R3R^3

    Full text link
    The paper considers the following nonhomogeneous Schr\"odinger-Maxwell system -\Delta u + u+\lambda\phi (x) u =|u|^{p-1}u+g(x),\ x\in \mathbb{R}^3, -\Delta\phi = u^2, \ x\in \mathbb{R}^3, . \leqno{(SM)} where λ>0\lambda>0, p∈(1,5)p\in(1,5) and g(x)=g(∣x∣)∈L2(R3)∖0g(x)=g(|x|)\in L^2(\mathbb{R}^3)\setminus{0}. There seems no any results on the existence of multiple solutions to problem (SM) for p∈(1,3]p \in (1,3]. In this paper, we find that there is a constantCp>0C_p>0 such that problem (SM) has at least two solutions for all p∈(1,5)p\in (1,5) provided ∥g∥L2≤Cp\|g\|_{L^2} \leq C_p, but only for p∈(1,2]p\in(1,2] we need λ>0\lambda>0 is small. Moreover, Cp=(p−1)2p[(p+1)Sp+12p]1/(p−1)C_p=\frac{(p-1)}{2p}[\frac{(p+1)S^{p+1}}{2p}]^{1/(p-1)}, where SS is the Sobolev constant.Comment: 12 page
    • …
    corecore