Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T19:14:39.202Z Has data issue: false hasContentIssue false

Pseudo-autonomous linear systems

Published online by Cambridge University Press:  17 April 2009

W.A. Coppel
Affiliation:
Department of Mathematics, Institute of Advanced Studies, Australian National University, Canberra, ACT.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Pseudo-autonomous linear differential equations are defined. A linear differential equation with bounded coefficient matrix is pseudo-autonomous if and only if it is almost reducible. A linear differential equation with recurrent coefficient matrix is pseudo-autonomous if and only if it has pure point spectrum.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1977