Self-regularized pseudo time-marching schemes for structural system identification with static measurements

We explore the application of pseudo time marching schemes, involving either deterministic integration or stochastic filtering, to solve the inverse problem of parameter identification of large dimensional structural systems from partial and noisy measurements of strictly static response. Solutions of such non-linear inverse problems could provide useful local stiffness variations and do not have to confront modeling uncertainties in damping, an important, yet inadequately understood, aspect in dynamic system identification problems. The usual method of least-square solution is through a regularized Gauss-Newton method (GNM) whose results are known to be sensitively dependent on the regularization parameter and data noise intensity. Finite time, recursive integration of the pseudo-dynamical GNM (PD-GNM) update equation addresses the major numerical difficulty associated with the near-zero singular values of the linearized operator and gives results that are not sensitive to the time step of integration. Therefore, we also propose a pseudo-dynamic stochastic filtering approach for the same problem using a parsimonious representation of states and specifically solve the linearized filtering equations through apseudo-dynamic ensemble Kalman filter (PD-EnKF). For multiple sets ofmeasurements involving various load cases, we expedite the speed of the PD-EnKF by proposing an inner iteration within every time step. Results using the pseudo-dynamic strategy obtained through PD-EnKF and recursive integration are compared with those from the conventional GNM, which prove that the PD-EnKF is the best performer showing little sensitivity to process noise covariance and yielding reconstructions with less artifacts even when the ensemble size is small. Copyright (C) 2009 John Wiley & Sons, Ltd.

Minimizing total completion time on batch processing machines

We study the problem of minimizing total completion time on single and parallel batch processing machines. A batch processing machine is one which can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. This problem is motivated by burn-in operations in the final testing stage of semiconductor manufacturing and is expected to occur in other production environments. We provide an exact solution procedure for the single-machine problem and heuristic algorithms for both single and parallel machine problems. While the exact algorithms have limited applicability due to high computational requirements, extensive experiments show that the heuristics are capable of consistently obtaining near-optimal solutions in very reasonable CPU times.

Chaotic and power law states in the Portevin-Le Chatelier effect

Recent studies on the Portevin-Le Chatelier effect report an intriguing crossover phenomenon from low-dimensional chaotic to an infinite-dimensional scale-invariant power law regime in experiments on CuAl single crystals and AlMg polycrystals, as function of strain rate. We devise fully dynamical model which reproduces these results. At low and medium strain rates, the model is chaotic with the structure of the attractor resembling the reconstructed experimental attractor. At high strain rates, power law statistics for the magnitudes and durations of the stress drops emerge as in experiments and concomitantly, the largest Lyapunov exponent is zero.

Predictability and chaotic nature of daily streamflow

The predictability of a chaotic series is limited to a few future time steps due to its sensitivity to initial conditions and the exponential divergence of the trajectories. Over the years, streamflow has been considered as a stochastic system in many approaches. In this study, the chaotic nature of daily streamflow is investigated using autocorrelation function, Fourier spectrum, correlation dimension method (Grassberger-Procaccia algorithm) and false nearest neighbor method. Embedding dimensions of 6-7 obtained indicates the possible presence of low-dimensional chaotic behavior. The predictability of the system is estimated by calculating the system’s Lyapunov exponent. A positive maximum Lyapunov exponent of 0.167 indicates that the system is chaotic and unstable with a maximum predictability of only 6 days. These results give a positive indication towards considering streamflow as a low dimensional chaotic system than as a stochastic system.

Proportional navigation with delayed line-of-sight rate

This brief discusses the convergence analysis of proportional navigation (PN) guidance law in the presence of delayed line-of-sight (LOS) rate information. The delay in the LOS rate is introduced by the missile guidance system that uses a low cost sensor to obtain LOS rate information by image processing techniques. A Lyapunov-like function is used to analyze the convergence of the delay differential equation (DDE) governing the evolution of the LOS rate. The time-to-go until which decreasing behaviour of the Lyapunov-like function can be guaranteed is obtained. Conditions on the delay for finite time convergence of the LOS rate are presented for the linearized engagement equation. It is observed that in the presence of line-of-sight rate delay, increasing the effective navigation constant of the PN guidance law deteriorates its performance. Numerical simulations are presented to validate the results.

Predictability and chaotic nature of daily streamflow

The predictability of a chaotic series is limited to a few future time steps due to its sensitivity to initial conditions and the exponential divergence of the trajectories. Over the years, streamflow has been considered as a stochastic system in many approaches. In this study, the chaotic nature of daily streamflow is investigated using autocorrelation function, Fourier spectrum, correlation dimension method (Grassberger-Procaccia algorithm) and false nearest neighbor method. Embedding dimensions of 6-7 obtained indicates the possible presence of low-dimensional chaotic behavior. The predictability of the system is estimated by calculating the system's Lyapunov exponent. A positive maximum Lyapunov exponent of 0.167 indicates that the system is chaotic and unstable with a maximum predictability of only 6 days. These results give a positive indication towards considering streamflow as a low dimensional chaotic system than as a stochastic system.

