Implementation of an improved bisection algorithm in buckling problems | Zendy

Evans D. J. | Zendy; Shanehchi J. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Implementation of an improved bisection algorithm in buckling problems

Author(s) -

Evans D. J.,

Shanehchi J.

Publication year - 1983

Publication title -

international journal for numerical methods in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.421

H-Index - 168

eISSN - 1097-0207

pISSN - 0029-5981

DOI - 10.1002/nme.1620190708

Subject(s) - eigenvalues and eigenvectors , tridiagonal matrix , bisection method , buckling , bisection , mathematics , matrix (chemical analysis) , simple (philosophy) , minor (academic) , minification , algorithm , class (philosophy) , mathematical optimization , algebra over a field , computer science , pure mathematics , geometry , structural engineering , engineering , artificial intelligence , materials science , epistemology , philosophy , physics , quantum mechanics , political science , law , composite material

An improved bisection strategy is presented to determine the eigenvalues of a real symmetric tridiagonal matrix which occurs in a simple column buckling problem. The new strategy, which involves only a minor modification, utilizes incomplete Sturm sequences only as long as relevant information on the next and following eigenvalues is obtained resulting in a minimization of the computational work. The strategy is particularly effective if only a few eigenvalues are required. The technique can be used for a wider class of eigenvalue problems than the illustrative one presented here.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research