AbstractA fully Galerkin method in both space and time is developed for the second‐order, linear hyperbolic problem. Sinc basis functions are used and error bounds are given which show the exponential convergence rate of the method. The matrices necessary for the formulation of the discrete system are easily assembled. They require no numerical integrations (merely point evaluations) to be filled. The discrete problem is formulated in two different ways and solution techniques for each are described. Consideration of the two formulations is motivated by the computational architecture available. Each has advantages for the appropriate hardware. Numerical results reported show that if 2N + 1 basis functions are used then the exponential convergence rate \documentclass{article}\pagestyle{empty}\begin{document}$ 0\left[{\exp \left({- \kappa \sqrt N} \right)} \right] $\end{document}, κ > 0, is attained for both analytic and singular problems.