Numerical modelling and observations of nuclear-explosion coda wavefields

Frequency-dependent earthquake coda attenuation values are often reported; however such measurements usually depend on the types of the attenuation models employed. In this thesis, I use numerical modeling of Peaceful Nuclear Explosion (PNE) codas at far regional to teleseismic distances to compare two of such models, namely the conventional frequency-dependent attenuation with parameters (Q0, ¦Ç) defined by Qcoda(f) = Q0f¦Ç and frequency-independent effective attenuation (Qe) with geometrical attenuation (¦Ã). The results favour strongly the (¦Ã, Qe) model and illustrate the mechanisms leading to apparent Qcoda(f) dependencies. Tests for variations of the crustal velocity structures show that the values of ¦Ã are stable and related to lithospheric structural types, and the inverted Qe values can be systematically mapped into the true Swave attenuation factors within the crust. Modeling also shows that ¦Ã could increase in areas where relatively thin attenuating layers are present within the crust; such areas could likely be related to younger and active tectonics. By contrast, when interpreted by using the traditional (Q0,¦Ç) approach, the synthetic coda shows a strong and spurious frequency dependence with ¦Ç ¡Ö 0.5, which is also similar to many published observations. Observed Lg codas from two Peaceful Nuclear Explosions located in different areas in Russia show similar values of ¦Ã ¡Ö 0.75¡¤10-2 s-1, which are also remarkably close to the independent numerical predictions in this thesis. At the same time, coda Qe values vary strongly, from 850 in the East European Platform to 2500 within the Siberian Craton. This suggests that parameters ¦Ã and Qe could provide stable and transportable discriminants for differentiating between the lithospheric tectonic types and ages, and also for seismic coda regionalization in nuclear-test monitoring research

Computational Aerodynamics on unstructed meshes

New 2D and 3D unstructured-grid based flow solvers have been developed for simulating steady compressible flows for aerodynamic applications. The codes employ the full compressible Euler/Navier-Stokes equations. The Spalart-Al Imaras one equation turbulence model is used to model turbulence effects of flows. The spatial discretisation has been obtained using a cell-centred finite volume scheme on unstructured-grids, consisting of triangles in 2D and of tetrahedral and prismatic elements in 3D. The temporal discretisation has been obtained with an explicit multistage Runge-Kutta scheme. An "inflation" mesh generation technique is introduced to effectively reduce the difficulty in generating highly stretched 2D/3D viscous grids in regions near solid surfaces. The explicit flow method is accelerated by the use of a multigrid method with consideration of the high grid aspect ratio in viscous flow simulations. A solution mesh adaptation technique is incorporated to improve the overall accuracy of the 2D inviscid and viscous flow solutions. The 3D flow solvers are parallelised in a MIMD fashion aimed at a PC cluster system to reduce the computing time for aerodynamic applications. The numerical methods are first applied to several 2D inviscid flow cases, including subsonic flow in a bump channel, transonic flow around a NACA0012 airfoil and transonic flow around the RAE 2822 airfoil to validate the numerical algorithms. The rest of the 2D case studies concentrate on viscous flow simulations including laminar/turbulent flow over a flat plate, transonic turbulent flow over the RAE 2822 airfoil, and low speed turbulent flows in a turbine cascade with massive separations. The results are compared to experimental data to assess the accuracy of the method. The over resolved problem with mesh adaptation on viscous flow simulations is addressed with a two phase mesh reconstruction procedure. The solution convergence rate with the aspect ratio adaptive multigrid method and the direct connectivity based multigrid is assessed in several viscous turbulent flow simulations. Several 3D test cases are presented to validate the numerical algorithms for solving Euler/Navier-Stokes equations. Inviscid flow around the M6 wing airfoil is simulated on the tetrahedron based 3D flow solver with an upwind scheme and spatial second order finite volume method. The efficiency of the multigrid for inviscid flow simulations is examined. The efficiency of the parallelised 3D flow solver and the PC cluster system is assessed with simulations of the same case with different partitioning schemes. The present parallelised 3D flow solvers on the PC cluster system show satisfactory parallel computing performance. Turbulent flows over a flat plate are simulated with the tetrahedron based and prismatic based flow solver to validate the viscous term treatment. Next, simulation of turbulent flow over the M6 wing is carried out with the parallelised 3D flow solvers to demonstrate the overall accuracy of the algorithms and the efficiency of the multigrid method. The results show very good agreement with experimental data. A highly stretched and well-formed computational grid near the solid wall and wake regions is generated with the "inflation" method. The aspect ratio adaptive multigrid displayed a good acceleration rate. Finally, low speed flow around the NREL Phase 11 Wind turbine is simulated and the results are compared to the experimental data

