33,570 research outputs found

    Generation of unstructured grids and Euler solutions for complex geometries

    Get PDF
    Algorithms are described for the generation and adaptation of unstructured grids in two and three dimensions, as well as Euler solvers for unstructured grids. The main purpose is to demonstrate how unstructured grids may be employed advantageously for the economic simulation of both geometrically as well as physically complex flow fields

    Particle Density Estimation with Grid-Projected Adaptive Kernels

    Full text link
    The reconstruction of smooth density fields from scattered data points is a procedure that has multiple applications in a variety of disciplines, including Lagrangian (particle-based) models of solute transport in fluids. In random walk particle tracking (RWPT) simulations, particle density is directly linked to solute concentrations, which is normally the main variable of interest, not just for visualization and post-processing of the results, but also for the computation of non-linear processes, such as chemical reactions. Previous works have shown the superiority of kernel density estimation (KDE) over other methods such as binning, in terms of its ability to accurately estimate the "true" particle density relying on a limited amount of information. Here, we develop a grid-projected KDE methodology to determine particle densities by applying kernel smoothing on a pilot binning; this may be seen as a "hybrid" approach between binning and KDE. The kernel bandwidth is optimized locally. Through simple implementation examples, we elucidate several appealing aspects of the proposed approach, including its computational efficiency and the possibility to account for typical boundary conditions, which would otherwise be cumbersome in conventional KDE

    Air pollution modelling using a graphics processing unit with CUDA

    Get PDF
    The Graphics Processing Unit (GPU) is a powerful tool for parallel computing. In the past years the performance and capabilities of GPUs have increased, and the Compute Unified Device Architecture (CUDA) - a parallel computing architecture - has been developed by NVIDIA to utilize this performance in general purpose computations. Here we show for the first time a possible application of GPU for environmental studies serving as a basement for decision making strategies. A stochastic Lagrangian particle model has been developed on CUDA to estimate the transport and the transformation of the radionuclides from a single point source during an accidental release. Our results show that parallel implementation achieves typical acceleration values in the order of 80-120 times compared to CPU using a single-threaded implementation on a 2.33 GHz desktop computer. Only very small differences have been found between the results obtained from GPU and CPU simulations, which are comparable with the effect of stochastic transport phenomena in atmosphere. The relatively high speedup with no additional costs to maintain this parallel architecture could result in a wide usage of GPU for diversified environmental applications in the near future.Comment: 5 figure

    Numerical simulation of conservation laws with moving grid nodes: Application to tsunami wave modelling

    Get PDF
    In the present article we describe a few simple and efficient finite volume type schemes on moving grids in one spatial dimension combined with appropriate predictor-corrector method to achieve higher resolution. The underlying finite volume scheme is conservative and it is accurate up to the second order in space. The main novelty consists in the motion of the grid. This new dynamic aspect can be used to resolve better the areas with large solution gradients or any other special features. No interpolation procedure is employed, thus unnecessary solution smearing is avoided, and therefore, our method enjoys excellent conservation properties. The resulting grid is completely redistributed according the choice of the so-called monitor function. Several more or less universal choices of the monitor function are provided. Finally, the performance of the proposed algorithm is illustrated on several examples stemming from the simple linear advection to the simulation of complex shallow water waves. The exact well-balanced property is proven. We believe that the techniques described in our paper can be beneficially used to model tsunami wave propagation and run-up.Comment: 46 pages, 7 figures, 7 tables, 94 references. Accepted to Geosciences. Other author's papers can be downloaded at http://www.denys-dutykh.com

    Spectral and Fermi surface properties from Wannier interpolation

    Full text link
    We present an efficient first-principles approach for calculating Fermi surface averages and spectral properties of solids, and use it to compute the low-field Hall coefficient of several cubic metals and the magnetic circular dichroism of iron. The first step is to perform a conventional first-principles calculation and store the low-lying Bloch functions evaluated on a uniform grid of k-points in the Brillouin zone. We then map those states onto a set of maximally-localized Wannier functions, and evaluate the matrix elements of the Hamiltonian and the other needed operators between the Wannier orbitals, thus setting up an ``exact tight-binding model.'' In this compact representation the k-space quantities are evaluated inexpensively using a generalized Slater-Koster interpolation. Because of the strong localization of the Wannier orbitals in real space, the smoothness and accuracy of the k-space interpolation increases rapidly with the number of grid points originally used to construct the Wannier functions. This allows k-space integrals to be performed with ab-initio accuracy at low cost. In the Wannier representation, band gradients, effective masses, and other k-derivatives needed for transport and optical coefficients can be evaluated analytically, producing numerically stable results even at band crossings and near weak avoided crossings.Comment: 12 pages, 7 figure

    Kinetic Solvers with Adaptive Mesh in Phase Space

    Full text link
    An Adaptive Mesh in Phase Space (AMPS) methodology has been developed for solving multi-dimensional kinetic equations by the discrete velocity method. A Cartesian mesh for both configuration (r) and velocity (v) spaces is produced using a tree of trees data structure. The mesh in r-space is automatically generated around embedded boundaries and dynamically adapted to local solution properties. The mesh in v-space is created on-the-fly for each cell in r-space. Mappings between neighboring v-space trees implemented for the advection operator in configuration space. We have developed new algorithms for solving the full Boltzmann and linear Boltzmann equations with AMPS. Several recent innovations were used to calculate the discrete Boltzmann collision integral with dynamically adaptive mesh in velocity space: importance sampling, multi-point projection method, and the variance reduction method. We have developed an efficient algorithm for calculating the linear Boltzmann collision integral for elastic and inelastic collisions in a Lorentz gas. New AMPS technique has been demonstrated for simulations of hypersonic rarefied gas flows, ion and electron kinetics in weakly ionized plasma, radiation and light particle transport through thin films, and electron streaming in semiconductors. We have shown that AMPS allows minimizing the number of cells in phase space to reduce computational cost and memory usage for solving challenging kinetic problems

    Adaptive computational methods for aerothermal heating analysis

    Get PDF
    The development of adaptive gridding techniques for finite-element analysis of fluid dynamics equations is described. The developmental work was done with the Euler equations with concentration on shock and inviscid flow field capturing. Ultimately this methodology is to be applied to a viscous analysis for the purpose of predicting accurate aerothermal loads on complex shapes subjected to high speed flow environments. The development of local error estimate strategies as a basis for refinement strategies is discussed, as well as the refinement strategies themselves. The application of the strategies to triangular elements and a finite-element flux-corrected-transport numerical scheme are presented. The implementation of these strategies in the GIM/PAGE code for 2-D and 3-D applications is documented and demonstrated
    • …
    corecore