26,884 research outputs found
A decentralized linear quadratic control design method for flexible structures
A decentralized suboptimal linear quadratic control design procedure which combines substructural synthesis, model reduction, decentralized control design, subcontroller synthesis, and controller reduction is proposed for the design of reduced-order controllers for flexible structures. The procedure starts with a definition of the continuum structure to be controlled. An evaluation model of finite dimension is obtained by the finite element method. Then, the finite element model is decomposed into several substructures by using a natural decomposition called substructuring decomposition. Each substructure, at this point, still has too large a dimension and must be reduced to a size that is Riccati-solvable. Model reduction of each substructure can be performed by using any existing model reduction method, e.g., modal truncation, balanced reduction, Krylov model reduction, or mixed-mode method. Then, based on the reduced substructure model, a subcontroller is designed by an LQ optimal control method for each substructure independently. After all subcontrollers are designed, a controller synthesis method called substructural controller synthesis is employed to synthesize all subcontrollers into a global controller. The assembling scheme used is the same as that employed for the structure matrices. Finally, a controller reduction scheme, called the equivalent impulse response energy controller (EIREC) reduction algorithm, is used to reduce the global controller to a reasonable size for implementation. The EIREC reduced controller preserves the impulse response energy of the full-order controller and has the property of matching low-frequency moments and low-frequency power moments. An advantage of the substructural controller synthesis method is that it relieves the computational burden associated with dimensionality. Besides that, the SCS design scheme is also a highly adaptable controller synthesis method for structures with varying configuration, or varying mass and stiffness properties
Simultaneous diagonalisation of the covariance and complementary covariance matrices in quaternion widely linear signal processing
Recent developments in quaternion-valued widely linear processing have
established that the exploitation of complete second-order statistics requires
consideration of both the standard covariance and the three complementary
covariance matrices. Although such matrices have a tremendous amount of
structure and their decomposition is a powerful tool in a variety of
applications, the non-commutative nature of the quaternion product has been
prohibitive to the development of quaternion uncorrelating transforms. To this
end, we introduce novel techniques for a simultaneous decomposition of the
covariance and complementary covariance matrices in the quaternion domain,
whereby the quaternion version of the Takagi factorisation is explored to
diagonalise symmetric quaternion-valued matrices. This gives new insights into
the quaternion uncorrelating transform (QUT) and forms a basis for the proposed
quaternion approximate uncorrelating transform (QAUT) which simultaneously
diagonalises all four covariance matrices associated with improper quaternion
signals. The effectiveness of the proposed uncorrelating transforms is
validated by simulations on both synthetic and real-world quaternion-valued
signals.Comment: 41 pages, single column, 10 figure
Application of Lanczos vectors to control design of flexible structures
This report covers research conducted during the first year of the two-year grant. The research, entitled 'Application of Lanczos Vectors to Control Design of Flexible Structures' concerns various ways to obtain reduced-order mathematical models for use in dynamic response analyses and in control design studies. This report summarizes research described in several reports and papers that were written under this contract. Extended abstracts are presented for technical papers covering the following topics: controller reduction by preserving impulse response energy; substructuring decomposition and controller synthesis; model reduction methods for structural control design; and recent literature on structural modeling, identification, and analysis
Emergence of slow-switching assemblies in structured neuronal networks
Unraveling the interplay between connectivity and spatio-temporal dynamics in
neuronal networks is a key step to advance our understanding of neuronal
information processing. Here we investigate how particular features of network
connectivity underpin the propensity of neural networks to generate
slow-switching assembly (SSA) dynamics, i.e., sustained epochs of increased
firing within assemblies of neurons which transition slowly between different
assemblies throughout the network. We show that the emergence of SSA activity
is linked to spectral properties of the asymmetric synaptic weight matrix. In
particular, the leading eigenvalues that dictate the slow dynamics exhibit a
gap with respect to the bulk of the spectrum, and the associated Schur vectors
exhibit a measure of block-localization on groups of neurons, thus resulting in
coherent dynamical activity on those groups. Through simple rate models, we
gain analytical understanding of the origin and importance of the spectral gap,
and use these insights to develop new network topologies with alternative
connectivity paradigms which also display SSA activity. Specifically, SSA
dynamics involving excitatory and inhibitory neurons can be achieved by
modifying the connectivity patterns between both types of neurons. We also show
that SSA activity can occur at multiple timescales reflecting a hierarchy in
the connectivity, and demonstrate the emergence of SSA in small-world like
networks. Our work provides a step towards understanding how network structure
(uncovered through advancements in neuroanatomy and connectomics) can impact on
spatio-temporal neural activity and constrain the resulting dynamics.Comment: The first two authors contributed equally -- 18 pages, including
supplementary material, 10 Figures + 2 SI Figure
Applications of Structural Balance in Signed Social Networks
We present measures, models and link prediction algorithms based on the
structural balance in signed social networks. Certain social networks contain,
in addition to the usual 'friend' links, 'enemy' links. These networks are
called signed social networks. A classical and major concept for signed social
networks is that of structural balance, i.e., the tendency of triangles to be
'balanced' towards including an even number of negative edges, such as
friend-friend-friend and friend-enemy-enemy triangles. In this article, we
introduce several new signed network analysis methods that exploit structural
balance for measuring partial balance, for finding communities of people based
on balance, for drawing signed social networks, and for solving the problem of
link prediction. Notably, the introduced methods are based on the signed graph
Laplacian and on the concept of signed resistance distances. We evaluate our
methods on a collection of four signed social network datasets.Comment: 37 page
Balanced Truncation of Networked Linear Passive Systems
This paper studies model order reduction of multi-agent systems consisting of
identical linear passive subsystems, where the interconnection topology is
characterized by an undirected weighted graph. Balanced truncation based on a
pair of specifically selected generalized Gramians is implemented on the
asymptotically stable part of the full-order network model, which leads to a
reduced-order system preserving the passivity of each subsystem. Moreover, it
is proven that there exists a coordinate transformation to convert the
resulting reduced-order model to a state-space model of Laplacian dynamics.
Thus, the proposed method simultaneously reduces the complexity of the network
structure and individual agent dynamics, and it preserves the passivity of the
subsystems and the synchronization of the network. Moreover, it allows for the
a priori computation of a bound on the approximation error. Finally, the
feasibility of the method is demonstrated by an example
Generalized fiducial inference for normal linear mixed models
While linear mixed modeling methods are foundational concepts introduced in
any statistical education, adequate general methods for interval estimation
involving models with more than a few variance components are lacking,
especially in the unbalanced setting. Generalized fiducial inference provides a
possible framework that accommodates this absence of methodology. Under the
fabric of generalized fiducial inference along with sequential Monte Carlo
methods, we present an approach for interval estimation for both balanced and
unbalanced Gaussian linear mixed models. We compare the proposed method to
classical and Bayesian results in the literature in a simulation study of
two-fold nested models and two-factor crossed designs with an interaction term.
The proposed method is found to be competitive or better when evaluated based
on frequentist criteria of empirical coverage and average length of confidence
intervals for small sample sizes. A MATLAB implementation of the proposed
algorithm is available from the authors.Comment: Published in at http://dx.doi.org/10.1214/12-AOS1030 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
- …