HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

A New Acceleration Factor Decision Method for ICCG Method Based on Condition Number

Files in This Item:
ToM48-2_519-522.pdf445.21 kBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/48513

Title: A New Acceleration Factor Decision Method for ICCG Method Based on Condition Number
Authors: Takada, Atsushi Browse this author
Noguchi, So Browse this author →KAKEN DB
Igarashi, Hajime Browse this author →KAKEN DB
Keywords: Acceleration factor
condition number
finite element method
ICCG method
submatrix
Issue Date: Feb-2012
Publisher: IEEE
Journal Title: IEEE Transactions on Magnetics
Volume: 48
Issue: 2
Start Page: 519
End Page: 522
Publisher DOI: 10.1109/TMAG.2011.2176722
Abstract: The ICCG method is widely used to solve a sparse symmetric linear system which results from the finite element method. In order to improve the convergence property of the ICCG method, the introduction of the acceleration factor was proposed. The automatic acceleration factor decision method, using the incomplete Cholesky decomposition of a coefficient matrix, has been previously proposed. However, when employing the previously proposed automatic decision method, much more iterations of ICCG method are sometimes necessary, compared with using the optimum acceleration factor, which minimizes the number of ICCG iterations. In this paper, we propose a new acceleration factor decision method. The proposed method takes into account the condition number of the coefficient matrix. It is well known that the condition number represents the quality of the matrix, so the optimum acceleration factor should be decided to minimize the condition number of the coefficient matrix. However, the condition number of the coefficient matrix is not almost available due to requiring a large memory in computing. Therefore, we develop a new method using submatrix, that does not need a large memory. The procedure and demonstration of the proposed method are described in this paper.
Rights: © 2012 IEEE. Reprinted, with permission, from Takada, A., Noguchi, S., Igarashi, H., A New Acceleration Factor Decision Method for ICCG Method Based on Condition Number, IEEE Transactions on Magnetics, Feb. 2012. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Hokkaido University products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Type: article (author version)
URI: http://hdl.handle.net/2115/48513
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 野口 聡

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 

 - Hokkaido University