The properties of control operators in one problem on data control and algorithms for its solutions (Q1916593)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The properties of control operators in one problem on data control and algorithms for its solutions |
scientific article |
Statements
The properties of control operators in one problem on data control and algorithms for its solutions (English)
0 references
12 January 1997
0 references
Consider the problem of controlling data for evolution equations that can be stated as follows. Find \(\varphi\) and \(u\) such that \({d \varphi \over dt} + A(t) \varphi = f\) in \(\Omega \times (0,T)\), \(\varphi = u\) for \(t = 0\), \(\widetilde S (\varphi) = \inf_u S (\varphi) \), where \(\Omega\) is a grid domain, \(A(t)\) is the grid operator, \(\varphi = \varphi (t)\) and \(f = f(t)\) are grid functions. Let \(S (\varphi)\) be a functional of the form \(S (\varphi) = {\alpha \over 2} |\varphi |_{t = 0} |^2 + {\beta \over 2} \int^T_0 |\varphi - \widehat \varphi |^2 dt\), where \(\alpha, \beta \geq 0\) and \(\widehat \varphi = \widehat \varphi (t)\) is a given vector function. Assume that \(A(t)\), \(f(t)\) and \(\widehat \varphi (t)\) are continuous in \(t\). The author shows that the control \(u\) of the problem satisfies the equation \(Lu = F\) where \[ L = \alpha E + \beta X (0) \int^T_0 X^{-1} (s) Y(s) ds, \] \[ F = \beta X (0) \int^T_0 X^{-1} (s) \widehat \varphi (s) ds - \beta X (0) \int^T_0 X^{-1} (s) \int^s_0 Y(s)Y^{-1} (\lambda) f(\lambda) d \lambda ds. \] Here \(Y(t)\) is the solution of \({dY \over dt} + A(t)Y = 0\), \(Y |_{t = 0}= E\), while \(X(t)\) is the solution of \(- {dX \over dt} + A^* (t)X = 0\), \(X |_{t = T} = E\). It is shown that the control operator \(L\) is self-adjoint. The boundaries of the spectrum of \(L\) are calculated. An iteration algorithm for the solution is given.
0 references
controlling data
0 references
evolution equations
0 references
control operator
0 references
self-adjoint
0 references
iteration algorithm
0 references