Nash solutions to a class of non-zero-sum differential games are obtained in the form of linear feedback strategies with both constant and time-varying feedback gains. To solve the resulting two-point boundary value problem, a gradient algorithm is proposed. This algorithm is utilized to compute linear feedback Nash solutions for two examples, and the costs are compared with open loop costs. Several specific strategy structures are shown to dominate the open loop solution.