Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Biological cybernetics 80 (1999), S. 227-234 
    ISSN: 1432-0770
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Computer Science , Physics
    Notes: Abstract. A neural network for partitioning graphs into any number of subgraphs using a k-way procedure is presented. The resulting neural network optimises all subgraphs so that they contain approximately the same number of vertices with the exception of a `separator' subgraph. The latter separates all the other subgraphs and is optimised to contain a minimum number of vertices. Expressions for the neuron link weights for such a network are derived analytically, and the recall mechanism of the mean field theorem neural network is used to obtain the graph partitioning. Applications focus on partitioning graphs associated with finite element meshes which, together with parallel domain decomposition solution methods, provide the motivation for this work.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 28 (1998), S. 903-915 
    ISSN: 0271-2091
    Keywords: finite elements ; incompressible flow ; drag coefficient ; heat transfer ; numerical modelling ; solid sphere ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: This paper reports numerical simulation of the flow past a heated/cooled sphere. A Galerkin finite element method is used to solve the 3D incompressible Boussinesq equations in primitive variable form. Numerical simulations of flow around the sphere for a range of Grashof numbers and moderate Reynolds numbers, were conducted. The drag coefficient for adiabatic flow shows good agreement with standard correlations over the range of the Reynolds numbers investigated. It is shown that the drag can vary considerably with heating of the sphere and that computational fluid dynamics methods can be used to derive constitutive laws for macroscopic momentum and heat exchange in multiphase flow. © 1998 John Wiley & Sons, Ltd.
    Additional Material: 13 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    Communications in Numerical Methods in Engineering 14 (1998), S. 59-63 
    ISSN: 1069-8299
    Keywords: Delaunay triangulation ; mesh colouring ; mesh coarsening ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new algorithm is described for automatic coarsening of Delaunay triangulations. The method automatically identifies the nodes of the mesh which are candidates for deletion in each region to be coarsened. The mesh coarsening procedure is to regenerate a Delaunay triangulation for all the remaining nodes in the solution domain. The adapted mesh retains a high quality for two reasons: (i) because a set of nodes have been used to obtain the coarse mesh, which are equidistant apart in some sense defined by the original mesh; (ii) because the triangulation is Delaunay. A two-dimensional example demonstrates the quality of the mesh after coarsening. © 1998 John Wiley & Sons, Ltd.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...