Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 11
    Electronic Resource
    Electronic Resource
    Three-dimensional parallel unstructured grid generation (1995)
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 905-925 
    Details
    ISSN: 0029-5981
    Keywords: grid generation ; advancing front ; load balancing ; parallel computers ; domain partitioning ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An algorithm for the parallel generation of 3-D unstructured grids is presented. The technique is an extension of the algorithm presented in Reference 21 for the 2-D case. The method uses a background grid as the means to separate spatially different regions, enabling the concurrent, parallel generation of elements in different domains and interdomain regions. The parallel 3-D grid generator was implemented and tested on the INTEL hypercube and Touchstone Delta parallel computers. The results obtained demonstrate the effectiveness of the algorithm developed. The methodology is applicable to the parallel implementation of a wide range of problems that are, in principle, scalar by nature, and do not lend themselves to SIMD parallelization.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/nme.1620380603
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    Finite element flux-corrected transport (FEM-FCT) for the euler and Navier-Stokes equations (1987)
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 7 (1987), S. 1093-1109 
    Details
    ISSN: 0271-2091
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: A high resolution finite element method for the solution of problems involving high speed compressible flows is presented. The method uses the concepts of flux-corrected transport and is presented in a form which is suitable for implementation on completely unstructured triangular or tetrahedral meshes. Transient and steady-state examples are solved to illustrate the performance of the algorithm.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/fld.1650071007
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    Adaptive h-refinement on 3D unstructured grids for transient problems (1992)
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 14 (1992), S. 1407-1419 
    Details
    ISSN: 0271-2091
    Keywords: Adaptive mesh refinement ; Finite elements ; Compressible flow ; Transient problems ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: An adaptive finite element scheme for transient problems is presented. The classic h-enrichment/coarsening is employed in conjunction with a tetrahedral finite element discretization in three dimensions. A mesh change is performed every n time steps, depending on the Courant number employed and the number of ‘protective layers’ added ahead of the refined region. In order to simplify the refinement/coarsening logic and to be as fast as possible, only one level of refinement/coarsening is allowed per mesh change. A high degree of vectorizability has been achieved by pre-sorting the elements and then performing the refinement/coarsening groupwise according to the case at hand. Further reductions in CPU requirements arc realized by optimizing the identification and sorting of elements for refinement and deletion. The developed technology has been used extensively for shock-shock and shock-object interaction runs in a production mode. A typical example of this class of problems is given.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/fld.1650141204
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    Generation of three-dimensional unstructured grids by the advancing-front method (1988)
    Chichester : Wiley-Blackwell
    International Journal for Numerical Methods in Fluids 8 (1988), S. 1135-1149 
    Details
    ISSN: 0271-2091
    Keywords: Three-dimensional unstructured grids ; Advancing-front technique ; Grid generation ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: The generation of three-dimensional unstructured grids using the advancing-front technique is described. This technique has been shown to be effective for the generation of unstructured grids in two dimensions.1,2 However, its extension to three-dimensional regions required algorithms to define the surface and suitable data structures that avoid excessive CPU-time overheads for the search operations involved. After obtaining an initial triangulation of the surfaces, tetrahedra are generated by successively deleting faces from the generation front. Details of the grid generation algorithm are given, together with examples and timings.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/fld.1650081003
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    Some useful data structures for the generation of unstructured grids (1988)
    New York, NY [u.a.] : Wiley-Blackwell
    Communications in Applied Numerical Methods 4 (1988), S. 123-135 
    Details
    ISSN: 0748-8025
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Several data structures for the generation of unstructured grids are described. Their usefulness stems from the fact that they enable the necessary search operations to be performed in an optimal way. In particular, we describe heap lists, quad- and octrees, and linked lists. Combining these data structures, the important problem of interpolating information between unstructured grids is also solved.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/cnm.1630040116
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...