Accurate and efficient numerical solutions have been described for a selection of financial options pricing problems. The methods are based on finite difference discretisation coupled with optimal solvers of the resulting discrete systems. Regular Cartesian meshes have been combined with orthogonal co-ordinate transformations chosen for numerical accuracy rather than reduction of the differential operator to constant coefficient form. They allow detailed resolution in the regions of interest where accuracy is most desired, and grid coarsening where there is least interest. These transformations are shown to be effective in producing accurate solutions on modest computational grids. The spatial discretisation strategy is chosen to meet accuracy requirements as sell as to produce coefficient matrices with favourable sparsity and stability properties. In the case of single factor European options, a modified Crank-Nicolson, second order accurate finite difference scheme is presented, which uses adaptive upwind differences when the mesh Peclet conditions are violated. The resulting tridiagonal system of equations is solved using a direct solver. A careful study of grid refinement displays convergence towards the true solution and demonstrates a high level of accuracy can be obtained with this approach. Laplace inversion methods are also implemented as an alternative solution approach for the one-factor European option. Results are compared to those produced by the direct solver algorithm and are shown to be favourable. It is shown how Semi-Lagrange time-integration can solve the path-dependent Asian pricing problem, by integrating out the average price term and simplifying the finite difference equations into a parameterised Black-Scholes form. The implicit equations that result are unconditionally stable, second order accurate and can be solved using standard tridiagonal solvers. The Semi-Lagrange method is shown to be easily used in conjunction with co-ordinate transformations applied in both spatial directions. A variable time-stepping scheme is implemented in the algorithm. Early exercise is also easily incorporated, the resulting linear complementarity problem can be solved using a projection or penalty method (the penalty method is shown to be slightly more efficient). Second order accuracy has been confirmed for Asian options that must be held to maturity. A comparison with published results for continuous-average-rate put and call options, with and without early exercise, shows that the method achieves basis point accuracy and that Richardson extrapolation can also be applied.