We present a new approach to the numerical solution of Sturm{Liouville eigenvalue problems based on Magnus expansions. Our algorithms are closely related to Pruess' methods [Pre73], but provide for high order approximations at nearly the same cost as the second-order Pruess method. By using Newton iteration to solve for the eigenvalues, we are able to present an e cient algorithm for computing ...