Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Markov process”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

Low-Temperature Behavior of the Multicomponent Widom–Rowlison Model on Finite Square Lattices

We consider the multicomponent Widom–Rowlison with Metropolis dynamics, which describes the evolution of a particle system where M different types of particles interact subject to certain hard-core constraints. Focusing on the scenario where the spatial structure is modeled by finite square lattices, we study the asymptotic behavior of this interacting particle system in the low-temperature regime, analyzing the tunneling times between its M maximum-occupancy configurations, and the mixing time of the corresponding Markov chain. In particular, we develop a novel combinatorial method that, exploiting geometrical properties of the Widom–Rowlinson configurations on finite square lattices, leads to the identification of the timescale at which transitions between maximum-occupancy configurations occur and shows how this depends on the chosen boundary conditions and the square lattice dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Projections of Gibbs States for Hölder Potentials

We give a short proof that the projection of a Gibbs state for a Hölder continuous potential on a mixing shift of finite type under a 1-block fiber-wise mixing factor map has a Hölder continuous g function. This improves a number of previous results. The key insight in the proof is to realize the measure of a cylinder set in terms of positive operators and use cone techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Linear Responses for Markov Chains and Stochastically Perturbed Dynamical Systems

The linear response of a dynamical system refers to changes to properties of the system when small external perturbations are applied. We consider the little-studied question of selecting an optimal perturbation so as to (i) maximise the linear response of the equilibrium distribution of the system, (ii) maximise the linear response of the expectation of a specified observable, and (iii) maximise the linear response of the rate of convergence of the system to the equilibrium distribution. We also consider the inhomogeneous, sequential, or time-dependent situation where the governing dynamics is not stationary and one wishes to select a sequence of small perturbations so as to maximise the overall linear response at some terminal time. We develop the theory for finite-state Markov chains, provide explicit solutions for some illustrative examples, and numerically apply our theory to stochastically perturbed dynamical systems, where the Markov chain is replaced by a matrix representation of an approximate annealed transfer operator for the random dynamical system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Canonical Structure and Orthogonality of Forces and Currents in Irreversible Markov Chains

We discuss a canonical structure that provides a unifying description of dynamical large deviations for irreversible finite state Markov chains (continuous time), Onsager theory, and Macroscopic Fluctuation Theory (MFT). For Markov chains, this theory involves a non-linear relation between probability currents and their conjugate forces. Within this framework, we show how the forces can be split into two components, which are orthogonal to each other, in a generalised sense. This splitting allows a decomposition of the pathwise rate function into three terms, which have physical interpretations in terms of dissipation and convergence to equilibrium. Similar decompositions hold for rate functions at level 2 and level 2.5. These results clarify how bounds on entropy production and fluctuation theorems emerge from the underlying dynamical rules. We discuss how these results for Markov chains are related to similar structures within MFT, which describes hydrodynamic limits of such microscopic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Equilibration and Diffusion for a Dynamical Lorentz Gas

We consider a model of a dynamical Lorentz gaz: a single particle is moving in ℝ{sup d} through an array of fixed and soft scatterers each possessing an internal degree of freedom coupled to the particle. Assuming the initial velocity is sufficiently high and modelling the parameters of the scatterers as random variables, we describe the evolution of the kinetic energy of the particle by a Markov chain for which each step corresponds to a collision. We show that the momentum distribution of the particle approaches a Maxwell–Boltzmann distribution with effective temperature T such that k{sub B}T corresponds to an average of the scatterers’ kinetic energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Small-Mass Limit and White-Noise Limit of an Infinite Dimensional Generalized Langevin Equation

We study asymptotic properties of the Generalized Langevin Equation (GLE) in the presence of a wide class of external potential wells with a power-law decay memory kernel. When the memory can be expressed as a sum of exponentials, a class of Markovian systems in infinite-dimensional spaces is used to represent the GLE. The solutions are shown to converge in probability in the small-mass limit and the white-noise limit to appropriate systems under minimal assumptions, of which no global Lipschitz condition is required on the potentials. With further assumptions about space regularity and potentials, we obtain L{sup 1} convergence in the white-noise limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Perturbation Bounds for Markov Chains with General State Space

