An improved subspace iteration method with shifting

An efficient and stable technique to remove the limitation in choosing a shift in the subspace iteration method with shifting is presented. A major difficulty of the subspace iteration method with shifting is that, because of the singularity problem, a shift close to an eigenvalue cannot be used, resulting in slower convergence. This study solves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shift is an eigenvalue itself This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shifting, and the operation counts of above two methods are almost the same for large structures. To show the effectiveness of the proposed method, two numerical examples are considered. (C) 1999 Elsevier Science Ltd. Ail rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1999-03
Language
ENG
Keywords

INVERSE ITERATION

Citation

COMPUTERS STRUCTURES, v.70, no.6, pp.625 - 633

ISSN
0045-7949
URI
http://hdl.handle.net/10203/71507
Appears in Collection
CE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 113
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 10 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0