Results 221 to 230 of about 32,246 (268)

Equalization of recursive polynomial systems

IEEE Signal Processing Letters, 1999
This letter presents some theorems for the exact and pth-order equalization of nonlinear systems described by recursive polynomial input-output relationships. It is shown that the nonlinear equalizers derived on the basis of this theory have simple and computationally efficient structures.
Alberto Carini, V. John Mathews, Giovanni L. Sicuranza   +2 more
openaire   +3 more sources

Recursive identification of a hybrid system

2009 European Control Conference (ECC), 2009
In this paper we consider the problem of retrieving information from a set of noisy and distorted measurements. More precisely we consider a scenario where a set of trajectories x 1 (t),…,x n (t) are observed using a single measuring device so that the output y(t i ) of the device at each sampling point is an observation of precisely one of x 1 (t),…,x
Tove Gustavi, Maja Karasalo, Xiaoming Hu 0001, Clyde F. Martin   +3 more
openaire   +1 more source

Recursive Estimation of Linear Systems

Biometrika, 1986
A three-stage procedure of estimation (as a modification of the familiar scheme [see the first author and \textit{J. Rissanen}, Biometrika 69, 81-94 (1982; Zbl 0494.62083), Corrections ibid. 70, 303 (1983)] for autonomous observations) is suggested for the model \[ \sum^{p}_{j=0}\alpha_ jy(t-j)=\sum^{r}_{j=1}\mu_ ju(t-j)+\sum^{q}_{j=0}\beta_ j\epsilon (
Hannan, E. J., Kavalieris, L., Mackisack, M.   +2 more
openaire   +2 more sources

L-systems and mutually recursive function systems

Acta Informatica, 1993
The authors investigate the relationships between two different approaches to generate fractal images -- \(L\)-systems and Mutually Recursive Function Systems (MRFS). Two different ways in which \(L\)- systems have been used to generate images are considered. The first is the well-known turtle geometry method, and the other is the vector interpretation
Karel Culík II, Simant Dube
openaire   +1 more source

Recursive pointwise design for nonlinear systems

Proceedings of the 2004 American Control Conference, 2004
This paper presents a recursive pointwise design (RPD) method for a class of nonlinear systems represented by x(t)=f(x(t))+g(x(t))u(t). A main feature of the RPD method is to recursively design a stable controller by using pointwise information of a system.
Kazuo Tanaka, Hiroshi Ohtake, Hua O. Wang   +2 more
openaire   +1 more source

Superintegrable Systems and Recursion Operators

Modern Physics Letters A, 2003
Geometric structures underlying noncommutative integrable (superintegrable) dynamics are analyzed. They lead to a new characterization of noncommutative integrability in terms of spectral properties and of Nijenhuis torsion of an invariant (1,1) tensor field. The construction of compatible symplectic structures is also discussed.
openaire   +2 more sources

Recursive Decision Systems: An Existence Analysis

Econometrica, 1970
In this paper recursive decision systems are structured so that topological concepts can be applied to formulate and help solve existence problems. Existence of stationary states and compact orbits is established. The analysis is then applied to recursive programs, a special class of recursive decision systems in which the decision operator is a ...
Day, Richard H, Kennedy, Peter E
openaire   +2 more sources

On systems of definitions, induction and recursion

BIT, 1992
When Martin-Löf's natural deduction, and in particular his analysis of iterated inductive definitions [see \textit{P. Martin-Löf}, ``Hauptsatz for the intuitionistic theory of iterated inductive definitions'', Proc. Second Scand. Logic Symp. 1970, Stud. Logic Found. Math.
openaire   +2 more sources

Recursive Identification of Quantized Linear Systems

Journal of Systems Science and Complexity, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianming Xiao, Qijiang Song
openaire   +1 more source

Recursive Identification of Linear Systems

SIAM Journal on Control, 1971
Let the three matrices $\sum (N) = (G(N),F(N)H(N))$ define a linear constant system of least degree which realizes the set of numbers $f_1 , \cdots ,f_N $ regarded as a partial impulse response of a system. An algorithm has been developed for recursively calculating the minimal partial realizations for each $N = 1,2, \cdots $ such that \[ \cdots \sum {(
openaire   +1 more source