2004
DOI: 10.1016/j.compstruc.2004.06.001
|View full text |Cite
|
Sign up to set email alerts
|

Efficient iterative solvers for structural dynamics problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
1

Year Published

2005
2005
2017
2017

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 12 publications
0
5
0
1
Order By: Relevance
“…Kilic et al [10] showed that direct solvers provide a faster solution than iterative solvers in implicit structural dynamics with ill-conditioned coefficient matrices. Multifrontal parallel distributed symmetric and unsymmetric solvers [11] in MUMPS were evaluated by Amestoy [12].…”
Section: δUmentioning
confidence: 99%
“…Kilic et al [10] showed that direct solvers provide a faster solution than iterative solvers in implicit structural dynamics with ill-conditioned coefficient matrices. Multifrontal parallel distributed symmetric and unsymmetric solvers [11] in MUMPS were evaluated by Amestoy [12].…”
Section: δUmentioning
confidence: 99%
“…Our work on preconditioning linear systems arising from our structural simulations has resulted in extremely effective parallizable preconditioners. These preconditioners, based on our Spike [9] algorithm, are capable of fast convergence, low FLOP counts, and high concurrency. We have characterized the performance of solvers based on our preconditioner for a variety of meshes.…”
Section: Computational Modeling -Numerical Methods and Parallelismmentioning
confidence: 99%
“…Cahouet and Chabard conducted a systematic comparison of consumed time and convergence of the CG algorithm with different preconditioners. By comparing consumed time and data amount of the Cholesky and CG algorithm with several preconditioners, Kilic et al pointed out that iteration methods and direct methods both are applicable especially for structural dynamics problems. By comparing the numerical solution and the theoretical solution, Arioli proposed a revised termination condition of the CG algorithm based on the approximation of energy norm of error, which is thought to be an efficient way to evaluate speedup of preconditioners.…”
Section: Introductionmentioning
confidence: 99%