Substructuring Method for Eigensolutions

Shun Weng, Hongping Zhu, Yong Xia

Research output: Chapter in book / Conference proceedingChapter in an edited book (as author)Academic researchpeer-review

1 Citation (Scopus)

Abstract

In this chapter, the commonly used Lanczos algorithm and subspace iteration methods for eigensolutions are first introduced. Also, the traditional substructuring methods for eigensolutions, such as the component mode synthesis method and Kron’s substructuring method, are illustrated. To improve the computational inefficiency of Kron’s substructuring method, a modal truncation approximation is proposed and will be elaborated. Only the lowest eigensolutions of the substructures need to be calculated. The discarded higher eigensolutions are compensated by the first-order residual flexibility or the second-order residual flexibility. The division of substructures and the selection of master modes in each substructure are also introduced.

Original languageEnglish
Title of host publicationEngineering Applications of Computational Methods
PublisherSpringer Nature
Pages11-45
Number of pages35
DOIs
Publication statusPublished - Jul 2023

Publication series

NameEngineering Applications of Computational Methods
Volume15
ISSN (Print)2662-3366
ISSN (Electronic)2662-3374

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Modelling and Simulation
  • Engineering (miscellaneous)
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Substructuring Method for Eigensolutions'. Together they form a unique fingerprint.

Cite this