Algorithm 810: The SLEIGN2 Sturm-Liouville Code

  • Authors:
  • P. B. Bailey;W. N. Everitt;A. Zettl

  • Affiliations:
  • Northern Illinois University, DeKalb, IL;University of Birmingham, Edgbaston, Birmingham, UK;Northern Illinois University, DeKalb, IL

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The SLEIGN2 code is based on the ideas and methods of the original SLEIGN code of 1979. The main purpose of the SLEIGN2 code is to compute eigenvalues and eigenfunctions of regular and singular self-adjoint Sturm-Liouville problems, with both separated and coupled boundary conditions, and to approximate the continuous spectrum in the singular case. The code uses some new algorithms, which we describe, and has a driver program that offers a user-friendly interface. In this paper the algorithms and their implementations are discussed, and the class of problems to which each algorithm applied is identified.