Transactions of the Japan Society for Computational Engineering and Science
Online ISSN : 1347-8826
ISSN-L : 1344-9443
Evaluation of convergence rate of iterative solvers for structural analysis
Mikio IIZUKAHiroshi OKUDAGenki YAGAWA
Author information
JOURNAL FREE ACCESS

2000 Volume 2000 Pages 20000030

Details
Abstract
Parallel computation should be needed to analyze the large-scale problem. Iterative solver is effective for the large scale parallel computation. The convergence rate of iterative solvers depends on the problem. Therefore, the applicable area of iterative solvers is restricted. If iterative solver converges for the problem, the efficacy of iterative solver is very large. It is very important to research the area in which iterative solver is efficacy and to develop the application technique of iterative solver. We study the convergence rate of iterative solver for more wide range problem like contact problem (penalty parameter), asymmetric matrix (contact with friction) to extend our study of evaluation of convergence rate of iterative solver for material nonlinearity analysis. The applicability of iterative solvers (CG method, Bi-CGSTAB method, GPBi-CG method) with preconditioning (SSOR, diagonal scaling, block factorization, ILU(IC)) has been studied. CG method with SSOR preconditioning is effective for wide range. CG method with block factorization preconditioning is effective for frictionless contact problem (symmetric matrix). Bi-CGSTAB method with block factorization preconditioning is effective for friction contact problem (asymmetric matrix).
Content from these authors
© 2000 The Japan Society For Computational Engineering and Science
Previous article Next article
feedback
Top