211,796 research outputs found
The Cohomology of Transitive Lie Algebroids
For a transitive Lie algebroid A on a connected manifold M and its a
representation on a vector bundle F, we study the localization map Y^1:
H^1(A,F)-> H^1(L_x,F_x), where L_x is the adjoint algebra at x in M. The main
result in this paper is that: Ker Y^1_x=Ker(p^{1*})=H^1_{deR}(M,F_0). Here
p^{1*} is the lift of H^1(\huaA,F) to its counterpart over the universal
covering space of M and H^1_{deR}(M,F_0) is the F_0=H^0(L,F)-coefficient deRham
cohomology. We apply these results to study the associated vector bundles to
principal fiber bundles and the structure of transitive Lie bialgebroids.Comment: 17pages, no figure
Recommended from our members
On designing H∞ filters with circular pole and error variance constraints
Copyright [2003] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we deal with the problem of designing a H∞ filter for discrete-time systems subject to error variance and circular pole constraints. Specifically, we aim to design a filter such that the H∞ norm of the filtering error-transfer function is not less than a given upper bound, while the poles of the filtering matrix are assigned within a prespecified circular region, and the steady-state error variance for each state is not more than the individual prespecified value. The filter design problem is formulated as an auxiliary matrix assignment problem. Both the existence condition and the explicit expression of the desired filters are then derived by using an algebraic matrix inequality approach. The proposed design algorithm is illustrated by a numerical example
- …