- Page 1 and 2: EFFICIENT PARALLEL COMPUTATION TO S
- Page 3: Acknowledgments First, I would like
- Page 7 and 8: Abstract Hemodynamic simulation is
- Page 9 and 10: 2.3.2 Overview on the AS method . .
- Page 11 and 12: List of Figures 1.1 Steps of the bl
- Page 13 and 14: 3.15 Speedup of the Navier Stokes c
- Page 15 and 16: List of Tables 2.1 Descriptions of
- Page 17 and 18: process called aneurysm, or a steno
- Page 19 and 20: plaques, which induces the thicknes
- Page 21 and 22: 1.2 Incompressible Navier Stokes In
- Page 23 and 24: with some synchronization. Parallel
- Page 25 and 26: 1.4 Domain decomposition As describ
- Page 27 and 28: Another technique to accelerate the
- Page 29 and 30: have been developed to solve effici
- Page 31 and 32: 1.6 Objective of the dissertation T
- Page 33 and 34: technique has been studied and comp
- Page 35 and 36: penalty method [8] to execute reali
- Page 37 and 38: in Lapack, Sparskit, and Hypre. •
- Page 39 and 40: this dissertation, we address only
- Page 41 and 42: • options2: stands for more advan
- Page 43 and 44: Figure 2.1: Comparison between BICG
- Page 45 and 46: Figure 2.4: Comparison between BICG
- Page 47 and 48: Figure 2.6: Comparison of the elaps
- Page 49 and 50: Figure 2.10: Surface Response on Hy
- Page 51 and 52: 2.3.1 Introduction and Motivations
- Page 53 and 54: only neighboring subdomains. The ra
- Page 55 and 56:
u n+1 1|Γ 1 = u n 2|Γ 1 , u n+1 2
- Page 57 and 58:
• step 5: Apply the Aitken accele
- Page 59 and 60:
Let us denote λ k = 4 sin(kπhy/2)
- Page 61 and 62:
2.3.3.3 Nonhomogeneous Dirichlet bo
- Page 63 and 64:
to solve the linear system in each
- Page 65 and 66:
18 16 160−160 pts 240−240 pts 3
- Page 67 and 68:
Table 2.3: Performance of different
- Page 69 and 70:
Table 2.4: LU and GMRES elapsed tim
- Page 71 and 72:
Figure 2.20: Surface response with
- Page 73 and 74:
18 16 14 12 Speedup 10 8 6 Aikten
- Page 75 and 76:
SuperLU contains a collection of th
- Page 77 and 78:
architecture. Indeed, this method p
- Page 79 and 80:
Chapter 3 Fast Parallel 3D Image-Ba
- Page 81 and 82:
and formulation of the NS problem.
- Page 83 and 84:
Considering an immersed boundary ap
- Page 85 and 86:
3.2.2 Integration of the Image Anal
- Page 87 and 88:
is much smaller than the area outsi
- Page 89 and 90:
Figure 3.3: Spatial discretization
- Page 91 and 92:
These two steps of the NS solver ha
- Page 93 and 94:
measurement. It can be noted that t
- Page 95 and 96:
Figure 3.4: Domain Decomposition wi
- Page 97 and 98:
Figure 3.5: Benchmark problem Figur
- Page 99 and 100:
8 7 6 size 150x50 size 225x75 size
- Page 101 and 102:
9 8 Speedup for a 4000x400 NS 2D pr
- Page 103 and 104:
3.4.1.2 Verification of the three d
- Page 105 and 106:
Figure 3.22: Velocity v Figure 3.23
- Page 107 and 108:
0.9 Problem of a size 100−50−50
- Page 109 and 110:
approximately by 100 step time, we
- Page 111 and 112:
3.4.4 Test cases Figure 3.35 repres
- Page 113 and 114:
Figure 3.39: Velocity inside the ca
- Page 115 and 116:
e very time-consuming. As a matter
- Page 117 and 118:
Figure 4.1: Database linked to the
- Page 119 and 120:
sensitivity studies and/or artery g
- Page 121 and 122:
5 4.5 4 3.5 Elapsed time 3 2.5 2 1.
- Page 123 and 124:
Figure 4.5: Scalability Performance
- Page 125 and 126:
Chapter 5 Conclusion This chapter s
- Page 127 and 128:
5.2 Perspectives and suggestions fo
- Page 129 and 130:
the tools needed to solve efficient
- Page 131 and 132:
[11] I. N. Bankman. Handbook of med
- Page 133 and 134:
[38] M. Gander. Optimized schwarz m
- Page 135 and 136:
[60] D. Keyes. Technologies and too
- Page 137 and 138:
[82] F. Nataf. Interface connection
- Page 139 and 140:
[105] W. Shyy. Moving boundaries in