• 제목/요약/키워드: Finite element meshes

검색결과 193건 처리시간 0.023초

A curved shell finite element for the geometrically non-linear analysis of box-girder beams curved in plan

  • Calik-Karakose, Ulku H.;Orakdogen, Engin;Saygun, Ahmet I.;Askes, Harm
    • Structural Engineering and Mechanics
    • /
    • 제52권2호
    • /
    • pp.221-238
    • /
    • 2014
  • A four-noded curved shell finite element for the geometrically non-linear analysis of beams curved in plan is introduced. The structure is conceived as a sequence of macro-elements (ME) having the form of transversal segments of identical topology where each slice is formed using a number of the curved shell elements which have 7 degrees of freedom (DOF) per node. A curved box-girder beam example is modelled using various meshes and linear analysis results are compared to the solutions of a well-known computer program SAP2000. Linear and non-linear analyses of the beam under increasing uniformly distributed loads are also carried out. In addition to box-girder beams, the proposed element can also be used in modelling open-section beams with curved or straight axes and circular plates under radial compression. Buckling loads of a circular plate example are obtained for coarse and successively refined meshes and results are compared with each other. The advantage of this element is that curved systems can be realistically modelled and satisfactory results can be obtained even by using coarse meshes.

DISCRETE COMPACTNESS PROPERTY FOR GENERAL QUADRILATERAL MESHES

  • KIM, JI HYUN
    • Journal of applied mathematics & informatics
    • /
    • 제40권5_6호
    • /
    • pp.949-958
    • /
    • 2022
  • The aim of this papaer is to prove the discrete compactness property for modified Raviart-Thomas element(MRT) of lowest order on quadrilateral meshes. Then MRT space can be used for eigenvalue problems, and is more efficient than the lowest order ABF space since it has less degrees of freedom.

3차원 곡면에서 삼각형 유한요소망의 자동생성 (Automatic Generation of Triangular Ginite Element Meshes on Three-Dimensional Surfaces)

  • 채수원;손창현
    • 한국CDE학회논문집
    • /
    • 제1권3호
    • /
    • pp.224-233
    • /
    • 1996
  • An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

  • PDF

불규칙영역에서의 격자망 자동발생 프로그램의 개발 (Development of an Automatic Mesh-Generation Program in Irregular Domains)

  • 김성희;권순국
    • 한국농공학회지
    • /
    • 제37권2호
    • /
    • pp.21-30
    • /
    • 1995
  • In order to save time and efforts in generating finite element meshes in irregular houndaries of domains, it is needed to develop an automatic mesh-generator which can hoth promote the accuracy of solutions and reduce the run-time in operating finite ele- ment models. In this study, the advancing front technique of triangular mesh generation and the transforming technique from triangular meshes to quadrilateral meshes were used to de- velop a computer program for the automatic triangular and quadrilateral meshes in the mixed shape. Furthermore, to enhance the quadrilateral mesh quality, the techniques of Laplancian smoothing and interior mesh modification were employed. The mesh genera- tor was applied to evaluate its applicability to irregular and complex geometries such as Nakdong river bay. In has hoen shown that the automatic mesh generator developed is capable of automatically generating meshes for irreguiar and complex geometries with high qualities of meshes and with the simple input data of arbitrarily specified nodal spacing in bound- aries.

  • PDF

A 2-D four-noded finite element containing a singularity of order λ

  • Abdel Wahab, M.M.;de Roeck, G.
    • Structural Engineering and Mechanics
    • /
    • 제3권4호
    • /
    • pp.383-390
    • /
    • 1995
  • A 2-D four-noded finite element which contains a ${\lambda}$ singularity is developed. The new element is compatible with quadratic standard isoparametric elements. The element is tested on two different examples. In the first example, an edge crack problem is analyzed using two different meshes and different integration orders. The second example is a crack perpendicular to the interface problem which is solved for different material properties and in turn different singularity order ${\lambda}$. The results of those examples illustrate the efficiency of the proposed element.

ASYMPTOTIC EXACTNESS OF SOME BANK-WEISER ERROR ESTIMATOR FOR QUADRATIC TRIANGULAR FINITE ELEMENT

  • Kim, Kwang-Yeon;Park, Ju-Seong
    • 대한수학회보
    • /
    • 제57권2호
    • /
    • pp.393-406
    • /
    • 2020
  • We analyze a posteriori error estimator for the conforming P2 finite element on triangular meshes which is based on the solution of local Neumann problems. This error estimator extends the one for the conforming P1 finite element proposed in [4]. We prove that it is asymptotically exact for the Poisson equation when the underlying triangulations are mildly structured and the solution is smooth enough.