The new computer program for three dimensional relativistic hydrodynamical model

An effective computer program for three dimensional relativistic hydrodynamical model has been developed. It implements a new approach to the early hot phase of relativistic heavy-ion collisions. The computer program simulates time-space evolution of nuclear matter in terms of ideal-fluid dynamics. Equations of motions of hydrodynamics are solved making use of finite difference methods. Commonly-used algorithms of numerical relativistic hydrodynamics RHLLE and MUSTA-FORCE have been applied in simulations. To speed-up calculations, parallel processing has been made available for solving hydrodynamical equations. The test results of simulations for 3D, 2D and Bjorken expansion are reported in this paper. As a next step we plan to implement the hadronization algorithm by implementing the continuous particle emission for freeze-out and comparing it with Cooper-Frye formula.Comment: Quark Matter 2005 Poster Session Proceedin

Mathematical and numerical modelling of dispersive water waves

Fecha de lectura de Tesis: 4 diciembre 2018.En esta tesis doctoral se expone en primer lugar una visión general del modelado de ondas dispersivas para la simulación de procesos tsunami-génicos. Se deduce un nuevo sistema bicapa con propiedades de dispersión mejoradas y un nuevo sistema hiperbólico. Además se estudian sus respectivas propiedades dispersivas, estructura espectral y ciertas soluciones analíticas. Así mismo, se ha diseñado un nuevo modelo de viscosidad sencillo para la simulación de los fenómenos físicos relacionados con la ruptura de olas en costa. Se establecen los resultados teóricos requeridos para el diseño de esquemas numéricos de tipo volúmenes finitos y Galerkin discontinuo de alto orden bien equilibrados para sistemas hiperbólicos no conservativos en una y dos dimensiones. Más adelante, los esquemas numéricos propuestos para los sistemas de presión no hidrostática introducidos se describen. Se pueden destacar diferentes enfoques y estrategias. Por un lado, se diseñan esquemas de volúmenes finitos implícitos de tipo proyección-corrección en mallas decaladas y no decaladas. Por otro lado, se propone un esquema numérico de tipo Galerkin discontinuo explícito para el nuevo sistema de EDPs hiperbólico propuesto. Para permitir simulaciones en tiempo real, una implementación eficiente en GPU de los métodos es llevado a cabo y algunas directrices sobre su implementación son dados. Los esquemas numéricos antes mencionados se han aplicado a test de referencia académicos y a situaciones físicas más desafiantes como la simulación de tsunamis reales, y la comparación con datos de campo. Finalmente, un último capítulo es dedicado a medir la influencia al considerar efectos dispersivos en la simulación de transporte y arrastre de sedimentos. Para ello, se deduce un nuevo sistema de dos capas de aguas someras, se diseña un esquema numérico y se muestran algunos test académicos y de validación, que ofrecen resultados prometedores

Virtual Central Control.

A distributed system is a set of cooperating computers (processes) communicating with each other to achieve a common goal. They are broadly classified as centralized and decentralised systems. In a centralized system, a single computer plays the role of central coordinator and controls all the system activities. Whereas in a decentralized system, all the cooperating processes have an equal role to play, therefore solutions to problems involve instructing all the processes and coordinating their actions. Although a centralized system facilitates program development, it has serious drawbacks. If the coordinator fails, the system effectively breaks down. Also, the coordinator can become a performance bottleneck. On the other hand, a decentralized system does not suffer from these shortcomings, but program development is more difficult. In this research, we develop a paradigm for a distributed system that provides the view of a centralized system even though the underlying system is decentralized. Special processes called agents reside on all participating computers. One of the agents acts as a leader and coordinates activities of other agents. Agents communicate through a fault-tolerant agent-to-agent protocol. The paradigm defines a one-shot computation, a construct that enables the expression of programs in a simulated centralized environment, thus making program development easier. Programs, written in terms of one-shot computations that are encapsulated in templates which hide all the lower level details from the programmer. We show that every computation can be expressed as a one-shot computation. The proposed paradigm has a high degree of fault-tolerance. It tolerates up to $n-1$ failures in a system of n processors. A prototype has been implemented using PVM