Abstract
For a nonautonomous differential equation, we consider the almost reducibility property that corresponds to the reduction of the original equation to an autonomous equation via a coordinate change preserving the Lyapunov exponents. In particular, we characterize the class of equations to which a given equation is almost reducible. The proof is based on a characterization of the almost reducibility to an autonomous equation with a diagonal coefficient matrix. We also characterize the notion of almost reducibility for an equation x 0 = A(t, θ)x depending continuously on a real parameter θ. In particular, we show that the almost reducibility set is always an Fσδ-set and for any Fσδ-set containing zero we construct a differential equation with that set as its almost reducibility set.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronic Journal of Qualitative Theory of Differential Equations
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