The aim of this paper is to investigate the stability of Markov chains with general state space. We present new conditions for the strong stability of Markov chains after a small perturbation of their transition kernels. Also, we obtain perturbation bounds with respect to different quantities.

97 MATHEMATICS AND COMPUTING↗

The Berry–Esseen Bound for General Markov Chains

A rate of convergence in the CLT is studied for recurrent Markov chains. The Berry–Esseen type bound is obtained with explicit dependence on parameters of the chain. The method of the proof is purely analytical. It is based on the complex analysis of generating functions.

97 MATHEMATICS AND COMPUTING↗

Stationary Distribution and Perturbation Bounds for a Stochastic Inventory Model

In this paper, we use the theory of generalized inverses to compute the stationary distribution of the (s, S) inventory model directly from the transition matrix of the underlying Markov chain and to provide perturbation bounds. Indeed, approximations are employed to build a tractable model, and statistical methods are used to estimate the unknown parameters and distributions. Hence, the system is subject to perturbations that may cause deviation in the characteristics. The proposed perturbation bound provides a means to estimate the impact of the perturbations on the performance measures of the considered inventory system.

97 MATHEMATICS AND COMPUTING↗

On the General Definition of the Production of Entropy in Open Markov Quantum Systems

We discuss the question of the general definition of the production of entropy per unit time for a quantum system governed by the Lindblad equation. The difficulty is as follows: in order to determine the total production of entropy, one must know the entropy flow from the system into the environment. This requires additional information on the environment and on its interaction with the system. The Lindblad equation for the reduced density matrix of the system does not contain such information. Therefore, the following question arises: What minimum additional information about the environment must be added to the Lindblad equation in order to find the flow of entropy into the environment and the total production of entropy? To answer this question, we use the concept of a complementary quantum channel known from the the quantum information theory. We also prove a theorem on the nonnegativity of production of entropy, and, under certain assumptions, the adiabatic and nonadiabatic contribution to it.

97 MATHEMATICS AND COMPUTING↗

Coherence and entropy squeezing in the spin-boson model under non-Markovian environment

We study the dynamical behavior of the coherence and squeezing for a two-level system immersed in an environment modeled by a spin degree of freedom in a magnetic field coupled linearly to an oscillator bath with non-Markovian environment. The dependence of the coherence and squeezing on the system and reservoir parameters shows that these quantities could be greatly controlled and manipulated with the assistance of the reservoir cutoff frequency, system oscillator frequency, and reservoir temperature. Moreover, we show that the proper choice of the external control field can make further control on the coherence and squeezing of the atomic system under the effect of environmental noises. The results show new interest features that are usefully utilized in controlling the physical quantities and show how the enhancement and preservation of coherence and squeezing can greatly benefit from the combination of the all physical parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bayesian Neural Networks for Uncertainty Analysis of Hydrologic Modeling: A Comparison of Two Schemes

Bayesian Neural Networks (BNNs) have been shown as useful tools to analyze modeling uncertainty of Neural Networks (NNs). This research focuses on the comparison of two BNNs. The first BNNs (BNN-I) use statistical methods to describe the characteristics of different uncertainty sources (input, parameter, and model structure) and integrate these uncertainties into a Markov Chain Monte Carlo (MCMC) framework to estimate total uncertainty. The second BNNs (BNN-II) lump all uncertainties into a single error term (i.e. the residual between model prediction and measurement). In this study, we propose a simple BNN-II, which use Genetic Algorithms (GA) and Bayesian Model Averaging (BMA) to calibrate Neural Networks with different structures (number of hidden units) and combine the predictions from different NNs to derive predictions and uncertainty analysis. We tested these two BNNs in two watersheds for daily and monthly hydrologic simulation. The BMA based BNNs developed in this study outperforms BNN-I in the two watersheds in terms of both accurate prediction and uncertainty estimation. These results show that, given incomplete understanding of the characteristics associated with each uncertainty source, the simple lumped error approach may yield better prediction and uncertainty estimation.

