2009
DOI: 10.1016/j.jnnfm.2008.09.005
|View full text |Cite
|
Sign up to set email alerts
|

Parallel solution of large-scale free surface viscoelastic flows via sparse approximate inverse preconditioning

Abstract: a b s t r a c tThough computational techniques for two-dimensional viscoelastic free surface flows are well developed, three-dimensional flows continue to present significant computational challenges. Fully coupled free surface flow models lead to nonlinear systems whose steady states can be found via Newton's method. Each Newton iteration requires the solution of a large, sparse linear system, for which memory and computational demands suggest the application of an iterative method, rather than the sparse dir… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2010
2010
2011
2011

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 28 publications
(43 reference statements)
0
6
0
Order By: Relevance
“…Finally, the performance of the solution of the constitutive equation is perfect irrespective of the number of processors, while the use of an overlapping scheme of submeshes enhances the performance of the algorithm because it reduces the multiple exchanges of data. In all cases, both memory requirements and execution times where significant smaller compared with those of the conventional monolithic scheme [15]. These features constitute the proposed algorithm suitable for the simulation of transient viscoelastic flows.…”
Section: Discussionmentioning
confidence: 92%
See 3 more Smart Citations
“…Finally, the performance of the solution of the constitutive equation is perfect irrespective of the number of processors, while the use of an overlapping scheme of submeshes enhances the performance of the algorithm because it reduces the multiple exchanges of data. In all cases, both memory requirements and execution times where significant smaller compared with those of the conventional monolithic scheme [15]. These features constitute the proposed algorithm suitable for the simulation of transient viscoelastic flows.…”
Section: Discussionmentioning
confidence: 92%
“…Apparently, the time integration of more than two million unknowns with this fully implicit algorithm can be done in less than fifty seconds, if fourteen processors of this hardware system are used. For comparison purposes, it is useful to claim that the solution of a single system of 3656 equations with the conventional monolithic approximation [15] requires 15 s on eight processors. Moreover, the efficiency of our algorithm with regard to two processors is about 60%, which is higher than those of the flow and the mesh subproblems (∼50%), and becomes higher as the number of viscoelastic stress modes increases.…”
Section: Evaluation Of the Software Efficiencymentioning
confidence: 99%
See 2 more Smart Citations
“…More recently, Kim et al [9] applied an adaptive incomplete LU (AILU) preconditioned Bi-CGSTAB iterative method for both coupled and decoupled viscoelastic flows formulated with DEVSS-G/SUPG and Cai and Westphal [10] applied nonlinear nested iteration, an adaptive mesh refinement with an inexact Newton iteration, to their least-square finite element method for viscoelastic fluids. Another notable advance in the application of iterative solvers to viscoelastic flow simulations was recently made by Castillo et al [11]. They constructed a preconditioner for viscoelastic free surface flows using the sparse approximate inverse method (specifically a modification of the SPAI scheme of Grote and Huckle [13] for their Jacobian matrix in Newton's method) and reported that both the CPU time and the memory usage increases almost linearly with the problem size.…”
Section: Introductionmentioning
confidence: 99%