Computing eigenvalues of the string by sampling

DOI10.1016/S0893-9659(99)00204-9zbMath0956.65066OpenAlexW2070136047MaRDI QIDQ1588786

Amin Boumenir

Publication date: 4 December 2000

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(99)00204-9

zbMATH Keywords

numerical exampleseigenvalueserror boundsSturm-Liouville problemstringPaley-Wiener spacesShannon-Whittacker-Kotelnikov sampling theorem

Mathematics Subject Classification ID

Sturm-Liouville theory (34B24) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical approximation of eigenvalues and of other parts of the spectrum of ordinary differential operators (34L16) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15)

Related Items (2)

Transmutation Operators and Their Applications ⋮ An Overview of the Computation of the Eigenvalues Using Sinc-Methods

Cites Work

• Computing eigenvalues of singular Sturm-Liouville problems
• Eigenvalue and eigenfunction asymptotics for regular Sturm-Liouville problems
• Error Control of Phase-Function Shooting Methods for Sturm-Liouville Problems
• On the spectral functions of the string
• Eigenvalues of s-l systems using sampling theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing eigenvalues of the string by sampling