In this paper, a recursive solution of Generalized Predictive Control (GPC) for I/O models is suggested. Also the GPC algorithm for state space model is introduced and shown to be identical to GPC for I/O models when ...
详细信息
In this paper, a recursive solution of Generalized Predictive Control (GPC) for I/O models is suggested. Also the GPC algorithm for state space model is introduced and shown to be identical to GPC for I/O models when each model represents the same system. It is shown by using the recursive solution of GPC that GPC for I/O models is identical to Receding Horizon Tracking Control (RHTC) for state space models when they are applied to. the same system. Some new stability results of GPC for I/O models are introduced, which originated from the stability properties of RHTC.
Recently the authors have proposed a list-processing approach to the modeling of algebraic quantum field theory methods in quantum mechanics in which the noncommutative algebra of quantum-mechanical operators is emula...
详细信息
Recently the authors have proposed a list-processing approach to the modeling of algebraic quantum field theory methods in quantum mechanics in which the noncommutative algebra of quantum-mechanical operators is emulated by lists. The processing produces reordered sequences of elements of a ring with a unit commutator and generates dynamic structures which, for some initial arrangements, correspond to partially ordered graphs characterized by recurrence relations and combinatorial identities. Likewise, in another list-processing application to physical problems, a simulation of Feynman diagrams hinged on predominantly combinatorial aspects and demanded explicit generation of certain combinatorial objects. This motivated an investigation into the combinatorial nature of noncommutative list-processing and of recursive algorithms for explicit construction of combinatorial lists, which we now present. The emphasis is also placed on the consideration of associated graphs and the graph-theoretic origin of the appearance of recurrence relations in the reordering theorems of the noncommutative algebra.
In this paper we consider a special class of linear control systems represented by the standard singularly perturbed system matrix and with the control input matrix having three different nonstandard forms. Many real ...
详细信息
In this paper we consider a special class of linear control systems represented by the standard singularly perturbed system matrix and with the control input matrix having three different nonstandard forms. Many real systems (such as hydropower plants, systems with only few actuators) possess the control structure studied in this paper. The obtained results are quite simplified (comparing to the standard singularly perturbed control systems), and in one case the optimal solution of the algebraic Riccati equation is completely determined in terms of the reduced-order algebraic Lyapunov equations. The proposed method is successfully applied to the reduced-order design of optimal controllers for the real hydropower plant of the Serbian power system.
In this paper, the well-known QR updating scheme is extended to a similar but more versatile and generally applicable scheme for updating the singular value decomposition (SVD). This is done by supplementing the QR up...
详细信息
In this paper, the well-known QR updating scheme is extended to a similar but more versatile and generally applicable scheme for updating the singular value decomposition (SVD). This is done by supplementing the QR updating with a Jacobi-type SVD procedure, where apparently only a few SVD steps after each QR update suffice in order to restore an acceptable approximation for the SVD. This then results in a reduced computational cost, comparable to the cost for merely QR updating. The usefulness of such an approximate updating scheme when applied to subspace tracking is examined. It is shown how an O(n2) SVD updating algorithm can restore an acceptable approximation at every stage, with a fairly small tracking error of approximately the time variation in O(n) time steps. Finally, an error analysis is performed, proving that the algorithm is stable, when supplemented with a Jacobi-type reorthogonalization procedure, which can easily be incorporated into the updating scheme.
This paper gives a state-of-the-art review of adaptive channel equalization in digital line-of-sight radio systems employing bandwidth-efficient modulation techniques. A particular emphasis is placed on decision-feedb...
详细信息
This paper gives a state-of-the-art review of adaptive channel equalization in digital line-of-sight radio systems employing bandwidth-efficient modulation techniques. A particular emphasis is placed on decision-feedback equalizer (DFE) implementation and performance in the presence of nonminimum-phase fading. Stability problems of fractionally-spaced equalizers (FSE's) are discussed, and a newly developed adaptation technique is outlined. We also discuss the blind adaptation algorithms that are used to reduce outage by preventing the equalizer coefficients to diverge during severe fade events and carrier synchronism loss. Finally, we discuss further issues related to asymmetric equalizers and to the interaction of the equalizer adaptation algorithm with the carrier recovery loop.
The paper describes a recent progress in searching for credible, well-grounded approximation of recursive Bayesian parameter estimation which would make the Bayesian paradigm feasible for a class of nonstandard (non-l...
详细信息
The paper describes a recent progress in searching for credible, well-grounded approximation of recursive Bayesian parameter estimation which would make the Bayesian paradigm feasible for a class of nonstandard (non-linear and/or non-Gaussian) models. The presented method is based on maximum-entropy approximation of the empirical distribution of data while just a reduced (non-sufficient) data statistic is available. The statistic is chosen so to induce an equivalence relation on the set of posterior probability distributions which is compatible with the Bayes-rule action. The approximating posterior density of unknown parameters is given by the standard Bayes-rule transformation of the approximating distribution of data. Numerical implementation of the general algorithm is considered using its discrete version or prior approximation of critical steps.
The issues of consistency and minimal parametrization of the prewindowed prediction problem are presented in detail. The paper establishes an equivalence class between the set of p × p symmetric, positive definit...
详细信息
The issues of consistency and minimal parametrization of the prewindowed prediction problem are presented in detail. The paper establishes an equivalence class between the set of p × p symmetric, positive definite matrices P and the set of 2 × 1 stable causal allpass functions η p (z) or McMillan degree p. The minimal parametrization of such matrices P is obtained by parametrizing η p (z) resulting in an inherently consistent parametrization. The application to numerically stable fast least-squares filtering is highlighted.
Automation of forging processes is important both for reasons of safety and to improve manufacturing capabilities. Development of an integrated robot/forge processing cell and its efficient dynamic simulation are disc...
详细信息
Automation of forging processes is important both for reasons of safety and to improve manufacturing capabilities. Development of an integrated robot/forge processing cell and its efficient dynamic simulation are discussed in this paper. Dynamic simulation of the closed-chain industrial robot is implemented using an O (N) recursive algorithm, while material flow in the workpiece is represented using a finite-element model. Integration of the two models along with process control is discussed. Timing results for a specific open die forging example are presented.
In earlier reports, a Jacobi-type algorithm for SVD updating has been developed and implemented on a systolic array. Here, this is extended to a generalized decomposition for a matrix pair, viz. the quotient singular ...
详细信息
In earlier reports, a Jacobi-type algorithm for SVD updating has been developed and implemented on a systolic array. Here, this is extended to a generalized decomposition for a matrix pair, viz. the quotient singular value decomposition (QSVD). Updating problems are considered where new rows are appended to either one or both of the matrices involved. Systolic arrays as well as square root free implementations are described.
暂无评论