ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 1995-1999  (2)
  • 1995  (2)
Collection
Publisher
Years
  • 1995-1999  (2)
Year
  • 1
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 1611-1633 
    ISSN: 0029-5981
    Keywords: fracture ; fatigue ; shell cracks ; curvilinear growth ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A methodology for simulating the growth of long through cracks in the skin of pressurized aircraft fuselage structures is described. Crack trajectories are allowed to be arbitrary and are computed as part of the simulation. The interaction between the mechanical loads acting on the superstructure and the local structural response near the crack tips is accounted for by employing a hierarchical modelling strategy. The structural response for each cracked configuration is obtained using a geometrically non-linear shell finite element analysis procedure. Four stress intensity factors, two for membrane behaviour and two for bending using Kirchhoff plate theory, are computed using an extension of the modified crack closure integral method. Crack trajectories are determined by applying the maximum tangential stress criterion. Crack growth results in localized mesh deletion, and the deletion regions are remeshed automatically using a newly developed all-quadrilateral meshing algorithm. The effectiveness of the methodology, and its applicability to performing practical analyses of realistic structures, is demonstrated by simulating curvilinear crack growth in a fuselage panel that is representative of a typical narrow-body aircraft. The predicted crack trajectory and fatigue life compare well with measurements of these same quantities from a full-scale pressurized panel test.
    Additional Material: 15 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 2677-2701 
    ISSN: 0029-5981
    Keywords: automatic mesh generation ; quadtree ; quadrilateral elements ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A new hybrid algorithm for automatically generating either an all-quadrilateral or an all-triangular element mesh within an arbitrarily shaped domain is described. The input consists of one or more closed loops of straight-line segments that bound the domain. Internal mesh density is inferred from the boundary density using a recursive spatial decomposition (quadtree) procedure. All-triangular element meshes are generated using a boundary contraction procedure. All-quadrilateral element meshes are generated by modifying the boundary contraction procedure to produce a mixed element mesh at half the density of the final mesh and then applying a polygon-splitting procedure. The final meshes exhibit good transitioning properties and are compatible with the given boundary segments which are not altered. The algorithm can support discrete crack growth simulation wherein each step of crack growth results in an arbitrarily shaped region of elements deleted about each crack tip. The algorithm is described and examples of the generated meshes are provided for a representative selection of cracked and uncracked structures.
    Additional Material: 32 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...