Abstract
An efficient algorithm for evaluating bounds on the smallest and the largest natural frequencies of discrete linear systems is presented. The algorithm is based on generalized Dunkerley formulas, Danilevsky's method and Newton's identities.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
