Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic System”

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 199 records · Page 11

Quadratic partial eigenvalue assignment in large-scale stochastic dynamic systems for resilient and economic design

Failure of structural systems under dynamic loading can be prevented via active vibration control which shifts the damped natural frequencies of the systems away from the dominant range of loading spectrum. The damped natural frequencies and the dynamic load typically show significant variations in practice. A computationally efficient methodology based on quadratic partial eigenvalue assignment technique and optimization under uncertainty has been formulated in the present work that will rigorously account for these variations and result in an economic and resilient design of structures. A novel scheme based on hierarchical clustering and importance sampling is also developed in this work for accurate and efficient estimation of probability of failure to guarantee the desired resilience level of the designed system. Numerical examples are presented to illustrate the proposed methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamics of the stochastic Lorenz chaotic system with long memory effects

Little seems to be known about the ergodic dynamics of stochastic systems with fractional noise. This paper is devoted to discern such long time dynamics through the stochastic Lorenz chaotic system (SLCS) with long memory effects. By a truncation technique, the SLCS is proved to generate a continuous stochastic dynamical system Λ. Based on the Krylov-Bogoliubov criterion, the required Lyapunov function is further established to ensure the existence of the invariant measure of Λ. Meanwhile, the uniqueness of the invariant measure of Λ is proved by examining the strong Feller property, together with an irreducibility argument. Therefore, the SLCS has exactly one adapted stationary solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid state-space self-tuning control using dual-rate sampling

This paper presents a hybrid state-space self-tuning control scheme using dual-rate sampling for suboptimal digital adaptive control of linear time-invariant continuous-time multivariable stochastic systems with unknown parameters. An equivalent fast-rate discrete-time state-space innovation model (with estimated states) of the continuous-time system is constructed by using the estimated system parameters and Kalman gain. To utilize the existing optimal regional-pole assignment method developed in the continuous-time domain, the constructed fast-rate discrete-time model is converted into an equivalent continuous-time model for the development of a state-feedback optimal control law with pole placement in a specific region. The developed analog optimal control law is then converted into an equivalent pseudo-slow-rate digital control law via the proposed digital redesign technique, which can be realized via slow-rate digital electronics. The proposed method enables the development of a digitally implementable advanced control algorithm for digital adaptive control of continuous-time multivariable stochastic systems which may be unstable and/or have nonminimum phase.

Shieh, Leang S.↗

Variance reduction through robust design of boundary conditions for stochastic hyperbolic systems of equations

We consider a hyperbolic system with uncertainty in the boundary and initial data. Our aim is to show that different boundary conditions give different convergence rates of the variance of the solution. This means that we can with the same knowledge of data get a more or less accurate description of the uncertainty in the solution. A variety of boundary conditions are compared and both analytical and numerical estimates of the variance of the solution are presented. As an application, we study the effect of this technique on Maxwell's equations as well as on a subsonic outflow boundary for the Euler equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A tightly-coupled domain-decomposition approach for highly nonlinear stochastic multiphysics systems

Multiphysics simulations often involve nonlinear components that are driven by internally generated or externally imposed random fluctuations. When used with a domain-decomposition (DD) algorithm, such components have to be coupled in a way that both accurately propagates the noise between the subdomains and lends itself to a stable and cost-effective temporal integration. We develop a conservative DD approach in which tight coupling is obtained by using a Jacobian-free Newton–Krylov (JfNK) method with a generalized minimum residual iterative linear solver. This strategy is tested on a coupled nonlinear diffusion system forced by a truncated Gaussian noise at the boundary. Enforcement of path-wise continuity of the state variable and its flux, as opposed to continuity in the mean, at interfaces between subdomains enables the DD algorithm to correctly propagate boundary fluctuations throughout the computational domain. Reliance on a single Newton iteration (explicit coupling), rather than on the fully converged JfNK (implicit) coupling, may increase the solution error by an order of magnitude. Increase in communication frequency between the DD components reduces the explicit coupling's error, but makes it less efficient than the implicit coupling at comparable error levels for all noise strengths considered. Finally, the DD algorithm with the implicit JfNK coupling resolves temporally-correlated fluctuations of the boundary noise when the correlation time of the latter exceeds some multiple of an appropriately defined characteristic diffusion time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Conservative tightly-coupled simulations of stochastic multiscale systems

