A Floquet decomposition for Volterra equations with periodic kernel and a transform approach to linear recursion equations (Q1820952)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Floquet decomposition for Volterra equations with periodic kernel and a transform approach to linear recursion equations |
scientific article |
Statements
A Floquet decomposition for Volterra equations with periodic kernel and a transform approach to linear recursion equations (English)
0 references
1987
0 references
The author considers a functional equation in \(E^ n\) of the form \[ x(t)=\int^{t}_{-\infty}w(t,s)x(s)ds \] with w(t,s) is a piecewise continuous \(m\times m\) kernel satisfying for all positive T, \(\Omega\), \(\mu\), \(w(t+T,s+T)=w(t,s)\) and \(\| w(t,s)\| \leq \Omega e^{-u(t- s)}\). The solution x(t) admits for each \(\beta <\theta\) a decomposition \(x(t)=x_ f(t)+x_{\beta}(t)\) where for some \(B=B(\beta)\), \(| x_{\beta}(t)\| \leq Be^{-\beta t}\) \((t>0)\) and \(X_ f(t)\) is a linear combination of Floquet-type solutions having the form \(t^ qe^{\lambda t}p(t)\), q a positive integer, \(\lambda\in {\mathbb{C}}\) and \(Re(\lambda)>-\beta\) and p(t) is a continuous function such that \(p(t+T)=p(t)\). This result is proved by converting the functional equation into a linear recursion equation of convolution type and employing transform methods to this equation.
0 references
frequency-adaptive disturbance rejection procedures
0 references
linear control systems
0 references
Floquet decomposition
0 references
Volterra equations
0 references
periodic kernel
0 references
linear recursion equations
0 references
transform methods
0 references