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.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage PlusPublished in last 50 years