Three Dimensional Impact Angle Constrained Guidance Law using Sliding Mode Control

In this paper, three dimensional impact angle control guidance laws are proposed for stationary targets. Unlike the usual approach of decoupling the engagement dynamics into two mutually orthogonal 2-dimensional planes, the guidance laws are derived using the coupled dynamics. These guidance laws are designed using principles of conventional as well as nonsingular terminal sliding mode control theory. The guidance law based on nonsingular terminal sliding mode guarantees finite time convergence of interceptor to the desired impact angle. In order to derive the guidance laws, multi-dimension switching surfaces are used. The stability of the system, with selected switching surfaces, is demonstrated using Lyapunov stability theory. Numerical simulation results are presented to validate the proposed guidance law.

Chaotic dynamic analysis of viscoelastic plates

The dynamic buckling of viscoelastic plates with large deflection is investigated in this paper by using chaotic and fractal theory. The material behavior is given in terms of the Boltzmann superposition principle. in order to obtain accurate computation results, the nonlinear integro-differential dynamic equation is changed into an autonomic four-dimensional dynamical system. The numerical time integrations of equations are performed by using the fourth-order Runge-Kutta method. And the Lyapunov exponent spectrum, the fractal dimension of strange attractors and the time evolution of deflection are obtained. The influence of geometry nonlinearity and viscoelastic parameter on the dynamic buckling of viscoelastic plates is discussed.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Continuous-time subspace flows related to the symmetric eigenproblem

The classes of continuous-time flows on Rn×p that induce the same flow on the set of p- dimensional subspaces of Rn×p are described. The power flow is briefly reviewed in this framework, and a subspace generalization of the Rayleigh quotient flow [Linear Algebra Appl. 368C, 2003, pp. 343-357] is proposed and analyzed. This new flow displays a property akin to deflation in finite time. © 2008 Yokohama Publishers.

Dynamic behaviors of mode III interfacial crack under a constant loading rate

In an earlier study on intersonic crack propagation, Gao et al. (J. Mech. Phys. Solids 49: 2113-2132, 2001) described molecular dynamics simulations and continuum analysis of the dynamic behaviors of a mode II dominated crack moving along a weak plane under a constant loading rate. The crack was observed to initiate its motion at a critical time after the onset of loading, at which it is rapidly accelerated to the Rayleigh wave speed and propagates at this speed for a finite time interval until an intersonic daughter crack is nucleated at a peak stress at a finite distance ahead of the original crack tip. The present article aims to analyze this behavior for a mode III crack moving along a bi-material interface subject to a constant loading rate. We begin with a crack in an initially stress-free bi-material subject to a steadily increasing stress. The crack initiates its motion at a critical time governed by the Griffith criterion. After crack initiation, two scenarios of crack propagation are investigated: the first one is that the crack moves at a constant subsonic velocity; the second one is that the crack moves at the lower shear wave speed of the two materials. In the first scenario, the shear stress ahead of the crack tip is singular with exponent -1/2, as expected; in the second scenario, the stress singularity vanishes but a peak stress is found to emerge at a distance ahead of the moving crack tip. In the latter case, a daughter crack supersonic with respect to the softer medium can be expected to emerge ahead of the initial crack once the peak stress reaches the cohesive strength of the interface.

Bound on quantum computation time: Quantum error correction in a critical environment

We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the logical qubits and show that it has the same form as that for the physical qubits but with a reduced coupling strength to the environment. Using this evolution operator, we find the trace distance between the real and ideal states of the logical qubits in two cases. For a super-Ohmic bath, the trace distance saturates, while for Ohmic or sub-Ohmic baths, there is a finite time before the trace distance exceeds a value set by the user. © 2010 The American Physical Society.

Communication system model for information rate evaluation of differential detection over time-varying channels

A communication system model for mutual information performance analysis of multiple-symbol differential M-phase shift keying over time-correlated, time-varying flat-fading communication channels is developed. This model is a finite-state Markov (FSM) equivalent channel representing the cascade of the differential encoder, FSM channel model and differential decoder. A state-space approach is used to model channel phase time correlations. The equivalent model falls in a class that facilitates the use of the forward backward algorithm, enabling the important information theoretic results to be evaluated. Using such a model, one is able to calculate mutual information for differential detection over time-varying fading channels with an essentially finite time set of correlations, including the Clarke fading channel. Using the equivalent channel, it is proved and corroborated by simulations that multiple-symbol differential detection preserves the channel information capacity when the observation interval approaches infinity.

Dynamics of two coupled chaotic multimode Nd:YAG lasers with intracavity frequency doubling crystal

The effect of coupling two chaotic Nd:YAG lasers with intracavity KTP crystal for frequency doubling is numerically studied for the case of the laser operating in three longitudinal modes. It is seen that the system goes from chaotic to periodic and then to steady state as the coupling constant is increased. The intensity time series and phase diagrams are drawn and the Lyapunov characteristic exponent is calculated to characterize the chaotic and periodic regions.