[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Comparison between substructure method and domain decomposition method

  • 2. Computational Science
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1401))

Included in the following conference series:

  • 259 Accesses

Abstract

Advantages and drawbacks of SSM [SubStructure Method (direct scheme)] in contrast with DDM [Domain Decomposition Method (iterative scheme)] is investigated. In higher-order nonlinear problem, several iterative methods show slow convergence or are hard to converge. In such case, the direct scheme will be inevitable. In this paper, direct scheme applied to substructure method which is suitable for parallel computer has been examined. In the previous year, a research-program was built to investigate parallel efficiency of both direct and iterative schemes by Cray-T3D. The program has been enhanced for this research by adding hierarchical substructure method as well as nonlinear capabilities and has been tuned up for VPP300 supercomputer. Using some test problems with over 1,000,000 DOF (degrees of freedom), are examined characteristics of substructure method and domain decomposition methods. Consequently, it has been shown that substructure method has superiority in some specific problems and requires much more memories comparing with the other in general. Domain decomposition method shows slow convergence in some problems, but it is superior in most cases to substructure method. It is shown that hierarchical substructure method has high efficiency in computational time, too.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yagawa, G., Soneda, N., Yoshimura, S.: A large scale finite element analysis using domain decomposition method on a parallel computer. Comput. Struct. 38, No.3 (1991) 269–281

    Google Scholar 

  2. Farhat, C., Roux, F.X.: A method of finite element tearing and interconnecting and its parallel solution algorithm. Int. j. numer. Methods. Eng. 32 (1991) 1205–1227

    Google Scholar 

  3. Saxena, M., Perucchio, R.: Parallel fem algorithms based on recursive spatial decomposition — ii. automatic analysis via hierarchical substructuring. Comput. Struct. 47, No.1 (1993) 143–154

    Google Scholar 

  4. Yagawa, G., Yoshimura, S., Soneda, N.: A parallel finite element method with a supercomputer network. Comput. Struct. 47,No.3 (1993) 407–418

    Google Scholar 

  5. Elwi, A.E., Murray, D.W.: Skyline algorithms for multilevel substructure analysis. Int. J. numer. Methods. Eng. 21 (1985) 465–479

    Google Scholar 

  6. Miyoshi, T.: Supercomputing in Computational Solid Mechanics. JSME A,57,541 (1991–9) 16–21

    Google Scholar 

  7. Edelman, A., Schreiber, R.: Tutorial Workshop on Parallel Processing. Tokyo and Osaka, Japan (January,1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Center of Computational Mechanics, Inc., Japan

    Kazushi Kitagawa (General Manager)

  2. Research Orgnization for Information Science and Technology, Japan

    Hisashi Nakamura (General Manager)

  3. University of Tokyo, Japan

    Genki Yagawa (Professor)

Authors
  1. Kazushi Kitagawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hisashi Nakamura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Genki Yagawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Sloot Marian Bubak Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kitagawa, K., Nakamura, H., Yagawa, G. (1998). Comparison between substructure method and domain decomposition method. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037162

Download citation

  • DOI: https://doi.org/10.1007/BFb0037162

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64443-9

  • Online ISBN: 978-3-540-69783-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation