A Comparison of Parallel Preconditioners for the Sparse Generalized Eigenvalue Problems by Rayleigh-quotient Minimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 장호종 | - |
dc.date.accessioned | 2021-08-04T05:52:41Z | - |
dc.date.available | 2021-08-04T05:52:41Z | - |
dc.date.created | 2021-06-30 | - |
dc.date.issued | 2004-06-20 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/74377 | - |
dc.description.abstract | We consider the generalized eigenvalue problem, where both matrices are large sparse symmetric definite. As in the case of iterative methods for the linear system there is no videly accepted preconditioner for our problem. Our candidates are ILU(0) in the wafefron order, ILU(0) in the multi-Coloring order, Pint-SSOR, and Multi-Color Block SOR. | - |
dc.publisher | Technical University of Denmark | - |
dc.title | A Comparison of Parallel Preconditioners for the Sparse Generalized Eigenvalue Problems by Rayleigh-quotient Minimization | - |
dc.type | Conference | - |
dc.contributor.affiliatedAuthor | 장호종 | - |
dc.identifier.bibliographicCitation | PARA `04 State-of-the-Art in Scientific Computing | - |
dc.relation.isPartOf | PARA `04 State-of-the-Art in Scientific Computing | - |
dc.citation.title | PARA `04 State-of-the-Art in Scientific Computing | - |
dc.citation.conferencePlace | Copenhagen, Denmark | - |
dc.type.rims | CONF | - |
dc.description.journalClass | 1 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.