LCNO Sturm-Liouville problems: computationaldifficulties and examples |
| |
Authors: | Marco Marletta John D. Pryce |
| |
Affiliation: | (1) Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester LE1 7RH e-mail: mm7{tt @}uk.ac.le , GB;(2) Software Engineering Group, Royal Military College of Science, Shrivenham, Swindon SN6 8LA e-mail: pryce{tt @}uk.ac.cran.rmcs} , GB |
| |
Abstract: | Summary. In this paper we give a new proof of a theorem of Bailey, Everitt and Zettl on the convergence of truncated approximations to limit circle (LC) Sturm-Liouville problems, both non-oscillatory (LCNO) and oscillatory (LCO). The proof gives an error bound not previously available. We prove a theorem on the conditioning of LCNO problems with respect to non-Friedrichs boundary conditions. We present numerical experiments which illustrate how the theorem successfully predicts the conditioning of LCNO problems. Our work may also explain the performance of the code SLEIGN2 recently reported by Bailey et al. [1] on a number of problems. Received January 22, 1993 / Revised version received April 22, 1994 |
| |
Keywords: | Mathematics Subject Classification (1991):65L15 34B05 |
本文献已被 SpringerLink 等数据库收录! |
|