Finite volume evolution Galerkin method for hyperbolic conservation laws with spatially varying flux functions

We present a generalization of the finite volume evolution Galerkin scheme [M. Lukacova-Medvid'ova,J. Saibertov'a, G. Warnecke, Finite volume evolution Galerkin methods for nonlinear hyperbolic systems, J. Comp. Phys. (2002) 183 533-562; M. Luacova-Medvid'ova, K.W. Morton, G. Warnecke, Finite volume evolution Galerkin (FVEG) methods for hyperbolic problems, SIAM J. Sci. Comput. (2004) 26 1-30] for hyperbolic systems with spatially varying flux functions. Our goal is to develop a genuinely multi-dimensional numerical scheme for wave propagation problems in a heterogeneous media. We illustrate our methodology for acoustic waves in a heterogeneous medium but the results can be generalized to more complex systems. The finite volume evolution Galerkin (FVEG) method is a predictor-corrector method combining the finite volume corrector step with the evolutionary predictor step. In order to evolve fluxes along the cell interfaces we use multi-dimensional approximate evolution operator. The latter is constructed using the theory of bicharacteristics under the assumption of spatially dependent wave speeds. To approximate heterogeneous medium a staggered grid approach is used. Several numerical experiments for wave propagation with continuous as well as discontinuous wave speeds confirm the robustness and reliability of the new FVEG scheme.

Fatigue Laws Via Functional Equations

In routine industrial design, fatigue life estimation is largely based on S-N curves and ad hoc cycle counting algorithms used with Miner's rule for predicting life under complex loading. However, there are well known deficiencies of the conventional approach. Of the many cumulative damage rules that have been proposed, Manson's Double Linear Damage Rule (DLDR) has been the most successful. Here we follow up, through comparisons with experimental data from many sources, on a new approach to empirical fatigue life estimation (A Constructive Empirical Theory for Metal Fatigue Under Block Cyclic Loading', Proceedings of the Royal Society A, in press). The basic modeling approach is first described: it depends on enforcing mathematical consistency between predictions of simple empirical models that include indeterminate functional forms, and published fatigue data from handbooks. This consistency is enforced through setting up and (with luck) solving a functional equation with three independent variables and six unknown functions. The model, after eliminating or identifying various parameters, retains three fitted parameters; for the experimental data available, one of these may be set to zero. On comparison against data from several different sources, with two fitted parameters, we find that our model works about as well as the DLDR and much better than Miner's rule. We finally discuss some ways in which the model might be used, beyond the scope of the DLDR.

3-D kinematical conservation laws (KCL): Evolution of a surface in R-3 - in particular propagation of a nonlinear wavefront

3-D KCL are equations of evolution of a propagating surface (or a wavefront) Omega(t), in 3-space dimensions and were first derived by Giles, Prasad and Ravindran in 1995 assuming the motion of the surface to be isotropic. Here we discuss various properties of these 3-D KCL.These are the most general equations in conservation form, governing the evolution of Omega(t) with singularities which we call kinks and which are curves across which the normal n to Omega(t) and amplitude won Omega(t) are discontinuous. From KCL we derive a system of six differential equations and show that the KCL system is equivalent to the ray equations of 2, The six independent equations and an energy transport equation (for small amplitude waves in a polytropic gas) involving an amplitude w (which is related to the normal velocity m of Omega(t)) form a completely determined system of seven equations. We have determined eigenvalues of the system by a very novel method and find that the system has two distinct nonzero eigenvalues and five zero eigenvalues and the dimension of the eigenspace associated with the multiple eigenvalue 0 is only 4. For an appropriately defined m, the two nonzero eigenvalues are real when m > 1 and pure imaginary when m < 1. Finally we give some examples of evolution of weakly nonlinear wavefronts.

Learning Optimal Discriminant Functions through a Cooperative Game of Automata

The problem of learning correct decision rules to minimize the probability of misclassification is a long-standing problem of supervised learning in pattern recognition. The problem of learning such optimal discriminant functions is considered for the class of problems where the statistical properties of the pattern classes are completely unknown. The problem is posed as a game with common payoff played by a team of mutually cooperating learning automata. This essentially results in a probabilistic search through the space of classifiers. The approach is inherently capable of learning discriminant functions that are nonlinear in their parameters also. A learning algorithm is presented for the team and convergence is established. It is proved that the team can obtain the optimal classifier to an arbitrary approximation. Simulation results with a few examples are presented where the team learns the optimal classifier.

A cooperative game of a pair of learning automata

A cooperative game played in a sequential manner by a pair of learning automata is investigated in this paper. The automata operate in an unknown random environment which gives a common pay-off to the automata. Necessary and sufficient conditions on the functions in the reinforcement scheme are given for absolute monotonicity which enables the expected pay-off to be monotonically increasing in any arbitrary environment. As each participating automaton operates with no information regarding the other partner, the results of the paper are relevant to decentralized control.

Location of Pathogenic Bacteria during Persistent Infections: Insights from an Analysis Using Game Theory

Bacterial persistent infections are responsible for a significant amount of the human morbidity and mortality. Unlike acute bacterial infections, it is very difficult to treat persistent bacterial infections (e.g. tuberculosis). Knowledge about the location of pathogenic bacteria during persistent infection will help to treat such conditions by designing novel drugs which can reach such locations. In this study, events of bacterial persistent infections were analyzed using game theory. A game was defined where the pathogen and the host are the two players with a conflict of interest. Criteria for the establishment of Nash equilibrium were calculated for this game. This theoretical model, which is very simple and heuristic, predicts that during persistent infections pathogenic bacteria stay in both intracellular and extracellular compartments of the host. The result of this study implies that a bacterium should be able to survive in both intracellular and extracellular compartments of the host in order to cause persistent infections. This explains why persistent infections are more often caused by intracellular pathogens like Mycobacterium and Salmonella. Moreover, this prediction is in consistence with the results of previous experimental studies.

A cooperative game theoretic approach to prototype selection

In this paper we consider the task of prototype selection whose primary goal is to reduce the storage and computational requirements of the Nearest Neighbor classifier while achieving better classification accuracies. We propose a solution to the prototype selection problem using techniques from cooperative game theory and show its efficacy experimentally.

Composite scheme using localized relaxation with non-standard finite difference method for hyperbolic conservation laws

Non-standard finite difference methods (NSFDM) introduced by Mickens [Non-standard Finite Difference Models of Differential Equations, World Scientific, Singapore, 1994] are interesting alternatives to the traditional finite difference and finite volume methods. When applied to linear hyperbolic conservation laws, these methods reproduce exact solutions. In this paper, the NSFDM is first extended to hyperbolic systems of conservation laws, by a novel utilization of the decoupled equations using characteristic variables. In the second part of this paper, the NSFDM is studied for its efficacy in application to nonlinear scalar hyperbolic conservation laws. The original NSFDMs introduced by Mickens (1994) were not in conservation form, which is an important feature in capturing discontinuities at the right locations. Mickens [Construction and analysis of a non-standard finite difference scheme for the Burgers–Fisher equations, Journal of Sound and Vibration 257 (4) (2002) 791–797] recently introduced a NSFDM in conservative form. This method captures the shock waves exactly, without any numerical dissipation. In this paper, this algorithm is tested for the case of expansion waves with sonic points and is found to generate unphysical expansion shocks. As a remedy to this defect, we use the strategy of composite schemes [R. Liska, B. Wendroff, Composite schemes for conservation laws, SIAM Journal of Numerical Analysis 35 (6) (1998) 2250–2271] in which the accurate NSFDM is used as the basic scheme and localized relaxation NSFDM is used as the supporting scheme which acts like a filter. Relaxation schemes introduced by Jin and Xin [The relaxation schemes for systems of conservation laws in arbitrary space dimensions, Communications in Pure and Applied Mathematics 48 (1995) 235–276] are based on relaxation systems which replace the nonlinear hyperbolic conservation laws by a semi-linear system with a stiff relaxation term. The relaxation parameter (λ) is chosen locally on the three point stencil of grid which makes the proposed method more efficient. This composite scheme overcomes the problem of unphysical expansion shocks and captures the shock waves with an accuracy better than the upwind relaxation scheme, as demonstrated by the test cases, together with comparisons with popular numerical methods like Roe scheme and ENO schemes.

Experimental implementation of a three qubit quantum game with corrupt source using nuclear magnetic resonance quantum information processor

In a three player quantum `Dilemma' game each player takes independent decisions to maximize his/her individual gain. The optimal strategy in the quantum version of this game has a higher payoff compared to its classical counterpart. However, this advantage is lost if the initial qubits provided to the players are from a noisy source. We have experimentally implemented the three player quantum version of the `Dilemma' game as described by Johnson, [N.F. Johnson, Phys. Rev. A 63 (2001) 020302(R)] using nuclear magnetic resonance quantum information processor and have experimentally verified that the payoff of the quantum game for various levels of corruption matches the theoretical payoff. (c) 2007 Elsevier Inc. All rights reserved.

Performance Analysis of Guidance Laws Based on Timescale Gap

An analytical treatment of performance analysis of guidance laws is possible only in simplistic scenarios. As the complexity of the guidance system increases, a search for analytical solutions becomes quite impractical. In this paper, a new performance measure, based upon the notion of a timescale gap that can be computed through numerical simulations, is developed for performance analysis of guidance laws. Finite time Lyapunov exponents are used to define the timescale gap. It is shown that the timescale gap can be used for quantification of the rate of convergence of trajectories to the collision course. Comparisonbetween several guidance laws, based on the timescale gap, is presented. Realistic simulations to study the effect of aerodynamicsand atmospheric variations on the timescale gap of these guidance laws are also presented.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Design of incentive compatible protocols for wireless networks: A game theoretic approach

In this thesis work, we design rigorous and efficient protocols/mechanisms for different types of wireless networks using a mechanism design [1] and game theoretic approach [2]. Our work can broadly be viewed in two parts. In the first part, we concentrate on ad hoc wireless networks [3] and [4]. In particular, we consider broadcast in these networks where each node is owned by independent and selfish users. Being selfish, these nodes do not forward the broadcast packets. All existing protocols for broadcast assume that nodes forward the transit packets. So, there is need for developing new broadcast protocols to overcome node selfishness. In our paper [5], we develop a strategy proof pricing mechanism which we call immediate predecessor node pricing mechanism (IPNPM) and an efficient new broadcast protocol based on IPNPM. We show the efficacy of our proposed broadcast protocol using simulation results.

Behaviour of autonomous mobile agents using linear cyclic pursuit laws

In this paper, the behaviour of a group of autonomous mobile agents under cyclic pursuit is studied. Cyclic pursuit is a simple distributed control law, in which the agent i pursues agent i + 1 modulo n.. The equations of motion are linear, with no kinematic constraints on motion. Behaviourally, the agents are identical, but may have different controller gains. We generalize existing results in the literature and show that by selecting these gains, the behavior of the agents can be controlled. They can be made to converge at a point or be directed to move in a straight line. The invariance of the point of convergence with the sequence of pursuit is also shown.

A one point shock capturing kinetic scheme for hyperbolic conservation laws

We have presented a new low dissipative kinetic scheme based on a modified Courant Splitting of the molecular velocity through a parameter φ. Conditions for the split fluxes derived based on equilibrium determine φ for a one point shock. It turns out that φ is a function of the Left and Right states to the shock and that these states should satisfy the Rankine-Hugoniot Jump condition. Hence φ is utilized in regions where the gradients are sufficiently high, and is switched to unity in smooth regions. Numerical results confirm a discrete shock structure with a single interior point when the shock is aligned with the grid.

An Application of 3-D Kinematical Conservation Laws: Propagation of a 3-D Wavefront

Three-dimensional (3-D) kinematical conservation laws (KCL) are equations of evolution of a propagating surface Omega(t) in three space dimensions. We start with a brief review of the 3-D KCL system and mention some of its properties relevant to this paper. The 3-D KCL, a system of six conservation laws, is an underdetermined system to which we add an energy transport equation for a small amplitude 3-D nonlinear wavefront propagating in a polytropic gas in a uniform state and at rest. We call the enlarged system of 3-D KCL with the energy transport equation equations of weakly nonlinear ray theory (WNLRT). We highlight some interesting properties of the eigenstructure of the equations of WNLRT, but the main aim of this paper is to test the numerical efficacy of this system of seven conservation laws. We take several initial shapes for a nonlinear wavefront with a suitable amplitude distribution on it and let it evolve according to the 3-D WNLRT. The 3-D WNLRT is a weakly hyperbolic 7 x 7 system that is highly nonlinear. Here we use the staggered Lax-Friedrichs and Nessyahu-Tadmor central schemes and have obtained some very interesting shapes of the wavefronts. We find the 3-D KCL to be suitable for solving many complex problems for which there presently seems to be no other method capable of giving such physically realistic features.