摘要:

The stability is considered of a repetitively switched system described by a finite number of linear differential equations periodically iterated in fixed order. Some new results that characterize the dependence of the system stability upon the switching frequency are presented. Some of these results are immediately applicable to the stability analysis of sampled data systems. Our approach to the.question, which is based on the Baker-Campbell-Hausdorff formula and on known theorems on localization on the complex plane of eigenvalues of a matrix, has a simple geometric interpretation and allows the provision of qualitative as well as quantitative stability conditions for the system.

ISSN:0020-7721    

DOI:10.1080/00207728708964001

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

A mathematical model is developed and used to calculate down times for a system subject to unannounced failures. The model uses a semi-markovian approach. Since the failures are unannounced, the system is periodically tested. The testing is supposed to take a finite time and cannot be ignored. Computational results from the model are presented from which the optimum testing interval could easily be obtained for a given set of model parameters.

ISSN:0020-7721    

DOI:10.1080/00207728708964002

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

Using a generalization of the Pad´ approximation method, an algorithm is presented for the transfer function of multidimensional systems described by the Fornasini and Marchesini state-space model.

ISSN:0020-7721    

DOI:10.1080/00207728708964003

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

A new inversion formula is described for the numerical inversion of multidimensional Laplace transforms, in which the inverse is obtained as an expansion in terms of the orthogonal shifted Legendre polynomials (SLPs). An illustrative example shows an excellent result.

ISSN:0020-7721    

DOI:10.1080/00207728708964004

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

The sequential manufacturing process has been widely applied to the making of complicated integrated circuits (IC). The basic idea is to break an IC product line into a linear sequence of simple operations, and then, a final product with desired high complexity can be obtained by performing the individual operations step by step. To assure the quality of the in-process products, we may conduct a test after each operation. When an in-process product is fault-free, it will pass the test and be moved to the next operation. On the other hand, for a defective in-process product which fails the test, we have to make a decision to either scrap or repair it so that no fault propagates to later operations. The repair/scrapping decisions certainly affect the manufacturing cost. Our goal is to find a set of optimal repair decisions so that the total manufacturing cost per fault-free IC product is minimized. For an IC product line with n sequential operations, there are 2npossible decision combinations in total. In this paper, we introduce a dynamic programming approach with an algorithm of 0(n2) complexity to solve the problem.

ISSN:0020-7721    

DOI:10.1080/00207728708964005

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

A new approximation method with piecewise linear polynomial functions based on the application of the operational matrix for integration is presented. It is shown that this approximation is more satisfactory than the block-pulse approximation. Two illustrative examples are given.

ISSN:0020-7721    

DOI:10.1080/00207728708964006

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

In this paper, the notions of Schauder bases and decompositions for a Sobolev space are used as an approximation method for solving the identification problem of time-varying systems. This extends the results obtained by Chen (1983). A numerical approximation is discussed.

ISSN:0020-7721    

DOI:10.1080/00207728708964007

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

A new time-domain procedure is suggested for obtaining reduced-order models of linear time-invariant discrete-time systems. The procedure is based on presenting a new form of continued-fraction expansion (CFE) about z = 1 and z = a alternately, and deriving a realization form for the CFE. An algorithm is presented for obtaining the new CFE of the z transfer function of a linear discrete-time system from its state-space model directly, without having to determine the corresponding rational z transfer function. Also presented is a systematic approach to deriving two similarity transformation matrices: one is used to transform a state-space model from a general form to the CFE canonical form, and the other is used to transform a state-space model from the phase-variable canonical form to the CFE canonical form. Finally, an approximate aggregation matrix is constructed to relate the state vector of the original system to that of a reduced model obtained by the present method. The proposed procedure is illustrated with examples.

ISSN:0020-7721    

DOI:10.1080/00207728708964008

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

The tangent-phase continued-fraction expansion for stable reduced models is based on the tangent-phase frequency response to the expansion and the factorization technique to obtain reduced models. In this paper, we propose a new procedure for deriving stable and minimum-phase reduced z-transfer functions by the tangent-phase continued-fraction expansion. The procedure is based on transforming the z-domain tangent-phase function to the p domain, where p = z + z−1−2, and then expanding the p-domain tangent-phase function into a modified continued fraction. An example is given to illustrate the utility of the procedure.

ISSN:0020-7721    

DOI:10.1080/00207728708964009

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor