Home About us Contact
|
Home About us Contact | ||
|
|
||
Grid Generation (grid + generation)
Selected AbstractsUnstructured grid generation using LiDAR data for urban flood inundation modellingHYDROLOGICAL PROCESSES, Issue 11 2010Ryota Tsubaki Abstract Inundation disasters, caused by sudden water level rise or rapid flow, occur frequently in various parts of the world. Such catastrophes strike not only in thinly populated flood plains or farmland but also in highly populated villages or urban areas. Inundation of the populated areas causes severe damage to the economy, injury, and loss of life; therefore, a proper management scheme for the disaster has to be developed. To predict and manage such adversity, an understanding of the dynamic processes of inundation flow is necessary because risk estimation is performed based on inundation flow information. In this study, we developed a comprehensive method to conduct detailed inundation flow simulations for a populated area with quite complex topographical features using LiDAR (Light Detection and Ranging) data. Detailed geospatial information including the location and shape of each building was extracted from the LiDAR data and used for the grid generation. The developed approach can distinguish buildings from vegetation and treat them differently in the flow model. With this method, a fine unstructured grid can be generated representing the complicated urban land features precisely without exhausting labour for data preparation. The accuracy of the generated grid with different grid spacing and grid type is discussed and the optimal range of grid spacing for direct representation of urban topography is investigated. The developed method is applied to the estimation of inundation flows, which occurred in the basin of the Shin-minato River. A detailed inundation flow structure is represented by the flow model, and the flow characteristics with respect to topographic features are discussed. Copyright © 2010 John Wiley & Sons, Ltd. [source] A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domainsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 3 2010Mohamed S. Ebeida Abstract This paper describes a new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains. This technique is based on a Cartesian background grid with square elements and quadtree decomposition. A new algorithm is introduced for the distribution of boundary points based on the curvature of the domain boundaries. The quadtree decomposition is governed either by the distribution of the boundary points or by a size function when a solution-based adaptive grid is desired. The resulting grid is quaddominant and ready for the application of finite element, multi-grid, or line-relaxation methods. All the internal angles in the final grid have a lower bound of 45° and an upper bound of 135°. Although our main interest is in grid generation for unsteady flow simulations, the technique presented in this paper can be employed in many other fields. Several application examples are provided to illustrate the main features of this new approach. Copyright © 2010 John Wiley & Sons, Ltd. [source] Parallel computing of high-speed compressible flows using a node-based finite-element methodINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 3 2003T. Fujisawa Abstract An efficient parallel computing method for high-speed compressible flows is presented. The numerical analysis of flows with shocks requires very fine computational grids and grid generation requires a great deal of time. In the proposed method, all computational procedures, from the mesh generation to the solution of a system of equations, can be performed seamlessly in parallel in terms of nodes. Local finite-element mesh is generated robustly around each node, even for severe boundary shapes such as cracks. The algorithm and the data structure of finite-element calculation are based on nodes, and parallel computing is realized by dividing a system of equations by the row of the global coefficient matrix. The inter-processor communication is minimized by renumbering the nodal identification number using ParMETIS. The numerical scheme for high-speed compressible flows is based on the two-step Taylor,Galerkin method. The proposed method is implemented on distributed memory systems, such as an Alpha PC cluster, and a parallel supercomputer, Hitachi SR8000. The performance of the method is illustrated by the computation of supersonic flows over a forward facing step. The numerical examples show that crisp shocks are effectively computed on multiprocessors at high efficiency. Copyright © 2003 John Wiley & Sons, Ltd. [source] A feature-preserving volumetric technique to merge surface triangulationsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Issue 2 2002Juan R. Cebral Abstract Several extensions and improvements to surface merging procedures based on the extraction of iso-surfaces from a distance map defined on an adaptive background grid are presented. The main objective is to extend the application of these algorithms to surfaces with sharp edges and corners. In order to deal with objects of different length scales, the initial background grids are created using a Delaunay triangulation method and local voxelizations. A point enrichment technique that introduces points into the background grid along detected surface features such as ridges is used to ensure that these features are preserved in the final merged surface. The surface merging methodology is extended to include other Boolean operations between surface triangulations. The iso-surface extraction algorithms are modified to obtain the correct iso-surface for multi-component objects. The procedures are demonstrated with various examples, ranging from simple geometrical entities to complex engineering applications. The present algorithms allow realistic modelling of a large number of complex engineering geometries using overlapping components defined discretely, i.e. via surface triangulations. This capability is very useful for grid generation starting from data originated in measurements or images. Copyright © 2002 John Wiley & Sons, Ltd. [source] Applications of patient-specific CFD in medicine and life sciencesINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 6-7 2003Rainald Löhner Abstract Recent advances in medical image segmentation, grid generation, flow solvers, realistic boundary conditions, fluid,structure interaction, data reduction and visualization arc reviewed with special emphasis on patient-specific flow prediction. At the same time, present shortcomings in each one of these areas are identified. Several examples are given that show that this methodology is maturing rapidly, and may soon find widespread use in medicine. Copyright © 2003 John Wiley & Sons, Ltd. [source] Performance of algebraic multi-grid solvers based on unsmoothed and smoothed aggregation schemesINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Issue 7 2001R. WebsterArticle first published online: 31 JUL 200 Abstract A comparison is made of the performance of two algebraic multi-grid (AMG0 and AMG1) solvers for the solution of discrete, coupled, elliptic field problems. In AMG0, the basis functions for each coarse grid/level approximation (CGA) are obtained directly by unsmoothed aggregation, an appropriate scaling being applied to each CGA to improve consistency. In AMG1 they are assembled using a smoothed aggregation with a constrained energy optimization method providing the smoothing. Although more costly, smoothed basis functions provide a better (more consistent) CGA. Thus, AMG1 might be viewed as a benchmark for the assessment of the simpler AMG0. Selected test problems for D'Arcy flow in pipe networks, Fick diffusion, plane strain elasticity and Navier,Stokes flow (in a Stokes approximation) are used in making the comparison. They are discretized on the basis of both structured and unstructured finite element meshes. The range of discrete equation sets covers both symmetric positive definite systems and systems that may be non-symmetric and/or indefinite. Both global and local mesh refinements to at least one order of resolving power are examined. Some of these include anisotropic refinements involving elements of large aspect ratio; in some hydrodynamics cases, the anisotropy is extreme, with aspect ratios exceeding two orders. As expected, AMG1 delivers typical multi-grid convergence rates, which for all practical purposes are independent of mesh bandwidth. AMG0 rates are slower. They may also be more discernibly mesh-dependent. However, for the range of mesh bandwidths examined, the overall cost effectiveness of the two solvers is remarkably similar when a full convergence to machine accuracy is demanded. Thus, the shorter solution times for AMG1 do not necessarily compensate for the extra time required for its costly grid generation. This depends on the severity of the problem and the demanded level of convergence. For problems requiring few iterations, where grid generation costs represent a significant penalty, AMG0 has the advantage. For problems requiring a large investment in iterations, AMG1 has the edge. However, for the toughest problems addressed (vector and coupled vector,scalar fields discretized exclusively using finite elements of extreme aspect ratio) AMG1 is more robust: AMG0 has failed on some of these tests. However, but for this deficiency AMG0 would be the preferred linear approximation solver for Navier,Stokes solution algorithms in view of its much lower grid generation costs. Copyright © 2001 John Wiley & Sons, Ltd. [source] RANS-simulation of premixed turbulent combustion using the level set approachPROCEEDINGS IN APPLIED MATHEMATICS & MECHANICS, Issue 1 2005A. Kurenkov A model for premixed turbulent combustion is investigated using a RANS-approach. The evolution of the flame front is described with the help of the level set approach [1] which is used for tracking of propagating interfaces in free-surface flows, geodesics, grid generation and combustion. The fluid properties are conditioned on the flame front position using a burntunburnt probability function across the flame front. Computations are performed using the code FASTEST-3D which is a flow solver for a non-orthogonal, block-structured grid. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) [source] | ||||||||||