Uniform grid spacing for the finite difference solution of partial differential equations is computationally inefficient. Two nonuniform discretization schemes are presented and applied to Graetz-type problems. Results are compared to those for a uniform discretization scheme and shown to be able to decrease the amount of computational work required for the same accuracy.