Some Aspects of Essentially Nonoscillatory (ENO) Formulations for the Euler Equations, Part 3

An essentially nonoscillatory (ENO) formulation is described for hyperbolic systems of conservation laws. ENO approaches are based on smart interpolation to avoid spurious numerical oscillations. ENO schemes are a superset of Total Variation Diminishing (TVD) schemes. In the recent past, TVD formulations were used to construct shock capturing finite difference methods. At extremum points of the solution, TVD schemes automatically reduce to being first-order accurate discretizations locally, while away from extrema they can be constructed to be of higher order accuracy. The new framework helps construct essentially non-oscillatory finite difference methods without recourse to local reductions of accuracy to first order. Thus arbitrarily high orders of accuracy can be obtained. The basic general ideas of the new approach can be specialized in several ways and one specific implementation is described based on: (1) the integral form of the conservation laws; (2) reconstruction based on the primitive functions; (3) extension to multiple dimensions in a tensor product fashion; and (4) Runge-Kutta time integration. The resulting method is fourth-order accurate in time and space and is applicable to uniform Cartesian grids. The construction of such schemes for scalar equations and systems in one and two space dimensions is described along with several examples which illustrate interesting aspects of the new approach

Multi-Dimensional ENO Schemes for General Geometries

A class of ENO schemes is presented for the numerical solution of multidimensional hyperbolic systems of conservation laws in structured and unstructured grids. This is a class of shock-capturing schemes which are designed to compute cell-averages to high order accuracy. The ENO scheme is composed of a piecewise-polynomial reconstruction of the solution form its given cell-averages, approximate evolution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is based on an adaptive selection of stencil for each cell so as to avoid spurious oscillations near discontinuities while achieving high order of accuracy away from them

A user guide for the EMTAC-MZ CFD code

The computer code (EMTAC-MZ) was applied to investigate the flow field over a variety of very complex three-dimensional (3-D) configurations across the Mach number range (subsonic, transonic, supersonic, and hypersonic flow). In the code, a finite volume, multizone implementation of high accuracy, total variation diminishing (TVD) formulation (based on Roe's scheme) is used to solve the unsteady Euler equations. In the supersonic regions of the flow, an infinitely large time step and a space-marching scheme is employed. A finite time step and a relaxation or 3-D approximate factorization method is used in subsonic flow regions. The multizone technique allows very complicated configurations to be modeled without geometry modifications, and can easily handle combined internal and external flow problems. An elliptic grid generation package is built into the EMTAC-MZ code. To generate the computational grid, only the surface geometry data are required. Results obtained for a variety of configurations, such as fighter-like configurations (F-14, AVSTOL), flow through inlet, multi-bodies (shuttle with external tank and SRBs), are reported and shown to be in good agreement with available experimental data

How to Increase the Ability of a Student to Learn

An instructor is always challenged when covering the materials in a course (according to the syllabus) and at the same time making sure that all students have the opportunity to learn and understand the materials presented in the classroom. In this paper we will present some ideas and tools that enable one to try to achieve a balance. These are based on the author’s experience and perspective in teaching deterministic and stochastic operations research courses

Queueing Models with MAP Arrivals Useful in Service Sectors

Queueing models have found applications in many fields, notably in service sectors. In this paper, we study queueing models that have significant applications in service sectors. We look at multi-server systems with MAP arrivals. We assume phase type services for single server systems and exponential services when dealing with multi-server systems. All arriving customers finding no idle server will not wait in the system to receive services but rather leave their information in a registry list. These customers will be reached out on a first-come-first-served basis (FCFS) by an idle server soon after completing its current service. The reach out time is assumed to be exponential and at the end of this time, with a certain probability the reached out customer is available for service; with complementary probability the customer is not reachable due to various reasons including the customer not picking up the call from the service system to receive a service. In the case when the reach out is unsuccessful, the server will remain idle should there be no customer in the registry list. However, if there is at least one customer in the registry, then the server will start another reach out. The classical approach using matrix-analytic methods is employed and discuss a few illustrative examples that bring out the qualitative nature of the models in steady-state. When dealing with MAP/G/c queues we resort to simulation and present a few examples. Some concluding remarks including a few extensions to the models studied here are presented

Analysis of a multi-server queueing model with vacations and optional secondary services

In this paper we study a multi-server queueing model in which the customer arrive according to a Markovian arrival process. The customers may require, with a certain probability, an optional secondary service upon completion of a primary service. The secondary services are offered (in batches of varying size) when any of the following conditions holds good: (a) upon completion of a service a free server finds no primary customer waiting in the queue and there is at least one secondary customer (including possibly the primary customer becoming a secondary customer) waiting for service; (b) upon completion of a primary service, the customer requires a secondary service and at that time the number of customers needing a secondary service hits a pre-determined threshold value; (c) a server returning from a vacation finds no primary customer but at least one secondary customer waiting. The servers take vacation when there are no customers (either primary or secondary) waiting to receive service. The model is studied as a QBD-process using matrix-analytic methods and some illustrative examples arediscussed

A Retrial Queueing Model With Thresholds and Phase Type Retrial Times

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method

Analysis of a Queueing Model with MAP Arrivals and Heterogeneous Phase-Type Group Services

Queueing models have proven to be very useful in real-life applications to enable the practitioners to optimize the limited resources to conduct their businesses as well as offer services efficiently. In general, we can group such applications into two sectors: manufacturing and service. These two sectors cover everything we deal with on a day-to-day basis. Queues in which the services are offered in blocks (or groups or batches) are well established in the literature and have a wide variety of applications in practice. In this paper, we look at one such queueing model in which the arrivals occur according to a Markovian arrival process and the services are offered in batches of varying sizes from 1 to a finite pre-determined constant, say, b. The service times are assumed to be of phase type with representation depending on the size of the group. Thus, the distributions considered are heterogeneous from both the representation and rate points of view. The model can be studied as a G I/M/1-type queue or as a QBD-model. The model is analyzed in steady state by establishing results including on the rate matrix and the waiting time distribution and providing a number of illustrative examples

Analysis of a k-out-of-N System with Spares, Repairs, and a Probabilistic Rule

We consider a k-out-of-N reliability system with identical components having exponential lifetimes. There is a single repairman who attends to failed components on a first comefirst-served basis. The repair times are assumed to be of phase type. The system has K spares that can be used according to a probabilistic rule to extend the lifetime of the system. The system is analyzed using Markov chain theory and some interesting results are obtained. A few illustrative numerical examples are discussed

Uniformly high order accurate essentially non-oscillatory schemes 3

In this paper (a third in a series) the construction and the analysis of essentially non-oscillatory shock capturing methods for the approximation of hyperbolic conservation laws are presented. Also presented is a hierarchy of high order accurate schemes which generalizes Godunov's scheme and its second order accurate MUSCL extension to arbitrary order of accuracy. The design involves an essentially non-oscillatory piecewise polynomial reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is derived from a new interpolation technique that when applied to piecewise smooth data gives high-order accuracy whenever the function is smooth but avoids a Gibbs phenomenon at discontinuities. Unlike standard finite difference methods this procedure uses an adaptive stencil of grid points and consequently the resulting schemes are highly nonlinear