We present a new numerical homotopy continuation algorithm for finding all
solutions to Schubert problems on Grassmannians. This Littlewood-Richardson
homotopy is based on Vakil's geometric proof of the Littlewood-Richardson rule.
Its start solutions are given by linear equations and they are tracked through
a sequence of homotopies encoded by certain checker configurations to find the
solutions to a given Schubert problem. For generic Schubert problems the number
of paths tracked is optimal. The Littlewood-Richardson homotopy algorithm is
implemented using the path trackers of the software package PHCpack.
martes, 26 de enero de 2010
Solving Schubert Problems with Littlewood-Richardson Homotopies. (arXiv:1001.4125v1 [math.NA])
Suscribirse a:
Enviar comentarios (Atom)
No hay comentarios:
Publicar un comentario
Nota: solo los miembros de este blog pueden publicar comentarios.