Modified stiffness iteration to pinpoint multiple bifurcation points

Fumio Fujii, Kiyohiro Ikeda, Hirohisa Noguchi, Shigenobu Okazawa

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

A modified stiffness iteration to precisely compute a bifurcation point with multiple zero eigenvalues is presented. The iteration combines the direct pinpointing iteration for simple bifurcation points with a procedure to modify the tangent stiffness matrix based on pertinent congruent transformation to reduce the multiple eigenvalues to single ones. Two different transformation matrices are employed to modify the stiffness matrix: One is a non-orthogonal transformation matrix amplifying the values of the entries in a certain row and a column of the stiffness matrix. The other is an orthogonal one, which is chosen with reference to the symmetry of the system under consideration. The use of the non-orthogonal transformation matrix is a key idea termed "stiffness amplification method" in this paper, whereas the orthogonal matrix is based on block-diagonalization, which is becoming popular in group-theoretic analysis of symmetric structures. Extensive numerical examples show the robustness and usefulness of the proposed iteration method for pinpointing multiple bifurcation points.

Original languageEnglish
Pages (from-to)2499-2522
Number of pages24
JournalComputer Methods in Applied Mechanics and Engineering
Volume190
Issue number18-19
DOIs
Publication statusPublished - 2001 Jan 19

ASJC Scopus subject areas

  • Computational Mechanics
  • Mechanics of Materials
  • Mechanical Engineering
  • Physics and Astronomy(all)
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Modified stiffness iteration to pinpoint multiple bifurcation points'. Together they form a unique fingerprint.

  • Cite this