𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Limitations for the use of an exact formula for receptance reanalysis

✍ Scribed by John A. Brandon

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
305 KB
Volume
20
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis

The receptance matrix of a system after a modification of rank k<< n to system matrices (of order n) may be derived from the receptance matrix of the original system by solution of a system of linear equations of order k. In this paper it is shown that it is desirable to impose a much more conservative condition on the system of equations than simple solvability. The possible consequences of breaching this conservative condition are developed and discussed.

πŸ“œ SIMILAR VOLUMES

An Asymptotic Formula for the Number of
An Asymptotic Formula for the Number of Complete Propositional Connectives
✍ Roger F. Wheeler πŸ“‚ Article πŸ“… 1962 πŸ› John Wiley and Sons 🌐 English βš– 205 KB

The present article is really a continuation of the author's earlier paper [,l] on this subject. The line of investigation described previously is rounded off by deriving some further numcrical results, which include, in particular, an asymptotic fonnula for the number of complete propositional conn

An exact algorithm for the batch sequenc
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
✍ A. Agnetis; F. Rossi; G. Gristina πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 295 KB πŸ‘ 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.