DC Field | Value | Language |
---|---|---|
dc.contributor.author | 정형조 | - |
dc.contributor.author | 김만철 | - |
dc.contributor.author | 박선규 | - |
dc.contributor.author | 이인원 | - |
dc.date.accessioned | 2013-03-15T23:14:52Z | - |
dc.date.available | 2013-03-15T23:14:52Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1998-10 | - |
dc.identifier.citation | 한국전산구조공학회 가을학술발표회, v., no., pp.84 - 91 | - |
dc.identifier.uri | http://hdl.handle.net/10203/124965 | - |
dc.description.abstract | A numerically stable technique to remove tile limitation in choosing a shift in the subspace iteration method with shift is presented. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. This study selves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shiht is an eigenvalue itself. This is one of tile 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 shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered | - |
dc.language | KOR | - |
dc.publisher | 한국전산구조공학회 | - |
dc.title | 수치적으로 안정한 부분공간 반복법 | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 84 | - |
dc.citation.endingpage | 91 | - |
dc.citation.publicationname | 한국전산구조공학회 가을학술발표회 | - |
dc.identifier.conferencecountry | South Korea | - |
dc.identifier.conferencecountry | South Korea | - |
dc.contributor.localauthor | 정형조 | - |
dc.contributor.localauthor | 이인원 | - |
dc.contributor.nonIdAuthor | 김만철 | - |
dc.contributor.nonIdAuthor | 박선규 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.