Automatic solution of Sturm-Liouville problems using the Pruess method (Q1185975)

From MaRDI portal
Revision as of 09:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Automatic solution of Sturm-Liouville problems using the Pruess method
scientific article

    Statements

    Automatic solution of Sturm-Liouville problems using the Pruess method (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    Basing on the well known reliable code SLEIGN for solution of Sturm- Liouville problems, the authors propose now a new code for automatic solution for the problem based on a numerical method different from that used by SLEIGN. Namely, an essential feature of the method is the approximation of the coefficient functions of the differential equation and some eigenvalues estimates given by \textit{S. Pruess} [SIAM J. Numer. Anal. 10, 55-68 (1973; Zbl 0224.65025)]. Because of automatic meshing and a very simple algorithm for interval truncation, the new code is applicable to both regular and singular Sturm-Liouville problems; the numerical experiments presented in the paper show that there are a significant number of problems on which the authors' code (modification SLO2F) runs faster than SLEIGN.
    0 references
    Pruess method
    0 references
    code SLEIGN
    0 references
    Sturm-Liouville problems
    0 references
    approximation of the coefficient functions
    0 references
    eigenvalues estimates
    0 references
    automatic meshing
    0 references
    interval truncation
    0 references
    singular Sturm-Liouville problems
    0 references
    numerical experiments
    0 references
    SLO2F
    0 references
    0 references
    0 references
    0 references

    Identifiers