99 GENERAL AND MISCELLANEOUS↗

Observer-based H{sub ∞} control for nonlinear Markovian jump systems with time-delay and input saturation

This paper focus on the problem of observer-based H{sub ∞} control for uncertain nonlinear Markovian jump systems with time-delay and actuator saturation. A delay-dependent sufficient condition is proposed which guarantees that the uncertain nonlinear Markovian jump system with time-delay and input saturation is stochastically stable via Lyapunov theory and linear matrix inequality (LMI) approach. Then, with this condition, the estimation of stability region and the design method of observer-based H{sub ∞} controller are given by solving LMIs and convex optimization problems. Finally, numerical examples are exploited to illustrate the effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach

In this paper, we present a multi-objective solution of the Pareto front for a certain class of discrete-time ergodic controllable Markov chains. For solving the problem, we transform the original multi-objective problem into an equivalent nonlinear programming problem implementing the Lagrange principle. We then propose to adopt the Tikhonov’s regularization method to ensure the convergence of the cost functions to a unique point into the Pareto front. We show that Pareto policies are characterized as optimal policies. One of the fundamental problems related to the construction of the Pareto front is the existence and characterization of both, Pareto and strong Pareto policies. By introducing the Tikhonov’s regularizator, we ensure the existence of strong Pareto policies. This paper proposes a real solution to this problem. We formulate the original problem considering several constraints: (a) we employ the c-variable method for the introduction of linear constraints over the nonlinear problem and (b) restrict the cost functions, allowing points in the Pareto front to have a small distance from one another. The constraints imposed by the c-variable method make the problem computationally tractable and the restriction imposed by the small distance change ensures the continuation of the Pareto front. The resulting equation in this nonlinear system is an optimization problem for which the necessary and efficient condition of a minimum is solved using the projected gradient method. Moreover, we also prove the convergence conditions and compute the estimate rate of convergence of variables corresponding to the Lagrange principle and the Tikhonov’s regularization, respectively. We provide all the details needed to implement the proposed method in an efficient way. The usefulness of the method is successfully demonstrated by a numerical example.

97 MATHEMATICS AND COMPUTING↗

A front-fixing finite element method for pricing American options under regime-switching jump-diffusion models

A front-fixing finite element method is applied to solve the partial integro-differential equations (PIDEs) arising in pricing American options under Markov-modulated jump-diffusion models with the free boundaries feature. For this purpose, we used a front-fixing method to transform the pricing problem into a nonlinear parabolic integro-differential equation on a fixed domain. Then the variational form of the resulting problem is solved by a finite element method. Under some appropriate assumptions, we establish the stability of the method and illustrate some numerical results to examine the rate of convergence of the proposed method for the pricing problem and compare its accuracy to some recent works on pricing American options under regime-switching jump-diffusion models.

97 MATHEMATICS AND COMPUTING↗

Reachable set bounding for a class of bidirectional associative memory NNSs with Markov jump switching parameters

This paper studies the problem how to estimate the reachable set for a class of delayed bidirectional associative memory neural network systems (NNSs), which have Markov switching parameters and unit-energy or unit-peak bounded disturbance inputs. The feature of the Markov jump bidirectional associative memory NNSs shows in the following twofold: the time delay is time varying; the transition rates is time varying. Moreover, the time-varying transition rates is piecewise constant. Using the Lyapunov functional method, delay-partitioning and linear matrix inequalities techniques, the estimate problem of the reachable set depending on time delay is solved. The effectiveness of the given results is illustrated by the proposed numerical examples.

97 MATHEMATICS AND COMPUTING↗