The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
Proceedings of the ACM/IEEE SC2004 Conference
DOI: 10.1109/sc.2004.62
|View full text |Cite
|
Sign up to set email alerts
|

Ultrascalable Implicit Finite Element Analyses in Solid Mechanics with over a Half a Billion Degrees of Freedom

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
126
0

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 104 publications
(127 citation statements)
references
References 32 publications
1
126
0
Order By: Relevance
“…This preconditioner has modest requirements in terms of CPU time, is only slightly slower than smoothed aggregation preconditioners for matrix-ready problems, is scalable up to thousands of processors and billions of unknowns, is orders of magnitude faster than the widely adopted Jacobi or element-by-element preconditioner, and reduces the memory consumption with respect to AMG preconditioners for matrix-ready problems by a factor of about 3 to 3.5, while converging in a comparable number of iterations. This memory savings is the main improvement over the approach presented by Adams [3] and later implemented by us in the Trilinos framework [4,33]. The proposed method can also be applied in other areas in which K exists only in the form of a matrix-vector multiplication routine provided that the graph of the K is available or can be cheaply generated.…”
Section: Introductionmentioning
confidence: 87%
See 2 more Smart Citations
“…This preconditioner has modest requirements in terms of CPU time, is only slightly slower than smoothed aggregation preconditioners for matrix-ready problems, is scalable up to thousands of processors and billions of unknowns, is orders of magnitude faster than the widely adopted Jacobi or element-by-element preconditioner, and reduces the memory consumption with respect to AMG preconditioners for matrix-ready problems by a factor of about 3 to 3.5, while converging in a comparable number of iterations. This memory savings is the main improvement over the approach presented by Adams [3] and later implemented by us in the Trilinos framework [4,33]. The proposed method can also be applied in other areas in which K exists only in the form of a matrix-vector multiplication routine provided that the graph of the K is available or can be cheaply generated.…”
Section: Introductionmentioning
confidence: 87%
“…Efficient implicit nonlinear methods are generally built around one of the numerous variants of Newton's method [3,6]. Newton's method is also wellknown to exhibit a convergence rate that is independent of spatial resolution in systems arising from elliptic-like PDEs.…”
Section: Conclusion and Future Developmentsmentioning
confidence: 99%
See 1 more Smart Citation
“…All analyses were run on an IBM Power4 supercomputer (IBM corporation, Armonk, NY) using a maximum of 440 processors in parallel and 900 GB memory, and a custom code with a parallel mesh partitioner and algebraic multigrid solver [26], requiring a total of approximately 4300 CPU hours. To simulate compressive loading of each vertebra, an apparent level compressive strain of 1.0% was applied to each model by using different displacement magnitudes based on the height of each model.…”
Section: Methodsmentioning
confidence: 99%
“…The FETI and AMG methods are also robust but are often much less expensive than direct solution methods and have been discussed in [23] and [49]. As a comparison to DPCG, we focus on the best AMG adaptation, smoothed aggregation (SA), as it has been demonstrated to be a successful parallel preconditioner for a number of structural mechanics applications [2,4,14]. The two most relevant studies of SA to the simulations considered here are those of [4,7], both of which focus on micro-FE modeling of bone deformation, based on micro-CT scans of human bones.…”
Section: Introductionmentioning
confidence: 99%