9 resultados para Vertex Folkman Number

em Greenwich Academic Literature Archive - UK


Relevância:

30.00% 30.00%

Publicador:

Resumo:

A number of research groups are now developing and using finite volume (FV) methods for computational solid mechanics (CSM). These methods are proving to be equivalent and in some cases superior to their finite element (FE) counterparts. In this paper we will describe a vertex-based FV method with arbitrarily structured meshes, for modelling the elasto-plastic deformation of solid materials undergoing small strains in complex geometries. Comparisons with rational FE methods will be given.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A monotone scheme for finite volume simulation of magnetohydrodynamic internal flows at high Hartmann number is presented. The numerical stability is analysed with respect to the electromagnetic force. Standard central finite differences applied to finite volumes can only be numerically stable if the vector products involved in this force are computed with a scheme using a fully staggered grid. The electromagnetic quantities (electric currents and electric potential) must be shifted by half the grid size from the mechanical ones (velocity and pressure). An integral treatment of the boundary layers is used in conjunction with boundary conditions for electrically conducting walls. The simulations are performed with inhomogeneous electrical conductivities of the walls and reach high Hartmann numbers in three-dimensional simulations, even though a non-adaptive grid is used.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A novel three-dimensional finite volume (FV) procedure is described in detail for the analysis of geometrically nonlinear problems. The FV procedure is compared with the conventional finite element (FE) Galerkin approach. FV can be considered to be a particular case of the weighted residual method with a unit weighting function, where in the FE Galerkin method we use the shape function as weighting function. A Fortran code has been developed based on the finite volume cell vertex formulation. The formulation is tested on a number of geometrically nonlinear problems. In comparison with FE, the results reveal that FV can reach the FE results in a higher mesh density.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We describe a heuristic method for drawing graphs which uses a multilevel technique combined with a force-directed placement algorithm. The multilevel process groups vertices to form clusters, uses the clusters to define a new graph and is repeated until the graph size falls below some threshold. The coarsest graph is then given an initial layout and the layout is successively refined on all the graphs starting with the coarsest and ending with the original. In this way the multilevel algorithm both accelerates and gives a more global quality to the force- directed placement. The algorithm can compute both 2 & 3 dimensional layouts and we demonstrate it on a number of examples ranging from 500 to 225,000 vertices. It is also very fast and can compute a 2D layout of a sparse graph in around 30 seconds for a 10,000 vertex graph to around 10 minutes for the largest graph. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A vertex-based finite volume (FV) method is presented for the computational solution of quasi-static solid mechanics problems involving material non-linearity and infinitesimal strains. The problems are analysed numerically with fully unstructured meshes that consist of a variety of two- and threedimensional element types. A detailed comparison between the vertex-based FV and the standard Galerkin FE methods is provided with regard to discretization, solution accuracy and computational efficiency. For some problem classes a direct equivalence of the two methods is demonstrated, both theoretically and numerically. However, for other problems some interesting advantages and disadvantages of the FV formulation over the Galerkin FE method are highlighted.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

CFD modelling of 'real-life' processes often requires solutions in complex three dimensional geometries, which can often result in meshes where aspects of it are badly distorted. Cell-centred finite volume methods, typical of most commercial CFD tools, are computationally efficient, but can lead to convergence problems on meshes which feature cells with high non-orthogonal shapes. The vertex-based finite volume method handles distorted meshes with relative ease, but is computationally expensive. A combined vertex-based - cell-centred (VB-CC) technique, detailed in this paper, allows solutions on distorted meshes that defeat purely cell-centred physical models to be employed in the solution of other transported quantities. The VB-CC method is validated with benchmark solutions for thermally driven flow and turbulent flow. An early application of this hybrid technique is to three-dimensional flow over an aircraft wing, although it is planned to use it in a wide variety of processing applications in the future.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The electronics industry and the problems associated with the cooling of microelectronic equipment are developing rapidly. Thermal engineers now find it necessary to consider the complex area of equipment cooling at some level. This continually growing industry also faces heightened pressure from consumers to provide electronic product miniaturization, which in itself increases the demand for accurate thermal management predictions to assure product reliability. Computational fluid dynamics (CFD) is considered a powerful and almost essential tool for the design, development and optimization of engineering applications. CFD is now widely used within the electronics packaging design community to thermally characterize the performance of both the electronic component and system environment. This paper discusses CFD results for a large variety of investigated turbulence models. Comparison against experimental data illustrates the predictive accuracy of currently used models and highlights the growing demand for greater mathematical modelling accuracy with regards to thermal characterization. Also a newly formulated low Reynolds number (i.e. transitional) turbulence model is proposed with emphasis on hybrid techniques.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a numerical study of the Reynolds number and scaling effects in microchannel flows. The configuration includes a rectangular, high-aspect ratio microchannel with heat sinks, similar to an experimental setup. Water at ambient temperature is used as a coolant fluid and the source of heating is introduced via electronic cartridges in the solids. Two channel heights, measuring 0.3 mm and 1 mm are considered at first. The Reynolds number varies in a range of 500-2200, based on the hydraulic diameter. Simulations are focused on the Reynolds number and channel height effects on the Nusselt number. It is found that the Reynolds number has noticeable influences on the local Nusselt number distributions, which are in agreement with other studies. The numerical predictions of the dimensionless temperature of the fluid agree fairly well with experimental measurements; however the dimensionless temperature of the solid does exhibit a significant discrepancy near the channel exit, similar to those reported by other researchers. The present study demonstrates that there is a significant scaling effect at small channel height, typically 0.3 mm, in agreement with experimental observations. This scaling effect has been confirmed by three additional simulations being carried out at channel heights of 0.24 mm, 0.14 mm and 0.1 mm, respectively. A correlation between the channel height and the normalized Nusselt number is thus proposed, which agrees well with results presented.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is shown that every connected, locally connected graph with the maximum vertex degree Δ(G)=5 and the minimum vertex degree δ(G)3 is fully cycle extendable. For Δ(G)4, all connected, locally connected graphs, including infinite ones, are explicitly described. The Hamilton Cycle problem for locally connected graphs with Δ(G)7 is shown to be NP-complete