1983International Journal for Numerical Methods in EngineeringRequires access

Implementation of an improved bisection algorithm in buckling problems

David John Evans, J. Shanehchi

Open publisher page 0 citations

Abstract

Abstract 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.

About this research paper

What this paper is about

Abstract 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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract 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.

Key concepts: Eigenvalues and eigenvectors, Tridiagonal matrix, Bisection method, Buckling, Bisection, Mathematics, Matrix (chemical analysis), Simple (philosophy)

Related papers

Back to paper searchBrowse research topicsOriginal source
Implementation of an improved bisection algorithm in buckling problems — Research Paper | ScholarLens