An Assessment of Parallel Preconditioners for the Interior Sparse Generalized Eigenvalue Problems by CG-type Methods on an IBM Regatta Machine
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ma, Sangback | - |
dc.contributor.author | Jang, Ho jong | - |
dc.date.accessioned | 2021-06-23T19:06:08Z | - |
dc.date.available | 2021-06-23T19:06:08Z | - |
dc.date.issued | 2007-09 | - |
dc.identifier.issn | 1598-5857 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/43447 | - |
dc.description.abstract | Computing the interior spectrum of large sparse generalized eigenvalue problems Ax=λBx Ax=λBx , where A and b are large sparse and SPD(Symmetric Positive Definite), is often required in areas such as structural mechanics and quantum chemistry, to name a few. Recently, CG-type methods have been found useful and hence, very amenable to parallel computation for very large problems. Also, as in the case of linear systems proper choice of preconditioning is known to accelerate the rate of convergence. After the smallest eigenpair is found we use the orthogonal deflation technique to find the next m-1 eigenvalues, which is also suitable for parallelization. This offers advantages over Jacobi-Davidson methods with partial shifts, which requires re-computation of preconditioner matrx with new shifts. We consider as preconditioners Incomplete LU(ILU)(0) in two variants, ever-relaxation(SOR), and Point-symmetric SOR(SSOR). We set m to be 5. We conducted our experiments on matrices from discretizations of partial differential equations by finite difference method. The generated matrices has dimensions up to 4 million and total number of processors are 32. MPI(Message Passing Interface) library was used for interprocessor communications. Our results show that in general the Multi-Color ILU(0) gives the best performance. | - |
dc.format.extent | 9 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | 한국전산응용수학회 | - |
dc.title | An Assessment of Parallel Preconditioners for the Interior Sparse Generalized Eigenvalue Problems by CG-type Methods on an IBM Regatta Machine | - |
dc.type | Article | - |
dc.publisher.location | 대한민국 | - |
dc.identifier.bibliographicCitation | Journal of Applied Mathematics and Informatics, v.25, no.1-2, pp 435 - 443 | - |
dc.citation.title | Journal of Applied Mathematics and Informatics | - |
dc.citation.volume | 25 | - |
dc.citation.number | 1-2 | - |
dc.citation.startPage | 435 | - |
dc.citation.endPage | 443 | - |
dc.identifier.kciid | ART001183767 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Interior generalized eigenvalue | - |
dc.subject.keywordAuthor | iterative method | - |
dc.subject.keywordAuthor | conjugate gradient | - |
dc.subject.keywordAuthor | preconditioning | - |
dc.subject.keywordAuthor | parallel | - |
dc.subject.keywordAuthor | IBM regatta | - |
dc.identifier.url | https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001183767 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
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.