Computational Aspects of Submarine Slide Generated Tsunami

Article Preview

Abstract:

Submarine landslide is the most serious threat on both local and regional scales. Tsunami phenomenon induced by submarine slide has put us on the challenge in understanding from generation mechanism to propagation and coastal inundation and mitigating the risk from submarine slide generated tsunami. This research presents the numerical simulation methodology by Smooth Particle Hydrodynamics (SPH) to investigate the impact forces of tsunami waves with the aid of physical modeling. By using parallelSPHysics, it is a source code based on the SPH method to model nearly‐incompressible flows, including various physical processes. The conclusions may potentially be taken as guideline of mitigate the risk from tsunami wave.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

216-221

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] B. Ataie-Ashtiani, G. Shobeyri, Numerical simulation of landslide impulsive waves by incompressible smoothed particle hydrodynamics, Int. J. Numer. Meth. Fluids 56: 209–232, (2008).

DOI: 10.1002/fld.1526

Google Scholar

[2] S. Shao, D. I. Graham, C. Ji, D. E. Reeve, P. W. James, and A. J. Chadwick, Simulation of wave overtopping by an incompressible SPH model, Coastal Engineering, Vol. 53, No. 9, pp.723-735, (2009).

DOI: 10.1016/j.coastaleng.2006.02.005

Google Scholar

[3] J.M. Cherfils, G. Pinona, E. Rivoalena, A parallel SPH code for free-surface flows, Computer Physics Communications 183 1468–1480, (2012).

DOI: 10.1016/j.cpc.2012.02.007

Google Scholar

[4] A. Mahantia, D.L. Eagerb, Adaptive data parallel computing on workstation clusters, Journal of parallel and distributed computing 64, 1241 – 1255, (2004).

DOI: 10.1016/j.jpdc.2004.07.005

Google Scholar

[5] A. Migdalas, G. Toraldo, V. Kumar, Nonlinear optimization and parallel computing, Parallel Computing 29, 375–391, (2003).

DOI: 10.1016/s0167-8191(03)00013-9

Google Scholar

[6] N. Tremblay, M. Florian, Temporal shortest paths: parallel computing implementations, Parallel computing 27, 1569 – 1609, (2001).

DOI: 10.1016/s0167-8191(01)00107-7

Google Scholar

[7] M. Cannataro, D. Talia, P.K. Srimani, Parallel data intensive computing in scientific and commercial applications, parallel Computing 28, 673–704, (2002).

DOI: 10.1016/s0167-8191(02)00091-1

Google Scholar