2000 character limit reached
Numerical Schubert Calculus via the Littlewood-Richardson Homotopy Algorithm
Published 3 Feb 2018 in math.AG, cs.NA, and math.NA | (1802.00984v3)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.