We study the convergence of a variable version of the Krasnoselski-Mann algorithm applied to a primal dual fixed point problem. The link with Spingarn's partial inverse method is made, and an application to feasibility problems and mathematical programming is also proposed.