Abstract
A recursive algorithm for the implicit derivation of the characteristic equation of a symmetric general tridiagonal matrix of order n is derived from a finite difference discretisation of a periodic Sturm Liouville problem. The algorithm yields a Sturmian sequence of polynomials from which the eigenvalues can be obtained by the use of the well known standard bisection process. An extension to Wilkinson's method for deriving the eigenvectors of symmetric tridiagonal matrices yields the required eigenvectors of the periodic Sturm Liouville problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
8. References
Froberg, C.E. ‘Introduction to numerical analysis’ Addison Wesley Pub. p 258. (1965)
Wilkinson, J.H. ‘The algebraic eigenvalue problem’ Oxford Univ. Press. (1965)
Wilkinson, J.H. Num. Math. 4, pp 368–376. (1962)
Barth, W., R.S. Martin & J.H. Wilkinson Num.Math. 9, pp 386–393. (1967)
Martin, R.S. & J.H. Wilkinson Num. Math. 9, pp 279–301. (1967)
Hildrebrand, F.B. ‘Finite Difference Equations and Simulations’ Prentice Hall Inc. p 53. (1968)
Evans, D.J. to be published. (1971)
Editor information
Rights and permissions
Copyright information
© 1971 Springer-Verlag
About this paper
Cite this paper
Evans, D.J. (1971). Numerical solution of the sturm liouville problem with periodic boundary conditions. In: Morris, J.L. (eds) Conference on Applications of Numerical Analysis. Lecture Notes in Mathematics, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069462
Download citation
DOI: https://doi.org/10.1007/BFb0069462
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05656-0
Online ISBN: 978-3-540-36976-9
eBook Packages: Springer Book Archive