Multiphysics problems often involve components whose macroscopic dynamics is driven by microscopic random fluctuations. The fidelity of simulations of such systems depends on their ability to propagate these random fluctuations throughout a computational domain, including subdomains represented by deterministic solvers. When the constituent processes take place in nonoverlapping subdomains, system behavior can be modeled via a domain-decomposition approach that couples separate components at the interfaces between these subdomains. Its coupling algorithm has to maintain a stable and efficient numerical time integration even at high noise strength. We propose a conservative domain-decomposition algorithm in which tight coupling is achieved by employing either Picard's or Newton's iterative method. Coupled diffusion equations, one of which has a Gaussian white-noise source term, provide a computational testbed for analysis of these two coupling strategies. Fully-converged (“implicit”) coupling with Newton's method typically outperforms its Picard counterpart, especially at high noise levels. This is because the number of Newton iterations scales linearly with the amplitude of the Gaussian noise, while the number of Picard iterations can scale superlinearly. At large time intervals between two subsequent inter-solver communications, the solution error for single-iteration (“explicit”) Picard's coupling can be several orders of magnitude higher than that for implicit coupling. Increasing the explicit coupling's communication frequency reduces this difference, but the resulting increase in computational cost can make it less efficient than implicit coupling at similar levels of solution error, depending on the communication frequency of the latter and the noise strength. This trend carries over into higher dimensions, although at high noise strength explicit coupling may be the only computationally viable option.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Realization of consensus of multi-agent systems with stochastically mixed interactions

In this paper, we propose a new consensus model in which the interactions among agents stochastically switch between attraction and repulsion. Such a positive-and-negative mechanism is described by the white-noise-based coupling. Analytic criteria for the consensus and non-consensus in terms of the eigenvalues of the noise intensity matrix are derived, which provide a better understanding of the constructive roles of random interactions. Specifically, we discover a positive role of noise coupling that noise can accelerate the emergence of consensus. We find that the converging speed of the multi-agent network depends on the square of the second smallest eigenvalue of its graph Laplacian. The influence of network topologies on the consensus time is also investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic descriptions of stochastic bistable systems under force ramp

Solving the two-state master equation with time-dependent rates, the ubiquitous driven bistable system, is a long-standing problem that does not permit a complete solution for all driving rates. We show an accurate approximation to this problem by considering the system in the control parameter regime. Moreover, the results are immediately applicable to a diverse range of bistable systems including single-molecule mechanics.

97 MATHEMATICS AND COMPUTING↗

Closed-loop control of stochastic nonlinear systems

Technique resolves problems in complex control systems, such as those used for space vehicle guidance and control. Main disadvantage of procedure is that it is only appropriate in situations where trajectory concept is valid.

Schmidt, G. T.↗

Stochastic control system parameter identifiability

The parameter identification problem of general discrete time, nonlinear, multiple input/multiple output dynamic systems with Gaussian white distributed measurement errors is considered. The knowledge of the system parameterization was assumed to be known. Concepts of local parameter identifiability and local constrained maximum likelihood parameter identifiability were established. A set of sufficient conditions for the existence of a region of parameter identifiability was derived. A computation procedure employing interval arithmetic was provided for finding the regions of parameter identifiability. If the vector of the true parameters is locally constrained maximum likelihood (CML) identifiable, then with probability one, the vector of true parameters is a unique maximal point of the maximum likelihood function in the region of parameter identifiability and the constrained maximum likelihood estimation sequence will converge to the vector of true parameters.

Lee, C. H.↗