We explore in this chapter questions of existence and uniqueness for solutions to stochastic differential equations and offer a study of their properties. This endeavor is really a study of diffusion processes. Loosely speaking, the term diffusion is attributed to a Markov process which has continuous sample paths and can be characterized in terms of its infinitesimal generator.

Stochastic Differential Equations

Differential-Difference Equations. By Richard Bellman and Kenneth L. Cooke. Pp. xvi, 465. 1963. (Academic Press)

Numerical simulation of large-scale dynamical systems plays a fundamental role in studying a wide range of complex physical phenomena; however, the inherent large-scale nature of the models often leads to unmanageable demands on computational resources. Model reduction aims to reduce this computational burden by generating reduced models that are faster and cheaper to simulate, yet accurately represent the original large-scale system behavior. Model reduction of linear, nonparametric dynamical systems has reached a considerable level of maturity, as reflected by several survey papers and books. However, parametric model reduction has emerged only more recently as an important and vibrant research area, with several recent advances making a survey paper timely. Thus, this paper aims to provide a resource that draws together recent contributions in different communities to survey the state of the art in parametric model reduction methods. Parametric model reduction targets the broad class of problems for wh...

/pdf/a-survey-of-projection-based-model-reduction-methods-for-3yjqbxk305.pdf

A Survey of Projection-Based Model Reduction Methods for Parametric Dynamical Systems

In this paper, we present two novel algorithms to realize a finite dimensional, linear time-invariant state-space model from input-output data. The algorithms have a number of common features. They are classified as one of the subspace model identification schemes, in that a major part of the identification problem consists of calculating specially structured subspaces of spaces defined by the input-output data. This structure is then exploited in the calculation of a realization. Another common feature is their algorithmic organization: an RQ factorization followed by a singular value decomposition and the solution of an overdetermined set (or sets) of equations. The schemes assume that the underlying system has an output-error structure and that a measurable input sequence is available. The latter characteristic indicates that both schemes are versions of the MIMO Output-Error State Space model identification (MOESP) approach. The first algorithm is denoted in particular as the (elementary MOESP scheme)...

Subspace model identification-Part 1. The output-error state-space model identification class of algorithms

Given the square matrices $A, B, D, E$ and the matrix $C$ of conforming dimensions, we consider the linear matrix equation $A{\mathbf X} E+D{\mathbf X} B = C$ in the unknown matrix ${\mathbf X}$. Our aim is to provide an overview of the major algorithmic developments that have taken place over the past few decades in the numerical solution of this and related problems, which are producing reliable numerical tools in the formulation and solution of advanced mathematical models in engineering and scientific computing.

/pdf/computational-methods-for-linear-matrix-equations-29c8rmvfvt.pdf

Computational Methods for Linear Matrix Equations

We discuss the relation of a certain type of generalized Lyapunov equations to Gramians of stochastic and bilinear systems together with the corresponding energy functionals. While Gramians and energy functionals of stochastic linear systems show a strong correspondence to the analogous objects for deterministic linear systems, the relation of Gramians and energy functionals for bilinear systems is less obvious. We discuss results from the literature for the latter problem and provide new characterizations of input and output energies of bilinear systems in terms of algebraic Gramians satisfying generalized Lyapunov equations. In any of the considered cases, the definition of algebraic Gramians allows us to compute balancing transformations and implies model reduction methods analogous to balanced truncation for linear deterministic systems. We illustrate the performance of these model reduction methods by showing numerical experiments for different bilinear systems.

/pdf/lyapunov-equations-energy-functionals-and-model-order-3sz1dd9yv8.pdf

Lyapunov Equations, Energy Functionals, and Model Order Reduction of Bilinear and Stochastic Systems

Introduction.- Aspects of stochastic control theory.- Optimal stabilization of linear stochastic systems.- Linear mappings on ordered vector spaces.- Newtons method.- Solution of the Riccati equation.

Rational Matrix Equations in Stochastic Control

Krylov Subspace Methods for Model Order Reduction of Bilinear Control Systems

We investigate the exponential turnpike property for finite horizon undiscounted discrete time optimal control problems without any terminal constraints. Considering a class of strictly dissipative systems, we derive a boundedness condition for an auxiliary optimal value function which implies the exponential turnpike property. Two theorems illustrate how this boundedness condition can be concluded from structural properties like controllability and stabilizability of the control system under consideration.

/pdf/an-exponential-turnpike-theorem-for-dissipative-discrete-50gez5z9eq.pdf

An exponential turnpike theorem for dissipative discrete time optimal control problems

We consider linear matrix equations where the linear mapping is the sum of a standard Lyapunov operator and a positive operator. These equations play a role in the context of stochastic or bilinear control systems. To solve them efficiently one can fall back on known efficient methods developed for standard Lyapunov equations. In this paper, we describe a direct and an iterative method based on this idea. The direct method is applicable if the generalized Lyapunov operator is a low-rank perturbation of a standard Lyapunov operator; it is related to the Sherman–Morrison–Woodbury formula. The iterative method requires a stability assumption; it uses convergent regular splittings, an alternate direction implicit iteration as preconditioner, and Krylov subspace methods. Copyright © 2008 John Wiley & Sons, Ltd.

Tobias Damm

Papers

Lyapunov Equations, Energy Functionals, and Model Order Reduction of Bilinear and Stochastic Systems

Rational Matrix Equations in Stochastic Control

Krylov Subspace Methods for Model Order Reduction of Bilinear Control Systems

An exponential turnpike theorem for dissipative discrete time optimal control problems

Direct methods and ADI‐preconditioned Krylov subspace methods for generalized Lyapunov equations