Home About us Contact | |||
Grid Density (grid + density)
Selected AbstractsParallel simulation of unsteady hovering rotor wakesINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 6 2006C. B. Allen Abstract Numerical simulation using low diffusion schemes, for example free-vortex or vorticity transport methods, and theoretical stability analyses have shown the wakes of rotors in hover to be unsteady. This has also been observed in experiments, although the instabilities are not always repeatable. Hovering rotor wake stability is considered here using a finite-volume compressible CFD code. An implicit unsteady, multiblock, multigrid, upwind solver, and structured multiblock grid generator are presented, and applied to lifting rotors in hover. To allow the use of very fine meshes and, hence, better representation of the flow physics, a parallel version of the code has been developed, and parallel performance using upto 1024 CPUs is presented. A four-bladed rotor is considered, and it is demonstrated that once the grid density is sufficient to capture enough turns of the tip vortices, hover exhibits oscillatory behaviour of the wake, even using a steady formulation. An unsteady simulation is then performed, and also shows an unsteady wake. Detailed analysis of the time-accurate wake history shows that three dominant unsteady modes are captured, for this four-bladed case, with frequencies of one, four, and eight times the rotational frequency. A comparison with theoretical stability analysis is also presented. Copyright © 2006 John Wiley & Sons, Ltd. [source] Parallel solution of lifting rotors in hover and forward flightINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 1 2007C. B. Allen Abstract An implicit unsteady, multiblock, multigrid, upwind solver including mesh deformation capability, and structured multiblock grid generator, are presented and applied to lifting rotors in both hover and forward flight. To allow the use of very fine meshes and, hence, better representation of the flow physics, a parallel version of the code has been developed. It is demonstrated that once the grid density is sufficient to capture enough turns of the tip vortices, hover exhibits oscillatory behaviour of the wake, even using a steady formulation. An unsteady simulation is then presented, and detailed analysis of the time-accurate wake history is performed and compared to theoretical predictions. Forward flight simulations are also presented and, again, grid density effects on the wake formation investigated. Parallel performance of the code using up to 1024 CPU's is also presented. Copyright © 2006 John Wiley & Sons, Ltd. [source] Numerical errors of the volume-of-fluid interface tracking algorithmINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 4 2002Gregor, erne Abstract One of the important limitations of the interface tracking algorithms is that they can be used only as long as the local computational grid density allows surface tracking. In a dispersed flow, where the dimensions of the particular fluid parts are comparable or smaller than the grid spacing, several numerical and reconstruction errors become considerable. In this paper the analysis of the interface tracking errors is performed for the volume-of-fluid method with the least squares volume of fluid interface reconstruction algorithm. A few simple two-fluid benchmarks are proposed for the investigation of the interface tracking grid dependence. The expression based on the gradient of the volume fraction variable is introduced for the estimation of the reconstruction correctness and can be used for the activation of an adaptive mesh refinement algorithm. Copyright © 2002 John Wiley & Sons, Ltd. [source] A three-dimensional mesh refinement algorithm with low boundary reflections for the finite-difference time-domain simulation of metallic structuresINTERNATIONAL JOURNAL OF NUMERICAL MODELLING: ELECTRONIC NETWORKS, DEVICES AND FIELDS, Issue 3 2010W. H. P. Pernice Abstract We present a method for including areas of high grid density into a general grid for the finite-difference time-domain method in three dimensions. Reflections occurring at the boundaries separating domains of different grid size are reduced significantly by introducing appropriate interpolation methods for missing boundary points. Several levels of refinement can be included into one calculation using a hierarchical refinement architecture. The algorithm is implemented with an auxiliary differential equation technique that allows for the simulation of metallic structures. We illustrate the performance of the algorithm through the simulation of metal nano-particles included in a coarser grid and by investigating gold optical antennas. Copyright © 2009 John Wiley & Sons, Ltd. [source] |