\indent geometric partial differential equations (pdes) are at the forefront of current research in mathematics, as evidenced by perelman's use of these equations in his proof of the poincare conjecture and cedric villani's fields medal in 2010 for his work on optimal transportation. they can be used to describe, manipulate and construct shapes based on intrinsic geometric properties such as curvatures, volumes, and geodesic lengths. these equations are useful in modern applications (image registration, computer animation) which require geometric manipulation surfaces and volumes. convergent numerical schemes are important in these applications in order to capture geometric features such as folds and corners, and avoid artificial singularities which arise from bad representations of the operators. in general these equations are considered too difficult to solve, which is why linearized models or other approximations are commonly used. progress has recently been made in building solvers for a class of geometric pdes. i'll discuss a few important geometric pdes which can be solved using a numerical method called wide stencil finite difference schemes: monge-ampere, convex envelope, infinity laplace, mean curvature, and others. focusing in on the monge-ampere equation, which is the seminal geometric pde, i'll show how naive schemes can work well for smooth solutions, but break down in the singular case. several groups of researchers have proposed numerical schemes which fail to converge, or converge only in the case of smooth solutions. i'll present a convergent solver which which is fast: comparable to solving the laplace equation a few times.