Abstract
The fitting of physical dynamical models to stimulus-response data such as the chemical concentration measured after a gas has been released to the environment, or the plasma concentration measured after an intravenous or oral input of a drug, are important problems in the area of system identification. Using models of different structures, one can obtain relevant statistical information on the parameters of the model from an array of software packages available in the literature. A meaningful interpretation of these parameters requires that in the presence of error-free data and an error-free model structure, a unique solution for the model parameters is guaranteed. This problem is known as a priori identifiability. Once the model is deemed identifiable, the parameters are then obtained, usually via a nonlinear least squares technique. In addition to identifiability, there is the problem of convergence of the parameters to the true values. It is a known fact that nonlinear parameter estimation algorithms do not always converge to the true parameter set. This is due to the fact that estimating the parameters of a nonlinear model can at times be an ill-conditioned problem. In this paper we use the same state space analysis techniques used to determine identifiability, to estimate the model parameters in a linear fashion. We approach the problem from a system identification point of view and then take advantage of the similarity transformation between the physical model and the identified model. We formulate the similarity relations and then transform them into a null space problem whose solution leads to the physical parameters. The novelty of our approach is in the use of a state space system identification algorithm to identify a black-box system, followed by a physical parameter extraction step using robust numerical tools such as the singular value decomposition.

Abstract
In this paper a lumped transfer function (TF) model is derived for High Pressure Natural Gas Pipelines. Departing from a nonlinear partial differential equation (PDE) model a high order continuous state space (SS) linear model is obtained using a finite difference method. An infinite order TF is calculated from the SS representation and finally is approximated by a compact non-rational function. This model is compared with SIMONE(R), a commercial simulator of gas transport and distribution, using a case study, and both exhibit a similar accuracy.

Abstract
In this paper a successive approximation approach for MIMO linear parameter varying (LPV) systems with affine parameter dependence is proposed. This new approach is based on an algorithm previously introduced by the authors, which elaborates on a convergent sequence of linear deterministic-stochastic state-space approximations. In the previous algorithm the bilinear term between the time varying parameter vector and the state vector is allowed to behave as a white noise process when the scheduling parameter is a white noise sequence. However, this is a strong limitation in practice since, most often than not, the scheduling parameter is imposed by the process itself and it is typically a non white noise signal. In this paper, the bilinear term is analysed for non white noise scheduling sequences. It is concluded that its behaviour depends on the input sequence itself and it ranges from acting as an independent colored noise source, mostly removed by the identification algorithm, down to a highly input correlated signal that may be incorrectly assumed as being part of the system subspace. Based on the premise that the algorithm performance can be improved by the noise energy reduction, the bilinear term is expressed as a function of past inputs, scheduling parameters, outputs, and states, and the linear terms are included in a new extended input.

Abstract
In this paper we present a case study involving mathematical modeling, system identification, and controller design of a two tank fluid level system. The case study is motivated by a realistic application of a two tank problem. We address some fundamental control oriented issues such as physical plant design and identification, transformation from discrete-time to continuous-time, and finally the controller design. We also introduce a novel physical system identification algorithm consisting of subspace identification, followed by a similarity transformation computation to extract the physical parameters of the system. The controller design is done by Pole Placement.

Abstract
The problem of estimating the motion and orientation parameters of a rigid object from two m - D point set patterns is of significant importance in medical imaging, electrocardiogram (ECG) alignment, and fingerprint matching. The rigid parameters can be defined by an m x m rotation matrix, a diagonal m x m scale matrix, and an m x 1 translation vector. All together, the total number of parameters to be found is m(m + 2). Several least squares based algorithms have recently appeared in the literature. These algorithms are all based on a singular value decomposition (SVD) of the m x m cross-covariance matrix between the two data sets. However, there are cases where the SVD based algorithms return a reflection matrix rather than a rotation matrix. Some authors have introduced a simple correction for guarding against such cases. Other types of algorithm are based on unit quaternions which guarantee obtaining a true rotation matrix. In this paper we introduce a principal component based registration algorithm which is solved in closed-form. By using matrix vectorization properties the problem can be cast as one of finding a rank-1 symmetric projection matrix. This is equivalent to solving a Sylvester equation with equality constraints. Once the solution is obtained, we apply the inverse vectorization operation to estimate the rotation and scale matrices, along with the translation vector. We apply the proposed algorithm to the alignment of ECG signals and compare the results to those obtained by the SVD and quaternion based algorithms.

Abstract
In this paper we introduce an identification algorithm for MIMO bilinear systems subject to deterministic inputs. The new algorithm is based on an expanding dimensions concept, leading to a rectangular, dimension varying, linear system. In this framework the observability, controllability, and Markov parameters are similar to those of a time-varying system. The fact that the system is time invariant, leads to an equaivaleet linear deterministic subspace algorithm. Provided a rank condition is satisfied, the algorithm will produce unbiased parameter estimates. This rank condition can be guaranteed to hold if the ratio of the number of outputs to the number of inputs is larger than the system order. This is due to the typical exponential blow-out in the dimensions of the Hankel data matrices of bilinear systems, in particular for deterministic inputs since part of the input subspace cannot be projected out. Other algorithms in the literature, based on Walsh functions, require that the number of outputs is at least equal to the system order. For ease of notation and clarification, the algorithm is presented as an intersection based subspace algorithm. Numerical results show that the algorithm reproduces the system parameters very well, provided the rank condition is satisfied. When the rank condition is not satisfied, the algorithm will return biased parameter estimates, which is a typical bottleneck of bilinear system identification algorithms for deterministic inputs. © 2005 IEEE.