{"title":"An efficient method of solving for the eigenvalues in a dynamic transfer matrix analysis of beams, shafts and rotors","authors":"E. Munday, B. W. Sheppard","doi":"10.1109/SSST.1988.17017","DOIUrl":null,"url":null,"abstract":"The eigenvalues in a dynamic transfer matrix analysis have usually been obtained by trial-and-error searching for values which set a characteristic determinant to zero. Such a procedure requires an initial value, a step size, and a range over which the eigenvalues are sought. To be sure that an eigenvalue has not been missed by the search, it may be necessary to find all eigenvalues. To do so may require new starting values, search increments, and ranges. The authors develop an efficient procedure for finding the eigenvalues in a dynamic transfer matrix analysis. All eigenvalues are obtained simultaneously by the convergence of a matrix equation. The convergence does not depend upon the initial eigenvalue estimates, which may be arbitrary, and the need for search increments and range estimates is eliminated.<<ETX>>","PeriodicalId":345412,"journal":{"name":"[1988] Proceedings. The Twentieth Southeastern Symposium on System Theory","volume":"147 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. The Twentieth Southeastern Symposium on System Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSST.1988.17017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The eigenvalues in a dynamic transfer matrix analysis have usually been obtained by trial-and-error searching for values which set a characteristic determinant to zero. Such a procedure requires an initial value, a step size, and a range over which the eigenvalues are sought. To be sure that an eigenvalue has not been missed by the search, it may be necessary to find all eigenvalues. To do so may require new starting values, search increments, and ranges. The authors develop an efficient procedure for finding the eigenvalues in a dynamic transfer matrix analysis. All eigenvalues are obtained simultaneously by the convergence of a matrix equation. The convergence does not depend upon the initial eigenvalue estimates, which may be arbitrary, and the need for search increments and range estimates is eliminated.<>