  We develop the Littlewood-Richardson homotopy algorithm, which uses numerical
continuation to compute solutions to Schubert problems on Grassmannians and is
based on the geometric Littlewood-Richardson rule. One key ingredient of this
algorithm is our new optimal formulation of Schubert problems in local Stiefel
coordinates as systems of equations. Our implementation can solve problem
instances with tens of thousands of solutions.
