2 research outputs found

    New convolutions and their applicability to integral equations of Wiener-Hopf plus Hankel type

    Get PDF
    We propose four new convolutions exhibiting convenient factorization properties associated with two finite interval integral transformations of Fourier-type together with their norm inequalities. Moreover, we study the solvability of a class of integral equations of Wiener-Hopf plus Hankel type (on finite intervals) with the help of the factorization identities of such convolutions. Fourier-type series are used to produce the solution formula of such equations and a Shannon-type sampling formula is also obtained.publishe

    Design of discrete time controllers and estimators.

    Get PDF
    This thesis considers optimal linear least-squares filtering smoothing prediction and regulation for discrete-time processes. A finite interval smoothing filter is derived in the z domain giving a transfer function solution. The resulting time-invariant smoother can be applied to problems where, a time varying solution using matrix Riccati equations would diverge if the process is modelled inaccurately. A self-tuning algorithm is given for the filtering and fixed lag smoothing problems as applied to square multi-variable ARMA processes when only the order of the process is assumed known. The dynamics of the process can also be slowly time varying. If the dynamics remain constant and unknown, it is shown how the self-tuning filter or smoother algorithm converges asymptotically to the optimal Wiener solutions. LQG self-tuning regulation is considered. The LQG algorithms rely on input-output data rather than from the conventional state-space approach employing the Kalman filter. An explicit algorithm is given which is similar to certain pole placement self-tuning regulators, requiring the solution of a diophantine equation. Following this, an implicit algorithm is shown to overcome the problem of solving a diophantine equation by estimating the regulator parameters directly using recursive least squares. The LQG algorithms are shown to be able to cope with processes which are non-minimum phase, open loop unstable and with an unknown time delay
    corecore