Trevor Vanderwoerd

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Graham and Pollak showed that the vertices of any connected graph G can be assigned t-tuples with entries in {0, a, b}, called addresses, such that the distance in G between any two vertices equals the number of positions in their addresses where one of the addresses equals a and the other equals b. In this paper, we are interested in determining the(More)
The generalized Crank-Nicolson method is employed to obtain numerical solutions of the two-dimensional time-dependent Schrödinger equation. An adapted alternating-direction implicit method is used, along with a high-order finite-difference scheme in space. Extra care has to be taken for the needed precision of the time development. The method permits a(More)
  • 1