摘要:

In this paper, the effect of integral action on the stabilizability of a class of linear dynamical systems with retarded control is investigated using the method ofD-partition. This effect is illustrated by the presentation of a number ofD-partition diagrams and a selection of transient response characteristics.

ISSN:0020-7721    

DOI:10.1080/00207727408920141

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor

摘要:

This paper presents an application of hierarchical identification procedures of the previous paper to the identification of interconnected power system states and parameters from input—output observed data. A three-area interconnected power system model is used to demonstrate the decomposition of the original system based on its particular characteristics and the implementation of hierarchical algorithms for system identification. The adaptivity of these procedures to structural changes are also illustrated. Numerical results are obtained by conducting a digital simulation of the three-area system and using the hierarchical identification and coordination algorithms to estimate the states and unknown system parameters. Computational aspects of the hierarchical system identification solutions are discussed.

ISSN:0020-7721    

DOI:10.1080/00207727408920142

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor

摘要:

The computational advantages of the invariant imbedding techniques for converting two-point boundary-value problems to initial-value problems are well known.—In this note an application of these techniques to the derivation of optimal feedback controllers is indicated.

ISSN:0020-7721    

DOI:10.1080/00207727408920143

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor

摘要:

In this paper we use the method extensively used by Lakahmikanthum to study a, type of control problem. The method depends upon the fact that the function satisfying a differential inequality can be majorized by the maximal solution of another differential inequality.

ISSN:0020-7721    

DOI:10.1080/00207727408920144

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor

摘要:

In this paper a modified Dantzig-Wolfe decomposition algorithm is interpreted as a. decontralized planning process. The main objective is to provide some extensions of the pricing and allocation rules of the original algorithm to make the solution process more efficient. A simple numerical example is included.

ISSN:0020-7721    

DOI:10.1080/00207727408920145

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor

摘要:

Modern computers are primarily binary. Proposed in this paper is a new generalized computing system, by which a number system of any arbitrary radix can be manipulated directly without encoders and decoders. The feature of being able to vary the radix is achieved by pulse counting with alterable carry conditions. The architecture and the organization of the new system are also drastically different from those of existing computers. Instead of the adder being the basic functional structure, the heart of the system consists essentially of an adder, subtractor, multiplier and an accumulator integrated into one inseparable unit. Introduced in this paper is a unified system design suitable for all computing systems and also the concept of a universal building block which can be shared both by the arithmetic unit and the memory. As a memory element, the universal building block is capable of storing a digit of any given radix rather than just binary. Instead of communicating between the binary registers and the constituents of the memory or the arithmetic unit as in existing computers, variable pulse train generators and counters are made to communicate with each other. Binary logic is adopted to channel the pulses or the instructions instead of performing the arithmetic operations. A modern computer, however complex, thus becomes a special case of the generalized computing system.

ISSN:0020-7721    

DOI:10.1080/00207727408920146

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor

摘要:

This paper presents some theoretical ideas for the discrete non-linear programming problem. The main objective in to construct a hypercube inside of which the discrete optimum will lie. It is shown that for quadratic functions this hypercube can be constructed by knowing the inverse of the hessian matrix.

ISSN:0020-7721    

DOI:10.1080/00207727408920147

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor

摘要:

Information-theoretic concepts are developed and employed to obtain conditions for a minimax error entropy stochastic approximation algorithm to estimate the state of a non-linear discrete time system baaed on noisy linear measurements of the state. Two recursive suboptimal error entropy estimation procedures are presented along with an upper bound formula for the resulting error entropy. A simple example is utilized to compare the optimal and suboptimal error entropy estimators and the minimum mean Square error linear estimator.

ISSN:0020-7721    

DOI:10.1080/00207727408920148

出版商:Taylor & Francis Group    

年代:1974

数据来源: Taylor