통합 구조 시스템의 유한요소해석 자동화 (Automated Finite Element Analyses for Structural Integrated Systems)

  • 윤종열
    • 한국전산구조공학회논문집
    • /
    • 제37권1호
    • /
    • pp.49-56
    • /
    • 2024
  • 구조물의 동적 해석 자동화는 구조 통합 시스템에서 중요한 역할을 한다. 해석 결과에 따른 신속한 대피 또는 경고 조치가 신속하게 이루어지도록 해석 모듈은 짧은 실시간에 해석 결과를 출력해야 한다. 구조 해석법으로 세계적으로 가장 많이 사용되는 방법은 유한요소법이다. 유한요소법이 널리 사용되는 이유 중 하나는 사용의 편리다. 그러나 사용자가 유한요소망을 입력해야 하는데 요소망의 요소 수는 계상량과 정비례하고 요소망의 적절성은 에러와 연관된다. 본 연구는 시간 영역 동적 해석에서 전 단계 해석 결과를 사용하여 계산된 대표 변형률 값으로 오차를 평가하고, 요소 세분화는 절점 이동인 r-법과 요소 분할인 h-법의 조합으로 효율적으로 계산하는 적응적 요소망 형성 전략을 제시한다. 적용한 캔틸레버보와 간단한 프레임 예제를 통하여 적절한 요소망 형성, 정확성, 그리고 연산 효율성을 검증하였다. 이 방법의 간단함이 지진 하중, 풍하중, 비선형 해석 등에 의한 복잡한 구조 동적 해석에도 효율적으로 사용될 수 있는 것을 보여 준다.

요소의 대표 변형률 값에 근거한 에러평가를 이용한 평면응력문제의 적응적 요소망 형성 (Adaptive mesh generation for plane stress problems using error based on element′s representative strain value)

  • 정요찬;윤종열;홍승표
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2003년도 가을 학술발표회 논문집
    • /
    • pp.403-409
    • /
    • 2003
  • The finite element method is one of the most widely used method of structural analysis that has wide applications in diverse fields of engineering and science. The method has been proven effective and reliable in many practical problems. One of the reasons for the methods' popularity is its ease of use, but still the user has to input the finite element mesh which affects the accuracy of the results. The knowledge required to form an effective mesh for a given problem is somewhat complex and for sometime there has been research effort to automate the generation of the mesh and this is called the adaptive mesh generation scheme. A good adaptive mesh scheme seemed to require an accurate assessment of error and generally this requires some additional computation. This paper looks into the possibility of generating adaptive meshes based on representative strain values in each finite element method. The proposed adaptive scheme does not require additional computations other that looking up the data values already computed as finite element analysis results and simple manipulations of these data. Two plane stress problems, a plate with a hole and a deep beam with a concentrated load at the end are considered to show the progress of the improved generation of adaptive meshes using the scheme.

  • PDF

Iterative mesh partitioning strategy for improving the efficiency of parallel substructure finite element computations

  • Hsieh, Shang-Hsien;Yang, Yuan-Sen;Tsai, Po-Liang
    • Structural Engineering and Mechanics
    • /
    • 제14권1호
    • /
    • pp.57-70
    • /
    • 2002
  • This work presents an iterative mesh partitioning approach to improve the efficiency of parallel substructure finite element computations. The proposed approach employs an iterative strategy with a set of empirical rules derived from the results of numerical experiments on a number of different finite element meshes. The proposed approach also utilizes state-of-the-art partitioning techniques in its iterative partitioning kernel, a cost function to estimate the computational cost of each submesh, and a mechanism that adjusts element weights to redistribute elements among submeshes during iterative partitioning to partition a mesh into submeshes (or substructures) with balanced computational workloads. In addition, actual parallel finite element structural analyses on several test examples are presented to demonstrate the effectiveness of the approach proposed herein. The results show that the proposed approach can effectively improve the efficiency of parallel substructure finite element computations.

삼각격자에 대한 위상학적 개선과정의 확장 (Extension of Topological Improvement Procedures for Triangular Meshes)

  • 맹주성;한석영;최형일
    • 대한기계학회논문집B
    • /
    • 제25권6호
    • /
    • pp.853-859
    • /
    • 2001
  • This paper describes the extended topological clean up procedures to improve the quality of unstructured triangular meshes. As a postprocessing step, topological improvement procedures are applied both for elements that are interior to the mesh and for elements connected to the boundary and then Laplacian-like smoothing is used by default. Previous clean up algorithms are limited to eliminate the nodes of degree 3,4,8,9,10 and pairs of nodes of degree 5. In this study, new clean up algorithms which minimize the triple connection structures combined with degree 5 and 7 (ie ; 5-7-5, 7-7-5, 7-5-7 etc) are added. The suggested algorithms are applied to two example meshes to demonstrate the effectiveness of the approach in improving element quality in a finite element mesh.