메뉴 건너뛰기




Volumn 30, Issue 9-11, 1999, Pages 857-865

An algorithm for partitioning of finite element meshes

Author keywords

Complexity analysis; Finite elements; Ordering; Parallel computing; Partitioning

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; EFFICIENCY; FINITE ELEMENT METHOD; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PERFORMANCE;

EID: 0033184669     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(98)00100-8     Document Type: Article
Times cited : (7)

References (26)
  • 1
    • 3543095357 scopus 로고
    • Direct solution of two-dimensional finite element equations on distributed memory parallel computers
    • Durand M, Dabaghi FEl, editors Amsterdam: North-Holland
    • Zone O, Keunings R. Direct solution of two-dimensional finite element equations on distributed memory parallel computers. In: Durand M, Dabaghi FEl, editors. High performance computing II, Amsterdam: North-Holland, 1991. pp. 333-344.
    • (1991) High Performance Computing II , pp. 333-344
    • Zone, O.1    Keunings, R.2
  • 2
    • 0028976463 scopus 로고
    • Mesh partitioning for implicit computations via iterative domain decomposition: Impact and optimization of the subdomain aspect ratio
    • Farhat C, Maman N, Brown GW. Mesh partitioning for implicit computations via iterative domain decomposition: impact and optimization of the subdomain aspect ratio. International Journal of Numerical Methods in Engineering 1995;38:989-1000.
    • (1995) International Journal of Numerical Methods in Engineering , vol.38 , pp. 989-1000
    • Farhat, C.1    Maman, N.2    Brown, G.W.3
  • 4
    • 0023849939 scopus 로고
    • A simple and efficient automatic FEM domain decomposer
    • Farhat C. A simple and efficient automatic FEM domain decomposer. Computer and Structures 1988;28:579-602.
    • (1988) Computer and Structures , vol.28 , pp. 579-602
    • Farhat, C.1
  • 6
    • 0024087537 scopus 로고
    • Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessors computers
    • Malone JG. Automated mesh decomposition and concurrent finite element analysis for hypercube multiprocessors computers. Computer Methods in Applied Mechanics and Engineering 1988;70:27-58.
    • (1988) Computer Methods in Applied Mechanics and Engineering , vol.70 , pp. 27-58
    • Malone, J.G.1
  • 7
    • 0026239487 scopus 로고
    • A method of finite element tearing and interconnecting and its parallel solution algorithm
    • Farhat C, Roux FX. A method of finite element tearing and interconnecting and its parallel solution algorithm. International Journal of Numerical Methods in Engineering 1991;32:1205-1227.
    • (1991) International Journal of Numerical Methods in Engineering , vol.32 , pp. 1205-1227
    • Farhat, C.1    Roux, F.X.2
  • 8
    • 0001330587 scopus 로고
    • An algorithm for domain decomposition in finite element analysis
    • Al-Nasra M, Nguyen DT. An algorithm for domain decomposition in finite element analysis. Computers and Structures 1991;39:277-289.
    • (1991) Computers and Structures , vol.39 , pp. 277-289
    • Al-Nasra, M.1    Nguyen, D.T.2
  • 9
    • 0027556252 scopus 로고
    • Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics
    • Farhat C, Lesoinne M. Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics. International Journal of Numerical Methods in Engineering 1993;36:745-764.
    • (1993) International Journal of Numerical Methods in Engineering , vol.36 , pp. 745-764
    • Farhat, C.1    Lesoinne, M.2
  • 10
    • 0004920298 scopus 로고
    • Sub-domain generation for parallel finite element analysis
    • UK
    • Khan AI, Topping BHV. Sub-domain generation for parallel finite element analysis. In: Proc of Civil Comp 93, UK, 1993.
    • (1993) Proc of Civil Comp 93
    • Khan, A.I.1    Topping, B.H.V.2
  • 14
    • 3843145348 scopus 로고
    • Graph-theoretical methods for substructuring, subdomaining and ordering
    • Kaveh A, Roosta GR. Graph-theoretical methods for substructuring, subdomaining and ordering. International Journal of Space Structures 1995;10(2):121-131.
    • (1995) International Journal of Space Structures , vol.10 , Issue.2 , pp. 121-131
    • Kaveh, A.1    Roosta, G.R.2
  • 15
    • 3843058262 scopus 로고
    • Graph-theoretical methods for substructuring and ordering
    • Vienna, A.A. Bakema/ Rotterdam/Brookfield
    • Kaveh A, Roosta GR, Graph-theoretical methods for substructuring and ordering, In: Proc of the 10th European Conference on Earthquake Engineering, Vienna, A.A. Bakema/ Rotterdam/Brookfield, Vol. 2, 1995, pp. 1461-1466.
    • (1995) Proc of the 10th European Conference on Earthquake Engineering , vol.2 , pp. 1461-1466
    • Kaveh, A.1    Roosta, G.R.2
  • 17
    • 44949282112 scopus 로고
    • Partitioning of unstructured problems for parallel processing
    • Simon HD. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering 1991;2(1):135-148.
    • (1991) Computing Systems in Engineering , vol.2 , Issue.1 , pp. 135-148
    • Simon, H.D.1
  • 21
    • 0031640658 scopus 로고    scopus 로고
    • Comparative study of finite element nodal ordering methods
    • Kaveh A, Roosta GR. Comparative study of finite element nodal ordering methods, Engineering Structures, 1998;20:86-96.
    • (1998) Engineering Structures , vol.20 , pp. 86-96
    • Kaveh, A.1    Roosta, G.R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.